A tradeoff between space and efficiency for routing tables
- David Peleg
- Eli Upfal
- 1988
- STOC 1988
Publications
Date
Featured collections
Popular topics
39 results for E. Upfal
A time-randomness tradeoff for oblivious routing
- Danny Krizanc
- David Peleg
- et al.
- 1988
- STOC 1988
Balanced allocations
- Yossi Azar
- Andrei Z. Broder
- et al.
- 1999
- SIAM Journal on Computing
Static and dynamic path selection on expander graphs: A random walk approach
- Andrei Z. Broder
- Alan M. Frieze
- et al.
- 1999
- Random Structures and Algorithms
Reliable Fault Diagnosis with Few Tests
- Andrzej Pelc
- Eli Upfal
- 1998
- Combinatorics Probability and Computing
A steady state analysis of diffracting trees
- N. Shavit
- E. Upfal
- et al.
- 1998
- Theory of Computing Systems
Efficient algorithms for all-to-all communications in multiport message-passing systems
- Jehoshua Bruck
- Ching-Tien Ho
- et al.
- 1997
- IEEE TPDS
Randomized routing with shorter paths
- Eli Upfal
- Sergio Felperin
- et al.
- 1996
- IEEE TPDS
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
Near‐perfect token distribution
- Andrei Z. Broder
- A.M. Frieze
- et al.
- 1994
- Random Structures & Algorithms