{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,16]],"date-time":"2025-07-16T13:17:06Z","timestamp":1752671826840},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540528265"},{"type":"electronic","value":"9783540471592"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1990]]},"DOI":"10.1007\/bfb0032037","type":"book-chapter","created":{"date-parts":[[2005,12,11]],"date-time":"2005-12-11T06:05:31Z","timestamp":1134281131000},"page":"254-267","source":"Crossref","is-referenced-by-count":3,"title":["Computing boolean functions on anonymous networks"],"prefix":"10.1007","author":[{"given":"Evangelos","family":"Kranakis","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Danny","family":"Krizanc","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jacob","family":"van den Berg","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,27]]},"reference":[{"key":"21_CR1","doi-asserted-by":"crossref","first-page":"324","DOI":"10.1007\/BFb0019812","volume":"312","author":"K. Abrahamson","year":"1988","unstructured":"Karl Abrahamson, Andrew Adler, Lisa Higham, and David Kirkpatrick. Randomized evaluation on a ring. In Jan van Leeuwen, editor, Distributed Algorithms, 2nd International Workshop, Amsterdam, The Netherlands, July 1987, volume 312, pages 324\u2013331, Heidelberg, 1988. Springer Verlag Lecture Notes in Computer Science.","journal-title":"Distributed Algorithms, 2nd International Workshop, Amsterdam, The Netherlands, July 1987"},{"key":"21_CR2","doi-asserted-by":"crossref","unstructured":"Dana Angluin. Local and global properties in networks of processors. In 12th Annual ACM Symposium on Theory of Computing, pages 82\u201393, 1980.","DOI":"10.1145\/800141.804655"},{"key":"21_CR3","unstructured":"Hagit Attiya and Mark Snir. Better computing on the anonymous ring. Technical Report RC 13657 (number 61107), IBM T. J. Watson Research Center, November 1988. 33 pages."},{"key":"21_CR4","doi-asserted-by":"crossref","unstructured":"Chagit Attiya, Mark Snir, and Manfred Warmuth. Computing on an anonymous ring. In 4th Annual ACM Symposium on Principles of Distributed Computation, pages 196\u2013203, 1985.","DOI":"10.1145\/323596.323614"},{"key":"21_CR5","doi-asserted-by":"crossref","unstructured":"Paul W. Beame and Hans L. Bodlaender. Distributed computing on transitive networks: The torus. In B. Monien and R. Cori, editors, 6th Annual Symposium on Theoretical Aspects of Computer Science, STACS, pages 294\u2013303, Heidelberg, 1989. Springer Verlag Lecture Notes in Computer Science.","DOI":"10.1007\/BFb0028993"},{"key":"21_CR6","doi-asserted-by":"crossref","unstructured":"Norman Biggs. Algebraic Graph Theory. Cambridge University Press, 1974.","DOI":"10.1017\/CBO9780511608704"},{"issue":"1","key":"21_CR7","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1007\/BF01048273","volume":"2","author":"A. Broder","year":"1989","unstructured":"A. Broder and A. Karlin. Bounds on the cover time. Journal of Theoretical Probability, 2(1):101\u2013120, 1989.","journal-title":"Journal of Theoretical Probability"},{"issue":"4","key":"21_CR8","first-page":"89","volume":"2","author":"P. J. Cameron","year":"1983","unstructured":"Peter J. Cameron. Automorphism groups of graphs. In Lowell W. Beineke and Robin J Wilson, editors, Selected Topics in Graph Theory, Volume 2, chapter 4, pages 89\u2013127. Academic Press Inc., 1983.","journal-title":"Selected Topics in Graph Theory"},{"key":"21_CR9","doi-asserted-by":"crossref","unstructured":"P. Duris and Z. Galil. Two lower bounds in asynchronous distributed computation. In Proceedings 28th Annual IEEE Symposium on Foundations of Computer Science, pages 326\u2013330, 1987.","DOI":"10.1109\/SFCS.1987.60"},{"key":"21_CR10","doi-asserted-by":"crossref","unstructured":"Joel Friedman, Jeff Kahn, and Endre Szemer\u00e9di. On the second eigenvalue of random regular graphs. In 21st Annual ACM Symposium on Theory of Computing, pages 587\u2013598, 1989.","DOI":"10.1145\/73007.73063"},{"key":"21_CR11","unstructured":"F. R. Gantmacher. Matrix Theory. Chelsea Publishing Company, 1959. Translated from the Russian."},{"key":"21_CR12","doi-asserted-by":"crossref","unstructured":"E. Kranakis and D. Krizanc. Computing boolean functions on a distributed hypercube network, 1990. unpublished manuscript.","DOI":"10.1007\/BFb0032037"},{"key":"21_CR13","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1016\/0024-3795(81)90003-3","volume":"38","author":"H. J. Landau","year":"1981","unstructured":"H. J. Landau and A. M. Odlyzko. Bounds for eigenvalues of certain stochastic matrices. Linear Algebra and its Applications, 38:5\u201315, 1981.","journal-title":"Linear Algebra and its Applications"},{"key":"21_CR14","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1007\/3-540-51687-5_42","volume":"392","author":"Y. Matias","year":"1989","unstructured":"Y. Matias and Y. Afek. Simple and efficient election algorithms for anonymous networks. In J.-C. Bermond and M. Raynal, editors, Distributed Algorithms, 3nd International Workshop, Nice, France, September 1989, volume 392, pages 183\u2013194, Heidelberg, 1989. Springer Verlag Lecture Notes in Computer Science.","journal-title":"Distributed Algorithms, 3nd International Workshop, Nice, France, September 1989"},{"key":"21_CR15","doi-asserted-by":"crossref","unstructured":"S. Moran and M. Warmuth. Gap theorems for distributed computation. In 5th Annual ACM Symposium on Principles of Distributed Computation, pages 131\u2013140, 1986.","DOI":"10.1145\/10590.10602"},{"issue":"4","key":"21_CR16","doi-asserted-by":"crossref","first-page":"905","DOI":"10.1145\/1634.1889","volume":"31","author":"J. Pachl","year":"1984","unstructured":"J. Pachl, E. Korach, and D. Rotem. A new technique for proving lower bounds for distributed maximum finding algorithms. J. of the ACM, 31(4):905\u2013918, October 1984.","journal-title":"J. of the ACM"},{"key":"21_CR17","doi-asserted-by":"crossref","unstructured":"E. Seneta. Non-negative Matrices and Markov Chains. Springer Series in Statistics. Springer Verlag, 1981. 2nd edition.","DOI":"10.1007\/0-387-32792-4"},{"key":"21_CR18","doi-asserted-by":"crossref","unstructured":"B. Schieber and M. Snir. Calling names on nameless networks. In 8th Annual ACM Symposium on Principles of Distributed Computation, pages 319\u2013328, 1989.","DOI":"10.1145\/72981.73004"},{"key":"21_CR19","unstructured":"M. Yamashita and T. Kameda. Computing on an anonymous network. Technical Report 87-16, Laboratory for Computer and Communication Research, Simon Fraser University, 1987. 27 pages."},{"key":"21_CR20","doi-asserted-by":"crossref","unstructured":"M. Yamashita and T. Kameda. Computing on an anonymous network. In 7th Annual ACM Symposium on Principles of Distributed Computation, pages 117\u2013130, 1988.","DOI":"10.1145\/62546.62568"}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0032037","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,5]],"date-time":"2023-05-05T21:19:58Z","timestamp":1683321598000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0032037"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1990]]},"ISBN":["9783540528265","9783540471592"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/bfb0032037","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1990]]}}}