Randomized routing with shorter paths
- Eli Upfal
- Sergio Felperin
- et al.
- 1996
- IEEE TPDS
Publications
Date
Featured collections
Popular topics
39 results for E. Upfal
Dynamic deflection routing on arrays
- Andrei Broder
- Eli Upfal
- 1996
- STOC 1996
An efficient algorithm for the vertex-disjoint paths problem in random graphs
- Andrei Z. Broder
- Alan M. Frieze
- et al.
- 1996
- SODA 1996
The worst-case running time of the random simplex algorithm is exponential in the height
- Andrei Z. Broder
- Martin E. Dyer
- et al.
- 1995
- Information Processing Letters
Efficient routing in all-optical networks
- Prabhakar Raghavan
- Eli Upfal
- 1994
- STOC 1994
Balanced allocations
- Y. Azar
- Andrei Z. Broder
- et al.
- 1994
- STOC 1994
Near‐perfect token distribution
- Andrei Z. Broder
- A.M. Frieze
- et al.
- 1994
- Random Structures & Algorithms
Tolerating a linear number of faults in networks of bounded degree
- Eli Upfal
- 1994
- Information and Computation
Randomized routing with shorter paths
- Eli Upfal
- Sergio Feleprin
- et al.
- 1993
- SPAA 1993
How much can hardware help routing?
- Allan Borodin
- Prabhakar Raghavan
- et al.
- 1993
- STOC 1993