Selected papers that cite this one
- Yehuda Afek, Baruch Awerbuch, Serge Plotkin, and Michael Saks. Local management of a global resource in a communication network. Journal of the ACM, 43(1):1-19, January 1996.
- Y. Afek, M. Cohen, and E. Haalman. The bit complexity of the predecessor problem. Information Processing Letters, 63(2):109-112, 28 July 1997.
- Yehuda Afek, Shay Kutten, and Moti Yung. The local detection paradigm and its application to self-stabilization. Theoretical Computer Science, 186(1-2):199-229, 30 October 1997.
- Yehuda Afek and Yossi Matias. Elections in anonymous networks. Information and Computation, 113(2):312-330, September 1994.
- Noga Alon, Richard M. Karp, David Peleg, and Douglas West. A graph-theoretic game and its application to the k-server problem. SIAM Journal on Computing, 24(1):78-100, February 1995.
- H. Attiya and M. Mavronicolas. Efficiency of semisynchronous versus asynchronous networks. Mathematical Systems Theory, 27(6):547-571, November/December 1994.
- Baruch Awerbuch, Lenore Cowen, and Mark Smith. Efficient asynchronous distributed symmetry breaking. In Proceedings of the Twenty-Sixth Annual ACM Symposium on the Theory of Computing, pages 214-223, Montréal, Québec, Canada, 23-25 May 1994.
- Baruch Awerbuch and David Peleg. Online tracking of mobile users. Journal of the ACM, 42(5):1021-1058, September 1995.
- Judit Bar-Ilan and David Peleg. Scheduling jobs using common resources. Information and Computation, 125(1):52-61, 25 February 1996.
- Edith Cohen and Uri Zwick. All-pairs small-stretch paths. In Proceedings of the Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, pages 93-102, New Orleans, Louisiana, 5-7 January 1997.
- Richard Cole and Ofer Zajicek. The expected advantage of asynchrony. Journal of Computer and System Sciences, 51(2):286-300, October 1995.
- Richard Cole and Ofer Zajicek. An asynchronous parallel algorithm for undirected graph connectivity. Journal of Algorithms, 18(1):50-97, January 1995.
- Shlomi Dolev, Evangelos Kranakis, Danny Krizanc, and David Peleg. Bubbles: Adaptive routing scheme for high-speed dynamic networks (extended abstract). In Proceedings of the Twenty-Seventh Annual ACM Symposium on the Theory of Computing, pages 528-537, Las Vegas, Nevada, 29 May-1 June 1995.
- Dorit Dor, Shay Halperin, and Uri Zwick. All pairs almost shortest paths. In 37th Annual Symposium on Foundations of Computer Science, pages 452-461, Burlington, Vermont, 14-16 October 1996. IEEE.
- S. Even and S. Rajsbaum. Unison, canon, and sluggish clocks in networks controlled by a synchronizer. Mathematical Systems Theory, 28(5):421-435, September/October 1995.
- S. Even and S. Rajsbaum. The use of a synchronizer yields the maximum computation rate in distributed networks. Theory of Computing Systems, 30(5):447-474, September/October 1997.
- Juan A. Garay, Shay Kutten, and David Peleg. A sublinear time distributed algorithm for minimum-weight spanning trees. SIAM Journal on Computing, 27(1):302-316, February 1998.
- Naveen Garg, Vijay V. Vazirani, and Mihalis Yannakakis. Approximate max-floor min-(multi)cut theorems and their applications. SIAM Journal on Computing, 25(2):235-251, April 1996.
- Rabah Harbane and Carles Padró Spanners of de Bruijn and Kautz graphs. Information Processing Letters, 62(5):231-236, 13 June 1997.
- Jon Kleinberg and Ronitt Rubinfeld. Short paths in expander graphs. In 37th Annual Symposium on Foundations of Computer Science, pages 86-95, Burlington, Vermont, 14-16 October 1996. IEEE.
- Shay Kutten and David Peleg. Fast distributed construction of small k-dominating sets and applications. Journal of Algorithms, 28(1):40-66, July 1998.
- Alessandro Panconesi and Aravind Srinivasan. On the complexity of distributed network decomposition. Journal of Algorithms, 20(2):356-374, March 1996.
- Baruch Schieber and Marc Snir. Calling names on nameless networks. Information and Computation, 113(1):80-101, 15 August 1994.
- John N. Tsitsiklis and George D. Stamoulis. On the average communication complexity of asynchronous distributed algorithms. Journal of the ACM, 42(2):382-400, March 1995.
- G. Venkatesan, U. Rotics, M. S. Madanlal, J. A. Makowsky, and C. Pandu Rangan. Restrictions of minimum spanner problems. Information and Computation, 136(2):143-164, 1 August 1997.