{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T13:20:44Z","timestamp":1725456044456},"publisher-location":"Berlin\/Heidelberg","reference-count":15,"publisher":"Springer-Verlag","isbn-type":[{"type":"print","value":"3540543430"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/bfb0028286","type":"book-chapter","created":{"date-parts":[[2005,11,22]],"date-time":"2005-11-22T00:52:14Z","timestamp":1132620734000},"page":"481-495","source":"Crossref","is-referenced-by-count":0,"title":["Probabilistic leader election on rings of known size"],"prefix":"10.1007","author":[{"given":"Karl","family":"Abrahamson","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andrew","family":"Adler","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lisa","family":"Higham","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"David","family":"Kirkpatrick","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"1","key":"43_CR1","doi-asserted-by":"crossref","first-page":"12","DOI":"10.1137\/0218002","volume":"18","author":"A. Karl","year":"1989","unstructured":"Karl Abrahamson, Andrew Adler, Rachel Gelbart, Lisa Higham, and David Kirkpatrick. The bit complexity of randomized leader election on a ring. SIAM Journal on Computing, 18(1):12\u201329, 1989.","journal-title":"SIAM Journal on Computing"},{"issue":"3","key":"43_CR2","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1007\/BF01784021","volume":"3","author":"A. Karl","year":"1989","unstructured":"Karl Abrahamson, Andrew Adler, Lisa Higham, and David Kirkpatrick. Randomized function evaluation on a ring. Distributed Computing, 3(3):107\u2013117, 1989.","journal-title":"Distributed Computing"},{"key":"43_CR3","unstructured":"Karl Abrahamson, Andrew Adler, Lisa Higham, and David Kirkpatrick. Optimal algorithms for probabilistic solitude detection on anonymous rings. Technical Report TR 90\u20133, University of British Columbia, 1990."},{"key":"43_CR4","unstructured":"Karl Abrahamson, Andrew Adler, Lisa Higham, and David Kirkpatrick. Tight lower bounds for probabilistic solitude verification on anonymous rings. Technical Report TR 90\u20134, University of British Columbia, 1990."},{"key":"43_CR5","doi-asserted-by":"crossref","unstructured":"Hagit Attiya and Mark Snir. Better computing on the anonymous ring. In Proc. Aegean Workshop on Computing, pages 329\u2013338, 1988.","DOI":"10.1007\/BFb0040400"},{"key":"43_CR6","unstructured":"Hans L. Bodlaender. Distributed Algorithms, Structure and Complexity. PhD thesis, University of Utrecht, 1986."},{"key":"43_CR7","series-title":"Technical Report","volume-title":"New lower bound techniques for distributed leader finding and other problems on rings of processors","author":"H. L. Bodlaender","year":"1988","unstructured":"Hans L. Bodlaender. New lower bound techniques for distributed leader finding and other problems on rings of processors. Technical Report RUU-CS-88-18, Rijksuniversiteit Utrecht, 1988."},{"key":"43_CR8","unstructured":"J. Burns. A formal model for message passing systems. Technical Report TR-91, Indiana University, 1980."},{"issue":"3","key":"43_CR9","doi-asserted-by":"crossref","first-page":"245","DOI":"10.1016\/0196-6774(82)90023-2","volume":"3","author":"D. Danny","year":"1982","unstructured":"Danny Dolev, Maria Klawe, and Michael Rodeh. An O(n log n) unidirectional distributed algorithm for extrema finding in a circle. J. Algorithms, 3(3):245\u2013260, 1982.","journal-title":"J. Algorithms"},{"key":"43_CR10","doi-asserted-by":"crossref","unstructured":"Pavol Duris and Zvi Galil. Two lower bounds in asynchronous distributed computation (preliminary version). In Proc. 28nd Annual Symp. on Foundations of Comput. Sci., pages 326\u2013330, 1987.","DOI":"10.1109\/SFCS.1987.60"},{"key":"43_CR11","volume-title":"Randomized Distributed Computing on Rings","author":"L. Higham","year":"1988","unstructured":"Lisa Higham. Randomized Distributed Computing on Rings. PhD thesis, University of British Columbia, Vancouver, Canada, 1988."},{"key":"43_CR12","doi-asserted-by":"crossref","unstructured":"Alon Itai and Michael Rodeh. Symmetry breaking in distributed networks. In Proc. 22nd Annual Symp. on Foundations of Comput. Sci., pages 150\u2013158, 1981.","DOI":"10.1109\/SFCS.1981.41"},{"key":"43_CR13","series-title":"Technical Report","volume-title":"A lower bound for prbabilistic distributed algorithms","author":"J. Pachl","year":"1985","unstructured":"Jan Pachl. A lower bound for prbabilistic distributed algorithms. Technical Report CS-85-25, University of Waterloo, Waterloo, Ontario, 1985."},{"issue":"4","key":"43_CR14","doi-asserted-by":"crossref","first-page":"905","DOI":"10.1145\/1634.1889","volume":"31","author":"J. Pachl","year":"1984","unstructured":"Jan Pachl, E. Korach, and D. Rotem. Lower bounds for distributed maximum finding. J. Assoc. Comput. Mach., 31(4):905\u2013918, 1984.","journal-title":"J. Assoc. Comput. Mach."},{"issue":"4","key":"43_CR15","doi-asserted-by":"crossref","first-page":"758","DOI":"10.1145\/69622.357194","volume":"4","author":"P. Gary","year":"1982","unstructured":"Gary Peterson. An O(n log n) algorithm for the circular extrema problem. ACM Trans. on Prog. Lang. and Systems, 4(4):758\u2013752, 1982.","journal-title":"ACM Trans. on Prog. Lang. and Systems"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Data Structures"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0028286.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,12,9]],"date-time":"2020-12-09T16:58:46Z","timestamp":1607533126000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0028286"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["3540543430"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/bfb0028286","relation":{},"subject":[]}}