Computing boolean functions on anonymous networks

Information and Computation

Volumn 114, Issue 2, 1994, Pages 214-236

  Kranakis, E ^a,b   Krizanc, Danny ^a,b   Van Den Berg, Jacob ^b  

^a CARLETON UNIVERSITY   (Canada)

^b CWI   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0004285597     PISSN: 08905401     EISSN: 10902651     Source Type: Journal    
DOI: 10.1006/inco.1994.1086     Document Type: Article

References (25)

1. Abrahamson, K., Adler, A., Higham, L., and Kirkpatrick, D. (1988), Randomized evaluation on a ring, in "Distributed Algorithms, 2nd International Workshop, Amsterdam, The Netherlands, July 1987" (J. van Leeuwen, Ed.), pp. 324-331, Lecture Notes in Computer Science, Vol. 312, Springer-Verlag, Berlin/New York.
2. Angluin, D. (1980), Local and global properties in networks of processors, in "12th Annual ACM Symposium on Theory of Computing," pp. 82-93.
3. Attiya, H., and Snir, M. (1991), Better computing on the anonymous ring, J. Algorithms 12, 204-238.
4. Attiya, H., Snir, M., and Warmuth, M. (1988), Computing on an anonymous ring, J. Assoc. Comput. Mach. 35, 845-875.
5. Attiya, H., Snir, M., and Warmuth, M. A short version appeared in "Proceedings of the 4th Annual ACM Symposium on Principles of Distributed Computation," (1985).
6. Beame, P.W., and Bodleander, H. L. (1989), Distributed computing on transitive networks: The torus, in "6th Annual Symposium on Theoretical Aspects of Computer Science, STACS" (B. Monien and R. Cori, Eds.), pp. 294-303, Lecture Notes in Computer Science, Springer-Verlag, Berlin/New York.
7. Biggs, N. (1974), "Algebraic Graph Theory," Cambridge Univ. Press, London/New York.
8. Broder, A., and Karlin, A. (1989), Bounds on the cover time, J. Theorel. Probab. 2 (1), 101-120.
9. Brouwer, A. E., Cohen, A. M., and Neumaier, A. (1989), "Distance-Regular Graphs," Ergebnisse der Mathematik und ihrer Grenzgebiete, 3. Folge, Vol. 18, Springer-Verlag, Berlin/New York.
10. Cameron, P.J. (1983), Automorphism groups of graphs, in "Selected Topics in Graph Theory" (L. W. Beineke and R.J, Wilson, Eds.), Vol.2, Chap. 4, pp. 89-127, Academic Press, San Diego.
11. Duris, P., and Galil, Z. (1987), Two lower bounds in asynchronous distributed computation, in "Proceedings 28th Annual IEEE Symposium on Foundations of Computer Science," pp. 326-330.
12. Friedman, J., Kahn, J., and Szemerédi, E. (1989), On the second eigenvalue of random regular graphs, in "21st Annual ACM Symposium on Theory of Computing," pp. 587-598.
13. Gantmacher, F. R. (1959), "Matrix Theory," Chelsea New York.
14. Kranakis, E., and Krizanc, D. (1990), "Computing Boolean Functions on Cayley Networks," Technical Report CS R90-61, Centrum voor Wiskunde en Informatica, Department of Algorithms and Architecture.
15. Kranakis, E., and Krizanc, D. (1991), Distributed computing on anonymous hypercube networks, in "Proceedings of the 3rd IEEE Symposium on Parallel and Distributed Processing, Dallas."
16. Landau, H. J., and Odlyzko, A. M. (1981), Bounds for eigenvalues of certain stochastic matrices, Linear Algebra Appl. 38, 5-15.
17. Matias, Y„ and Afek, Y. (1989), Simple and efficient election algorithms for anonymous networks, in "Distributed Algorithms, 3nd International Workshop, Nice, France" (J. C. Bermond and M. Raynal, Eds.), pp. 183-194, Lecture Notes in Computer Science, Vol. 392, Springer-Verlag, Berlin/New York.
18. Moran, S., and Warmuth, M. (1986), Gap theorems for distributed computation, in "5th Annual ACM Symposium on Principles of Distributed Computation," pp. 131-140.
19. Norris, N. (1990), "Universal Covers off Edge-Labeled Digraphs'. Isomorphism to Depth n — 1 Implies Isomorphism to All Depths," Technical Report UCSC-CRL-90-49, Univ. of California at Santa Cruz.
20. Pachl, J., Korach, E., and Rotem, D. (1984), A new technique for proving lower bounds for distributed maximum finding algorithms, J. Assoc. Comput. Mach. 31 (4), 905-918.
21. Schieber, B., and Snir, M. (1989), Calling names on nameless networks, in "8th Annual ACM Symposium on Principles of Distributed Computation," pp. 319-328.
22. Seneta, E. (1981), "Non-negative Matrices and Markov Chains," 2nd ed., Springer Series in Statistics, Springer-Verlag, Berlin/New York.
23. Tel, G. (1988), Directed network protocols, in "Proceedings of 2nd International Workshop on Distributed Algorithms, Amsterdam" (J. van Leeuwen, Ed.), pp. 13-29, Lecture Notes in Computer Science, Vol. 312, Springer-Verlag, Heidelberg.
24. Yamashita, M., and Kameda, T. (1987), "Computing Functions on an Anonymous Network," Technical Report 87-16, Laboratory for Computer and Communication Research, Simon Fraser University.
25. Yamashita, M., and Kameda, T. (1988), Computing on an anonymous network, in "7th Annual ACM Symposium on Principles of Distributed Computation," pp. 117-130.