Publisher
Springer Berlin Heidelberg
Reference55 articles.
1. Yehuda Afek, Baruch Awerbuch, and Eli Gafni. Applying static network protocols to dynamic networks. In Proc. 28th IEEE Symp. on Foundations of Computer Science, October 1987.
2. B. Awerbuch, I. Cidon, S. Kutten, Y. Mansour, and D. Peleg, Broadcasting with Partial Knowledge. to appear in SIAM Journal on Computing.
3. H. Attiya, C. Dwork, N. Lynch, and L. Stockmeyer. Bounds on the Time to Reach Agreement in the Presence of Timing Uncertainty. In 23rd ACM Symposium on Theory of Computing, New Orleans, Louisiana, pp. 359–369, May 1991.
4. S. Aggarwal. Time optimal selfstabilizing spanning tree algorithms. M.Sc Thesis, MIT, May 1994.
5. B. Awerbuch, A. Goldberg, M. Luby and S. Plotkin. Network decomposition and locality in distributed computation, Proc. 30th Symp. on Foundations of Computer Science, pp. 364–375, October 1989.