Complexity of network synchronization
Improved routing strategies with succinct tables
Routing with Polynomial Communication-Space Srade-ff
Minimizing the flow time without migration
Globalizing business, education, culture through the Internet
Journal of Algorithms
Proceedings of the thirty-first annual ACM symposium on Theory of computing - STOC ’99
Communications of the ACM
Journal of the ACM
SIAM Journal on Discrete Mathematics
David Peleg
Jacob Slonim
Amotz Bar-Noy
Yossi Azar
Nathan Linial
Peter Wegner
Bypassing the embedding
Multi-processor scheduling to minimize flow time with ? resource augmentation
New sparseness results on graph spanners
Acculturation to the global culture and internet adoption