AAAAAA

   
Results: 1-11 |
Results: 11
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 COMPUTATIONAL VIEW OF POPULATION-GENETICS
Authors: RABANI Y RABINOVICH Y SINCLAIR A
Citation: Y. Rabani et al., A COMPUTATIONAL VIEW OF POPULATION-GENETICS, Random structures & algorithms, 12(4), 1998, pp. 313-334
FAIRNESS IN SCHEDULING
Authors: AJTAI M ASPNES J NAOR M RABANI Y SCHULMAN LJ WAARTS O
Citation: M. Ajtai et al., FAIRNESS IN SCHEDULING, Journal of algorithms (Print), 29(2), 1998, pp. 306-357
BIASED RANDOM-WALKS, LYAPUNOV FUNCTIONS, AND STOCHASTIC-ANALYSIS OF BEST FIT BIN PACKING
Authors: KENYON C RABANI Y SINCLAIR A
Citation: C. Kenyon et al., BIASED RANDOM-WALKS, LYAPUNOV FUNCTIONS, AND STOCHASTIC-ANALYSIS OF BEST FIT BIN PACKING, Journal of algorithms, 27(2), 1998, pp. 218-235
AN O(LOG-K) APPROXIMATE MIN-CUT MAX-FLOW THEOREM AND APPROXIMATION ALGORITHM
Authors: AUMANN Y RABANI Y
Citation: Y. Aumann et Y. Rabani, AN O(LOG-K) APPROXIMATE MIN-CUT MAX-FLOW THEOREM AND APPROXIMATION ALGORITHM, SIAM journal on computing, 27(1), 1998, pp. 291-301
DETERMINISTIC MANY-TO-MANY HOT POTATO ROUTING
Authors: BORODIN A RABANI Y SCHIEBER B
Citation: A. Borodin et al., DETERMINISTIC MANY-TO-MANY HOT POTATO ROUTING, IEEE transactions on parallel and distributed systems, 8(6), 1997, pp. 587-596
COMPETITIVE ALGORITHMS FOR DISTRIBUTED DATA MANAGEMENT
Authors: BARTAL Y FIAT A RABANI Y
Citation: Y. Bartal et al., COMPETITIVE ALGORITHMS FOR DISTRIBUTED DATA MANAGEMENT, Journal of computer and system sciences, 51(3), 1995, pp. 341-358
A DETERMINISTIC O(K(3))-COMPETITIVE K-SERVER ALGORITHM FOR THE CIRCLE
Authors: FIAT A RABANI Y RAVID Y SCHIEBER B
Citation: A. Fiat et al., A DETERMINISTIC O(K(3))-COMPETITIVE K-SERVER ALGORITHM FOR THE CIRCLE, Algorithmica, 11(6), 1994, pp. 572-578
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
COMPETITIVE KAPPA-SERVER ALGORITHMS
Authors: FIAT A RABANI Y RAVID Y
Citation: A. Fiat et al., COMPETITIVE KAPPA-SERVER ALGORITHMS, Journal of computer and system sciences, 48(3), 1994, pp. 410-428
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
Risultati: 1-11 |