Author:
Khan Maleq,Kuhn Fabian,Malkhi Dahlia,Pandurangan Gopal,Talwar Kunal
Publisher
Springer Science and Business Media LLC
Subject
Computational Theory and Mathematics,Computer Networks and Communications,Hardware and Architecture,Theoretical Computer Science
Reference35 articles.
1. Afek Y., Ricklin M.: Sparser: a paradigm for running distributed algorithms. J. Algorithms 14(2), 316–328 (1993)
2. Awerbuch, B.: Optimal distributed algorithms for minimum weight spanning tree, counting, leader election, and related problems. In: Proceedings of the 19th ACM Symposium on Theory of Computing (STOC), pp. 230–240. ACM (1987)
3. Bartal, Y.: Probabilistic approximations of metric spaces and its algorithmic applications. In: Proceedings of the 37th Annual Symposium on Foundations of Computer Science (FOCS), pp. 184–193. IEEE Computer Society (1996)
4. Bartal, Y.: On approximating arbitrary metrics by tree metrics. In: Proceedings of the 30th ACM Symposium on Theory of Computing (STOC), pp. 161–168. ACM (1998)
5. Bartal, Y., Byers, J., Raz, D.: Global optimization using local information with applications to flow control. In: Proceedings of the 38th Annual Symposium on Foundations of Computer Science (FOCS), pp. 303–312. IEEE Computer Society (1997)
Cited by
32 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献