Distributed Computing on Anonymous Hypercube Networks

Journal of Algorithms

Volumn 23, Issue 1, 1997, Pages 32-50

  Kranakis, Evangelos ^a,b   Krizanc, Danny ^c  

^a CWI   (Netherlands)

^b CARLETON UNIVERSITY   (Canada)

^c University of Rochester   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0002113805     PISSN: 01966774     EISSN: None     Source Type: Journal    
DOI: 10.1006/jagm.1996.0817     Document Type: Article

References (14)

1. K. Abrahamson, A. Adler, L. Higham, and D. Kirkpatrick, Randomized evaluation on a ring, in "Distributed Algorithms, 2nd International Workshop, Amsterdam, The Netherlands, July 1987," (Jan van Leeuwen, Ed.), Vol. 312, pp. 324-331, Springer Verlag Lecture Notes in Computer Science, 1988.
2. D. Angluin, Local and global properties in networks of processors, in "12th Annual ACM Symposium on Theory of Computing," pp. 82-93, 1980.
3. H. Attiya and M. Snir, Better computing on the anonymous ring, J. Algorithms 12(2) (June 1991), 204-238.
4. H. Attiya, M. Snir, and M. Warmuth, Computing on an anonymous ring, J. Assoc. Comput. Mach. 35(4) (1988), 845-875.
5. P. W. Beame and H. L. Bodlaender, Distributed computing on transitive networks: The torus, in "6th Annual Symposium on Theoretical Aspects of Computer Science, STAGS, (B. Monien and R. Cori, Eds.), pp. 294-303, Springer Verlag Lecture Notes in Computer Science, 1989.
6. A. Cohen (Ed.), Special issue on computational group theory, CWI Quarterly 5(2) (1992).
7. M. D. Atkinson (Ed.), "Computational Group Theory," Academic Press, San Diego, 1984.
8. P. Flocchini, B. Mans, and N. Santoro, Sense of direction: Formal definitions and properties, in "Proceedings of First International Conference on Structure, Information and Communication Complexity," (N. Santoro, P. Flocchini, and B. Mans, Eds.), pp. 9-33, Carleton Univ. Press, 1985.
9. E. Kranakis and D. Krizanc, Distributed computing on Cayley networks, in "Proceedings of the 4th IEEE Symposium on Parallel and Distributed Processing," pp. 222-229, 1992.
10. E. Kranakis, D. Krizanc, and J. van der Berg, Computing boolean functions on anonymous networks, Inform. Comput. 114 (1994), 214-236.
11. S. Moran and M. Warmuth, Gap theorems for distributed computation, in "5th Annual ACM Symposium on Principles of Distributed Computing," pp. 131-140, 1986.
12. J. Pachl, E. Korach, and D. Rotem, A new technique for proving lower bounds for distributed maximum finding algorithms, J. Assoc. Comput. Mach. 31(4) (Oct. 1984), 905-918.
13. H. Wielandt, "Finite Permutation Groups," Academic Press, San Diego, 1964.
14. M. Yamashita and T. Kameda, Computing on an anonymous network, in "7th Annual ACM Symposium on Principles of Distributed Computing," pp. 117-130, 1988.