Author:
Mashreghi Ali,King Valerie
Funder
Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada
Publisher
Springer Science and Business Media LLC
Subject
Computational Theory and Mathematics,Computer Networks and Communications,Hardware and Architecture,Theoretical Computer Science
Reference32 articles.
1. Ahn, K.J., Guha, S., McGregor, A.: Graph sketches: sparsification, spanners, and subgraphs. In: Proceedings of the 31st ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems, pp. 5–14. ACM (2012)
2. Awerbuch, B.: Complexity of network synchronization. J ACM 32(4), 804–823 (1985)
3. Awerbuch, B.: Optimal distributed algorithms for minimum weight spanning tree, counting, leader election, and related problems. In: Proceedings of the Nineteenth Annual ACM Symposium on Theory of computing, pp. 230–240. ACM (1987)
4. Awerbuch, B., Goldreich, O., Vainish, R.: On the Message Complexity of Broadcast: A Basic Lower Bound. Laboratory for Computer Science, Massachusetts Institute of Technology, Cambridge (1987)
5. Awerbuch, B., Goldreich, O., Vainish, R., Peleg, D.: A trade-off between information and communication in broadcast protocols. J ACM 37(2), 238–256 (1990)
Cited by
5 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献