{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T13:15:11Z","timestamp":1725455711055},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540584490"},{"type":"electronic","value":"9783540487999"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1994]]},"DOI":"10.1007\/bfb0020442","type":"book-chapter","created":{"date-parts":[[2005,11,13]],"date-time":"2005-11-13T06:21:02Z","timestamp":1131862862000},"page":"311-325","source":"Crossref","is-referenced-by-count":0,"title":["Average and randomized complexity of distributed problems"],"prefix":"10.1007","author":[{"given":"Nechama","family":"Allenberg-Navony","sequence":"first","affiliation":[]},{"given":"Alon","family":"Itai","sequence":"additional","affiliation":[]},{"given":"Shlomo","family":"Moran","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,10]]},"reference":[{"key":"23_CR1","doi-asserted-by":"crossref","unstructured":"Abrahamson K.: On Achieving Consensus Using a Shared Memory. The ACM Symposium on Principles of Distributed Computing, Toronto 1988, 291\u2013302.","DOI":"10.1145\/62546.62594"},{"key":"23_CR2","doi-asserted-by":"crossref","unstructured":"Angluin D.: Local and global properties in networks of processes. 12th Annual ACM Symp. on Theory of Computing, Los Angeles, California, 82\u201393 (April 1980)","DOI":"10.1145\/800141.804655"},{"key":"23_CR3","doi-asserted-by":"crossref","unstructured":"Attia C., Snir M.: Better Computing on the Anonymous Ring. IBM RC 13657 (1988)","DOI":"10.1007\/BFb0040400"},{"key":"23_CR4","doi-asserted-by":"crossref","unstructured":"Attia C., Snir M., Warmuth M.: Computing on the Anonymous Ring. The 4th Annual ACM Symposium on Principles of Distributed Computing (1985) 196\u2013203","DOI":"10.1145\/323596.323614"},{"key":"23_CR5","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1016\/0304-3975(91)90193-6","volume":"81","author":"H.L. Bodlaender","year":"1991","unstructured":"Bodlaender H.L.: New Lower Bound Techniques for Distributed Leader Finding and Other Problems on Rings of Processors. Theoretical Computer Science, 81 (1991) 237\u2013256","journal-title":"Theoretical Computer Science"},{"key":"23_CR6","unstructured":"Burns J.E.: A Formal Model for Message Passing Systems. Technical Report TR-91, Indiana University, (Sept. 1980)"},{"key":"23_CR7","volume-title":"Uniform Dynamic Self-Stabilizing Leader Election","author":"S. Dolev","year":"1991","unstructured":"Dolev S., Israeli A., Moran S.: Uniform Dynamic Self-Stabilizing Leader Election. WDAG Delphi, Greece, (Oct. 1991)"},{"key":"23_CR8","unstructured":"Duris, P., Z. Galil: Two Lower Bounds in Asynchronous Distribute Computation. 28th FOCS (1987) 326\u2013330"},{"key":"23_CR9","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1016\/0196-6774(82)90023-2","volume":"3","author":"S. Dolev","year":"1982","unstructured":"Dolev, S., M. Klawe, M. Rodeh: An \u03a9(n log n) Unidirectional Distributed Algorithm for Extreme Finding in a Circle. J. Algorithms 3 (1982) 245\u2013260","journal-title":"J. Algorithms"},{"key":"23_CR10","doi-asserted-by":"publisher","first-page":"98","DOI":"10.1145\/7531.7919","volume":"34","author":"G.N. Fredrickson","year":"1987","unstructured":"Fredrickson, G.N., Lynch, N.A.: Electing a Leader in a Synchronous Ring, J. ACM, 34 (1987) 98\u2013115","journal-title":"J. ACM"},{"key":"23_CR11","unstructured":"Fich, F.E., F. Meyer auf der Heide, P. Ragde, A. Wigderson: One, Two, Three ... Infinity: Lower Bounds for Parallel Computation, 17 STOC, (1985) 48\u201358"},{"key":"23_CR12","unstructured":"Gill, J.: Computational Complexity of Probabilistic Turing Machines. 6th STOC (1974) 91\u201395. Revised Feb. 1977."},{"key":"23_CR13","doi-asserted-by":"publisher","first-page":"60","DOI":"10.1016\/0890-5401(90)90004-2","volume":"88","author":"A. Itai","year":"1990","unstructured":"Itai, A., M. Rodeh, Probabilistic Methods for Breaking Symmetry in Distributed Networks. Information and Computation, 88 (1990) 60\u201387","journal-title":"Information and Computation"},{"key":"23_CR14","unstructured":"Knuth, D., The Art of Computer Programming. Vol 3, Addison-Wesley (1973)"},{"key":"23_CR15","doi-asserted-by":"publisher","first-page":"84","DOI":"10.1145\/77606.77610","volume":"12","author":"E. Korach","year":"1990","unstructured":"Korach, E., S. Kutten, S. Moran: A Modular Technique for the Design of Efficient Distributed Leader Finding Algorithms. ASM Trans. on Programming Languages and Systems 12 (1990) 84\u2013101","journal-title":"ASM Trans. on Programming Languages and Systems"},{"key":"23_CR16","doi-asserted-by":"publisher","first-page":"905","DOI":"10.1145\/1634.1889","volume":"31","author":"J. Pachl","year":"1984","unstructured":"Pachl, J., E. Korach, D. Rotem: Lower Bounds for Distributed Maximum-finding Algorithms. J. ACM 31 (1984) 905\u2013918","journal-title":"J. ACM"},{"key":"23_CR17","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1016\/0196-6774(87)90027-7","volume":"8","author":"J. Pachl","year":"1987","unstructured":"Pachl, J., A Lower Bound for Probabilistic Distributed Algorithms. J. Alg. 8 (1987) 53\u201365","journal-title":"J. Alg."},{"key":"23_CR18","doi-asserted-by":"publisher","first-page":"758","DOI":"10.1145\/69622.357194","volume":"4","author":"G. L. Peterson","year":"1982","unstructured":"Peterson, G. L., An O(n log n) Unidirectional Algorithm for the Circular Extrema Problem. ACM Trans. on Prog. Languages and Systems 4 (1982) 758\u2013762","journal-title":"ACM Trans. on Prog. Languages and Systems"},{"key":"23_CR19","unstructured":"Rabin, M., \u201cProbabilistic Algorithms\u201d, in Algorithms and Complexity. J. Traub (ed.) Academic Press (1976) 21\u201340"},{"key":"23_CR20","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1007\/BF01448847","volume":"100","author":"Neumann","year":"1974","unstructured":"Von Neumann, Zur Theorie der Gesellsschaftsspiele, Math. Annalen 100 (1974) 295\u2013320","journal-title":"Math. Annalen"},{"key":"23_CR21","unstructured":"Yao, A.C.: Probabilistic Computations: Towards a Unified Measure of Complexity. 18th FOCS (1977) 222\u2013227"}],"container-title":["Lecture Notes in Computer Science","Distributed Algorithms"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0020442","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,10]],"date-time":"2020-04-10T20:46:09Z","timestamp":1586551569000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0020442"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994]]},"ISBN":["9783540584490","9783540487999"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/bfb0020442","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1994]]}}}