AAAAAA

   
Results: 1-7 |
Results: 7
COMPETITIVE ALGORITHMS FOR LAYERED GRAPH TRAVERSAL
Authors: FIAT A FOSTER DP KARLOFF H RABANI Y RAVID Y VISHWANATHAN S
Citation: A. Fiat et al., COMPETITIVE ALGORITHMS FOR LAYERED GRAPH TRAVERSAL, SIAM journal on computing (Print), 28(2), 1999, pp. 448-463
A BETTER APPROXIMATION ALGORITHM FOR FINDING PLANAR SUBGRAPHS
Authors: CALINESCU G FERNANDES CG FINKLER U KARLOFF H
Citation: G. Calinescu et al., A BETTER APPROXIMATION ALGORITHM FOR FINDING PLANAR SUBGRAPHS, Journal of algorithms, 27(2), 1998, pp. 269-302
ON CONSTRUCTION OF K-WISE INDEPENDENT RANDOM-VARIABLES
Authors: KARLOFF H MANSOUR Y
Citation: H. Karloff et Y. Mansour, ON CONSTRUCTION OF K-WISE INDEPENDENT RANDOM-VARIABLES, Combinatorica, 17(1), 1997, pp. 91-107
NEW ALGORITHMS FOR AN ANCIENT SCHEDULING PROBLEM
Authors: BARTAL Y FIAT A KARLOFF H VOHRA R
Citation: Y. Bartal et al., NEW ALGORITHMS FOR AN ANCIENT SCHEDULING PROBLEM, Journal of computer and system sciences, 51(3), 1995, pp. 359-366
LOWER BOUNDS FOR RANDOMIZED K-SERVER AND MOTION-PLANNING ALGORITHMS
Authors: KARLOFF H RABANI Y RAVID Y
Citation: H. Karloff et al., LOWER BOUNDS FOR RANDOMIZED K-SERVER AND MOTION-PLANNING ALGORITHMS, SIAM journal on computing, 23(2), 1994, pp. 293-312
A BETTER LOWER-BOUND FOR ONLINE SCHEDULING
Authors: BARTAL Y KARLOFF H RABANI Y
Citation: Y. Bartal et al., A BETTER LOWER-BOUND FOR ONLINE SCHEDULING, Information processing letters, 50(3), 1994, pp. 113-116
FAST ALGORITHMS FOR APPROXIMATELY COUNTING MISMATCHES
Authors: KARLOFF H
Citation: H. Karloff, FAST ALGORITHMS FOR APPROXIMATELY COUNTING MISMATCHES, Information processing letters, 48(2), 1993, pp. 53-60
Risultati: 1-7 |