{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:08:03Z","timestamp":1725664083963},"publisher-location":"Berlin, Heidelberg","reference-count":5,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540582182"},{"type":"electronic","value":"9783540485773"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1994]]},"DOI":"10.1007\/3-540-58218-5_19","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T10:37:16Z","timestamp":1330252636000},"page":"207-218","source":"Crossref","is-referenced-by-count":1,"title":["Asymptotically optimal election on weighted rings"],"prefix":"10.1007","author":[{"given":"Lisa","family":"Higham","sequence":"first","affiliation":[]},{"given":"Teresa","family":"Przytycka","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,5,30]]},"reference":[{"issue":"3","key":"19_CR1","doi-asserted-by":"crossref","first-page":"245","DOI":"10.1016\/0196-6774(82)90023-2","volume":"3","author":"D. Dolev","year":"1982","unstructured":"D. Dolev, M. Klawe, and M. 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":"19_CR2","unstructured":"L. Higham and T. Przytycka. A simple, efficient algorithm for maximum finding on rings. Technical Report 92\/494\/32, University of Calgary, 1992."},{"key":"19_CR3","doi-asserted-by":"crossref","unstructured":"L. Higham and T. Przytycka. A simple, efficient algorithm for maximum finding on rings. In Lecture Notes in Computer Science #725, pages 249\u2013263. Springer Verlag, 1993. Proc. 7th International Workshop on Distributed Algorithms.","DOI":"10.1007\/3-540-57271-6_40"},{"issue":"4","key":"19_CR4","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. Lower bounds for distributed maximum finding. J. Assoc. Comput. Mach., 31(4):905\u2013918, 1984.","journal-title":"J. Assoc. Comput. Mach."},{"issue":"4","key":"19_CR5","doi-asserted-by":"crossref","first-page":"758","DOI":"10.1145\/69622.357194","volume":"4","author":"G. Peterson","year":"1982","unstructured":"G. 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","Algorithm Theory \u2014 SWAT '94"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-58218-5_19.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T21:12:59Z","timestamp":1619557979000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-58218-5_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994]]},"ISBN":["9783540582182","9783540485773"],"references-count":5,"URL":"https:\/\/doi.org\/10.1007\/3-540-58218-5_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1994]]}}}