Author:
Lenzen Christoph,Patt-Shamir Boaz,Peleg David
Funder
Schweizerischer Nationalfonds zur Förderung der Wissenschaftlichen Forschung
Swiss Society of Friends of the Weizmann Institute of Science
Deutsche Forschungsgemeinschaft
Israel Science Foundation
Ministry of Science and Technology, Israel
Citi Foundation
I-CORE program of the Israel PBC and ISF
Publisher
Springer Science and Business Media LLC
Subject
Computational Theory and Mathematics,Computer Networks and Communications,Hardware and Architecture,Theoretical Computer Science
Reference53 articles.
1. Abboud, A., Censor-Hillel, K., Khoury, S.: Near-linear lower bounds for distributed distance computations, even in sparse networks. In: Proceedings of the International Symposium on Distributed Computing (DISC), pp. 29–42 (2016). https://doi.org/10.1007/978-3-662-53426-7_3
2. Antonio, J., Huang, G., Tsai, W.: A fast distributed shortest path algorithm for a class of hierarchically clustered data networks. IEEE Trans. Comput. 41, 710–724 (1992)
3. Awerbuch, B., Bar-Noy, A., Linial, N., Peleg, D.: Compact distributed data structures for adaptive network routing. In: Proceedings of the 21st ACM Symposium on Theory of Computing, pp. 230–240 (1989)
4. Awerbuch, B., Bar-Noy, A., Linial, N., Peleg, D.: Improved routing strategies with succinct tables. J. Algorithms 11(3), 307–341 (1990)
5. Awerbuch, B., Berger, B., Cowen, L., Peleg, D.: Near-linear cost sequential and distribured constructions of sparse neighborhood covers. In: Proceedings 34th Symposium on Foundations of Computer Science (FOCS), pp. 638–647 (1993)
Cited by
15 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. A Survey of Distributed Graph Algorithms on Massive Graphs;ACM Computing Surveys;2024-09-05
2. Sparse Spanners with Small Distance and Congestion Stretches;Proceedings of the 36th ACM Symposium on Parallelism in Algorithms and Architectures;2024-06-17
3. Computing Minimum Weight Cycle in the CONGEST Model;Proceedings of the 43rd ACM Symposium on Principles of Distributed Computing;2024-06-17
4. Decentralized Low-Stretch Trees via Low Diameter Graph Decompositions;SIAM Journal on Computing;2024-03-13
5. k-Center Clustering in Distributed Models;Lecture Notes in Computer Science;2024