{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,24]],"date-time":"2025-10-24T08:01:33Z","timestamp":1761292893832},"publisher-location":"Berlin, Heidelberg","reference-count":23,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540180883"},{"type":"electronic","value":"9783540477471"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1987]]},"DOI":"10.1007\/3-540-18088-5_29","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T19:26:12Z","timestamp":1330197972000},"page":"347-356","source":"Crossref","is-referenced-by-count":12,"title":["Guessing games and distributed computations in synchronous networks"],"prefix":"10.1007","author":[{"given":"Jan","family":"Leeuwen","sequence":"first","affiliation":[]},{"given":"Nicola","family":"Santoro","sequence":"additional","affiliation":[]},{"given":"Jorge","family":"Urrutia","sequence":"additional","affiliation":[]},{"given":"Shmuel","family":"Zaks","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,5,29]]},"reference":[{"key":"29_CR1","doi-asserted-by":"crossref","unstructured":"K. Abrahamson, A. Adler, R. Gelbart, L. Higham, D. Kirkpatrick, \"The bit complexity of probabilistic leader election on a unidirectional ring\", Proc. 1st Int. Workshop on Distributed Algorithms on Graphs, Aug. 1985. 3\u201311.","DOI":"10.1515\/9780773573475-001"},{"key":"29_CR2","doi-asserted-by":"crossref","unstructured":"D. Angluin, \"Local and global properties in networks of processes\", Proc. 12th ACM Symp. on Theory of Computing, April 1980, 82\u201393.","DOI":"10.1145\/800141.804655"},{"key":"29_CR3","doi-asserted-by":"crossref","unstructured":"C. Attiya, M. Snir, M. Warmuth, \"Computing on an anonymous ring\", Proc. 4th ACM Symp. on Principles of Distributed Computing, Aug. 1985, 196\u2013204.","DOI":"10.1145\/323596.323614"},{"key":"29_CR4","doi-asserted-by":"crossref","unstructured":"J.L. Bentley, D.J. Brown, \"A general class of resource tradeoffs\", Proc. 21th Symp. on Foundations of Computer Science, Oct. 1980, 217\u2013228.","DOI":"10.1109\/SFCS.1980.4"},{"key":"29_CR5","doi-asserted-by":"crossref","unstructured":"H.L. Brolaender, J. van Leeuwen, \"New upperbounds for distributed extrema-finding in a ring of processors\", Proc. Int. Workshop on Distributed Algorithms on Graphs, Aug. 1985, 27\u201340.","DOI":"10.1515\/9780773573475-003"},{"key":"29_CR6","unstructured":"J. Burns, \"A formal model for message passing systems\", TR-91, Indiana University, Sept. 1981."},{"key":"29_CR7","doi-asserted-by":"crossref","first-page":"391","DOI":"10.1109\/TSE.1982.235573","volume":"-8","author":"E.J. Chang","year":"1982","unstructured":"E.J. Chang, \"Echo algorithms: depth parallel operations on general graphs\", IEEE Trans. Softw. Eng. SE-8, 1982, 391\u2013400.","journal-title":"IEEE Trans. Softw. Eng. SE"},{"key":"29_CR8","doi-asserted-by":"crossref","first-page":"245","DOI":"10.1016\/0196-6774(82)90023-2","volume":"3","author":"D. Dolev","year":"1983","unstructured":"D. Dolev, M. Klawe, M. Rodeh, \"An O(n log n) unidirectional algorithm for extrema-finding in a circle\", J. Algorithms 3, 1983, 245\u2013260.","journal-title":"J. Algorithms"},{"key":"29_CR9","doi-asserted-by":"crossref","unstructured":"G.N. Frederickson, N. Lynch, \"The impact of synchronous communication on the problem of electing a leader in a ring\", Proc. 16th ACM Symp. Theory of Computing, April 1984, 493\u2013503.","DOI":"10.1145\/800057.808719"},{"key":"29_CR10","doi-asserted-by":"crossref","unstructured":"G.N. Frederickson, N. Santoro, \"Symmetry breaking in synchronous networks\", Proc. 2nd Int. Workshop on Parallel Computing and VLSI, July 1986, 26\u201333.","DOI":"10.1007\/3-540-16766-8_3"},{"key":"29_CR11","doi-asserted-by":"crossref","unstructured":"E. Gafni, \"Improvements in the time complexity of two message-optimal election algorithms\", Proc. 4th ACM Symp. on Principles of Distributed Computing, Aug. 1985, 175\u2013185.","DOI":"10.1145\/323596.323612"},{"key":"29_CR12","unstructured":"R.G. Gallager, \"Finding a leader in a network with O(e)+O(n log n) messages\", MIT, 1979."},{"key":"29_CR13","doi-asserted-by":"crossref","unstructured":"A. Itai, M. Rodeh, \"Symmetry breaking in distributive networks\", Proc. 22nd IEEE Symp. on Foundations of Computer Science, Oct. 1981, 150\u2013158.","DOI":"10.1109\/SFCS.1981.41"},{"key":"29_CR14","doi-asserted-by":"crossref","unstructured":"E. Korach, S. Moran, S. Zaks, \"Tight lower and upper bounds for some distributed algorithms for a complete network of processors\", Proc. 3rd ACM Symp. Princ. Distr. Comput., 1984, 199\u2013207.","DOI":"10.1145\/800222.806747"},{"key":"29_CR15","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1080\/00207168408803429","volume":"16","author":"E. Korach","year":"1984","unstructured":"E. Korach, D. Rotem, N. Santoro, \"Distributed election in a circle without a global sense of orientation\", Int. J. Comput. Math. 16, 1984, 115\u2013124.","journal-title":"Int. J. Comput. Math."},{"key":"29_CR16","doi-asserted-by":"crossref","unstructured":"M.C. Loui, T.A. Matsushita, D.B. West, \"Election in a complete network with a sense of direction\", Information Processing Letters, 1986.","DOI":"10.1016\/0020-0190(86)90025-6"},{"key":"29_CR17","doi-asserted-by":"crossref","unstructured":"A. Marchetti-Spaccamela, \"New protocols for the election of a leader in a ring\", Proc. 5th Conf. on Foundations of Software Technology and Theoretical Computer Science, Dec. 1985.","DOI":"10.1007\/3-540-16042-6_5"},{"key":"29_CR18","unstructured":"M. Overmars, N. Santoro, \"Bit vs time tradeoffs for elections in synchronous rings\", CS-TR-97, Carleton University, June 1986."},{"key":"29_CR19","doi-asserted-by":"crossref","first-page":"380","DOI":"10.1145\/1634.1889","volume":"31","author":"J. Pachl","year":"1984","unstructured":"J. Pachl, D. Rotem, E. Korach, \"Lower bounds for distributed maximum finding algorithms\", J. ACM 31, 1984, 380\u2013401.","journal-title":"J. ACM"},{"key":"29_CR20","doi-asserted-by":"crossref","first-page":"758","DOI":"10.1145\/69622.357194","volume":"4","author":"G. L. Peterson","year":"1982","unstructured":"G.L. Peterson, \"An O(n log n) unidirectional algorithm for the circular extrema problem\", ACM Trans. Prog. Lang. Syst. 4, 1982, 758\u2013762","journal-title":"ACM Trans. Prog. Lang. Syst."},{"key":"29_CR21","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1007\/BF00979869","volume":"13","author":"N. Santoro","year":"1984","unstructured":"N. Santoro, \"On the message complexity of distributed problems\", Int. J. Comput. Inf. Sci. 13, 1984, 131\u2013147.","journal-title":"Int. J. Comput. Inf. Sci."},{"key":"29_CR22","unstructured":"N. Santoro, D. Rotem, \"On the complexity of distributed elections in synchronous graphs\", Proc. 11th Int. Workshop on Graphtheoretic Concepts in Computer Science, June 1985, 337\u2013346."},{"key":"29_CR23","doi-asserted-by":"crossref","unstructured":"P. Vitanyi, \"Distributed elections in an Archimedean ring of processors\", Proc. 16th ACM Symp. Theory of Computing, April 1984, 542\u2013547.","DOI":"10.1145\/800057.808725"}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-18088-5_29.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,6,20]],"date-time":"2023-06-20T17:48:03Z","timestamp":1687283283000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-18088-5_29"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1987]]},"ISBN":["9783540180883","9783540477471"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/3-540-18088-5_29","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1987]]}}}