Author:
Awerbuch Baruch,Goldreich Oded,Peleg David,Vainish Ronen
Reference11 articles.
1. B. Awerbuch, “Complexity of Network Synchronization”, Jour. of ACM, Vol. 32, No. 4, 1985, pp. 804–823.
2. B. Awerbuch, O. Goldreich and R. Vainish, “On the Message Complexity of Broadcast: Basic Lower Bound”, Technical memo, MIT/LCS/TM-325, April 1987.
3. B. Bollobas, Extremal Graph Theory, Academic Press, 1978.
4. J.E. Burns, “A Formal Model for Message Passing Systems”, TR-91, Indiana University, (1980).
5. Y.K. Dalal and R. Metcalfe, “Reserve Path Forwarding of Broadcast Packets”, Comm. ACM, Vol. 21, No. 12, pp. 1040–1048, 1978.
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献