Computing functions on asynchronous anonymous networks

Theory of Computing Systems

Volumn 29, Issue 4, 1996, Pages 331-356

  Yamashita, M ^a   Kameda, T ^b  

^a HIROSHIMA UNIVERSITY   (Japan)

^b SIMON FRASER UNIVERSITY   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

INFORMATION DISSEMINATION;

ANONYMOUS NETWORKS; COMPUTING FUNCTIONS; IDENTITY NUMBERS; LOWER BOUNDS; MESSAGE COMPLEXITY; UNIVERSAL ALGORITHM; VARIOUS FUNCTIONS;

COMPUTER NETWORKS;

EID: 0009966553     PISSN: 14324350     EISSN: 14330490     Source Type: Journal    
DOI: 10.1007/BF01192691     Document Type: Article

References (17)

1. J. Akiyama, A. M. Kano, and A. Saito, Factors and factorizations of graphs - a survey. Journal of Graph Theory 9 (1985), 1-42.
2. D. Angluin, Local and global properties in networks of processors, Proc. 12th ACM Symposium on Theory of Computing, 1980, pp. 82-93.
3. H. Attiya and M. Snir, Better computing on the anonymous ring. Journal of Algorithms 12 (1991), 204-238.
4. H. Attiya, M. Snir, and M. K. Warmuth, Computing on the anonymous ring. Journal of the Association for Computing Machinery 35(4) (1988), 845-875.
5. P. W. Beame and H. L. Bodlaender, Distributed computing on transitive networks: the torus, Proc. 6th Symposium on Theoretical Aspects of Computer Science, Lecture Notes in Computer Science, Vol. 349, Springer-Verlag, Berlin, 1989, pp. 294-303.
6. P. Duris and Z. Galil, Two lower bounds in asynchronous distributed computation, Journal of Computer and System Sciences 42 (1991), 245-266.
7. A. F. Harary, Graph Theory, Addison-Wesley, Reading, MA, 1969.
8. R. E. Johnson and F. B. Schneider, Symmetry and similarity in distributed systems, Proc. 4th ACM Symposium on Principles of Distributed Computing, 1985, pp. 13-22.
9. E. Kranakis and D. Krizanc, Computing boolean functions on anonymous hypercube networks (extended abstract), Technical Report CS-R9040, Center for Mathematics and Computer Science, 1990.
10. E. Kranakis, D. Krizanc, and J. van den Berg, Computing boolean functions on anonymous networks, Proc. 17th International Colloquium on Automata, Languages and Programming, Lecture Notes in Computer Science, Vol. 443, Springer-Verlag, Berlin, 1990, pp. 254-267.
11. S. Moran and M. K. Warmuth, Gap theorems for distributed computation, SIAM Journal on Computing 22(2) (1993), 379-394.
12. N. Norris, Universal covers of edge-labeled digraphs: isomorphism to depth n - 1 implies isomorphism to all depths, Applied Discrete Mathematics, to appear.
13. J. Petersen, Die Theorie der regulären Graphs, Acta Mathematica 15 (1891), 193-220.
14. M. Yamashita and T. Kameda, Computing functions on an anonymous network, LCCR Technical Report 87-16, Simon Fraser University, Canada, Burnaby, BC, 1987.
15. M. Yamashita and T. Kameda, Computing on anonymous networks, Proc. 7th ACM Symposium on Principles of Distributed Computing, 1988, pp. 117-130.
16. M. Yamashita and T. Kameda, Computing on anonymous networks, Part I: Characterizing the solvable cases, IEEE Transactions on Parallel and Distributed Systems 7(1) (1996), 69-89.
17. M. Yamashita and T. Kameda, Computing on anonymous networks, Part II: Decision and membership problems, IEEE Transactions on Parallel and Distributed Systems 7(1) (1996), 90-96.