Selected papers that cite this one
- Karl Abrahamson, Andrew Adler, Lisa Higham, and David Kirkpatrick. Tight lower bounds for probabilistic solitude verification on anonymous rings. Journal of the ACM, 41(2):277-310, March 1994.
- Paola Alimonti, Paola Flocchini, and Nicola Santoro. Finding the extrema of a distributed multiset. Journal of Parallel and Distributed Computing, 37(2):123-133, 15 September 1996.
- Hans L. Bodlaender, Shlomo Moran, and Manfred K. Warmuth. The distributed bit complexity of the ring: From the anonymous to the non-anonymous case. Information and Computation, 108(1):34-50, January 1994.
- Israel Cidon and Yuval Shavitt. Message terminating algorithms for anonymous rings of unknown size. Information Processing Letters, 54(2):111-119, 28 April 1995.
- Michael J. Fischer, Shlomo Moran, Steven Rudich, and Gadi Taubenfeld. The wakeup problem. SIAM Journal on Computing, 25(6):1332-1357, December 1996.
- Lisa Higham and Teresa Przytycka. A simple, efficient algorithm for maximum finding on rings. Information Processing Letters, 58(6):319-324, 24 June 1996.
- Evangelos Kranakis and Danny Krizanc. Distributed computing on anonymous hypercube networks. Journal of Algorithms, 23(1):32-50, April 1997.
- Evangelos Kranakis, Danny Krizanc, and Jacob van den Berg. Computing Boolean functions on anonymous networks. Information and Computation, 114(2):214-236, 1 November 1994.