{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T15:26:39Z","timestamp":1725549999213},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540240754"},{"type":"electronic","value":"9783540305552"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-30555-2_4","type":"book-chapter","created":{"date-parts":[[2010,3,12]],"date-time":"2010-03-12T13:35:49Z","timestamp":1268400949000},"page":"22-31","source":"Crossref","is-referenced-by-count":4,"title":["Fair Leader Election by Randomized Voting"],"prefix":"10.1007","author":[{"given":"Siddhartha","family":"Brahma","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sandeep","family":"Macharla","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sudebkumar Prasant","family":"Pal","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sudhir Kumar","family":"Singh","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"1","key":"4_CR1","doi-asserted-by":"publisher","first-page":"12","DOI":"10.1137\/0218002","volume":"18","author":"K. Abrahamson","year":"1989","unstructured":"Abrahamson, K., Adler, A., Gelbart, R., Higham, L., Kirkpatrick, D.: The bit complexity of randomized leader election on a ring. SIAM J. Comput.\u00a018(1), 12\u201329 (1989)","journal-title":"SIAM J. Comput."},{"key":"4_CR2","doi-asserted-by":"crossref","unstructured":"Angluin, D.: Local and global properties in networks of processors (extended abstract). In: Proceedings of the twelfth annual ACM symposium on Theory of computing, pp. 82\u201393 (1980)","DOI":"10.1145\/800141.804655"},{"issue":"5","key":"4_CR3","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1145\/359104.359108","volume":"22","author":"E. Chang","year":"1979","unstructured":"Chang, E., Roberts, R.: An improved algorithm for decentralized extrema-finding in circularly configurations of processes. Commun. ACM\u00a022(5), 281\u2013283 (1979)","journal-title":"Commun. ACM"},{"issue":"3","key":"4_CR4","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1016\/0196-6774(82)90023-2","volume":"3","author":"D. Dolev","year":"1982","unstructured":"Dolev, D., Klawe, M.M., Rodeh, M.: An O(n logn) unidirectional distributed algorithm for extrema finding in a circle. J. Algorithms\u00a03(3), 245\u2013260 (1982)","journal-title":"J. Algorithms"},{"issue":"5","key":"4_CR5","doi-asserted-by":"publisher","first-page":"336","DOI":"10.1145\/358506.358517","volume":"25","author":"R. Franklin","year":"1982","unstructured":"Franklin, R.: On an improved algorithm for decentralized extrema finding in circular configurations of processors. Commun. ACM\u00a025(5), 336\u2013337 (1982)","journal-title":"Commun. ACM"},{"key":"4_CR6","unstructured":"Higham, L.: Randomized Distributed Computing on Rings. Phd thesis, University of British Columbia (1988)"},{"key":"4_CR7","unstructured":"Higham, L.: Simple randomized leader election with extensions. Technical report, University of Calgary (1988)"},{"issue":"11","key":"4_CR8","doi-asserted-by":"publisher","first-page":"627","DOI":"10.1145\/359024.359029","volume":"23","author":"D.S. Hirschberg","year":"1980","unstructured":"Hirschberg, D.S., Sinclair, J.B.: Decentralized extrema-finding in circular configurations of processors. Commun. ACM\u00a023(11), 627\u2013628 (1980)","journal-title":"Commun. ACM"},{"issue":"1","key":"4_CR9","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., Rodeh, M.: Symmetry breaking in distributed networks. Information and Computation\u00a088(1), 60\u201387 (1990)","journal-title":"Information and Computation"},{"key":"4_CR10","unstructured":"Burns, J.E.: A formal model for message passing systems. Technical Report TR-91, Indiana University (1980)"},{"key":"4_CR11","first-page":"155","volume-title":"Proceedings of the IFIP Congress 77","author":"G. Lann Le","year":"1977","unstructured":"Le Lann, G.: Distributed systems-towards a formal approach. In: Proceedings of the IFIP Congress 77, pp. 155\u2013160. North-Holland, Amsterdam (1977)"},{"issue":"4","key":"4_CR12","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 logn) unidirectional distributed algorithm for the circular extrema problem. ACM Transactions on Programming Languages and Systems\u00a04(4), 758\u2013762 (1982)","journal-title":"ACM Transactions on Programming Languages and Systems"}],"container-title":["Lecture Notes in Computer Science","Distributed Computing and Internet Technology"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-30555-2_4.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,19]],"date-time":"2020-11-19T04:21:53Z","timestamp":1605759713000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-30555-2_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540240754","9783540305552"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-30555-2_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}