Author:
Flammini Michele,van Leeuwen Jan,Marchetti-Spaccamela Alberto
Publisher
Springer Berlin Heidelberg
Reference49 articles.
1. Y. Afek, E. Gafni, M. Ricklin. Upper and lower bounds for routing schemes in dynamic networks. Proc. 30th Annual IEEE Symp. on Foundations of Computer Science, pp. 370–375, 1989.
2. B. Awerbuch, A. Bar-Noy, N. Linial, D. Peleg. Compact distributed data structures for adaptive routing. Proc. 21st Annual ACM Symp. on Theory of Computing, pp. 479–489, 1989.
3. B. Awerbuch, A. Bar-Noy, N. Linial, D. Peleg. Improved routing strategies with succinct tables. Journal of Algorithms, 11, pp. 307–341, 1990.
4. B. Awerbuch, D. Peleg. Routing with polynomial communication-space tradeoff. SIAM Journal on Discrete Math, 5, pp. 151–162, 1992.
5. E.M. Bakker. Combinatorial Problems in Information Networks and Distributed Datastructuring, Ph.D. Thesis, Dept. of Computer Science, Utrecht University, 1991.
Cited by
10 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献