Author:
Dourisboure Yon,Gavoille Cyril
Publisher
Springer Berlin Heidelberg
Reference31 articles.
1. Baruch Awerbuch, Amotz Bar-Noy, Nathan Linial, and David Peleg. Compact distributed data structures for adaptive routing. In 21st Symposium on Theory of Computing (STOC), volume 2, pages 230–240, May 1989.
2. Baruch Awerbuch, Amotz Bar-Noy, Nathan Linial, and David Peleg. Improved routing strategies with succinct tables. Journal of Algorithms, 11(3):307–341, September 1990.
3. Baruch Awerbuch and David Peleg. Sparse partitions. In 31th Symposium on Foundations of Computer Science (FOCS), pages 503–513. IEEE Computer Society Press, 1990.
4. Baruch Awerbuch and David Peleg. Routing with polynomial communication-space trade-off. SIAM Journal on Discrete Mathematics, 5(2):151–162, May 1992.
5. Stephen Alstrup and Theis Rauhe. Improved labeling scheme for ancestor queries. In 13th Symposium on Discrete Algorithms (SODA). ACM-SIAM, January 2001. To appear.
Cited by
8 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献