{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T13:09:45Z","timestamp":1725455385064},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540193661"},{"type":"electronic","value":"9783540392392"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1988]]},"DOI":"10.1007\/bfb0019815","type":"book-chapter","created":{"date-parts":[[2005,11,13]],"date-time":"2005-11-13T00:25:50Z","timestamp":1131841550000},"page":"345-354","source":"Crossref","is-referenced-by-count":1,"title":["Optimal resilient ring election algorithms"],"prefix":"10.1007","author":[{"given":"M. Y.","family":"Chan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"F. Y. L.","family":"Chin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,16]]},"reference":[{"key":"26_CR1","series-title":"Technical report","volume-title":"New upperbounds for decentralized extrema-finding in a ring of processors","author":"H.L. Bodlaender","year":"1985","unstructured":"H.L. Bodlaender and J. van Leeuwen, New upperbounds for decentralized extrema-finding in a ring of processors, Technical report RUU-CS-85-15, Computer Science Department, Rijksuniversiteit Utrecht, Netherlands, 1985."},{"key":"26_CR2","series-title":"Technical report","volume-title":"A formal model for message passing systems","author":"J.E. Burns","year":"1980","unstructured":"J.E. Burns, A formal model for message passing systems, Technical report 91, Computer Science Department, Indiana University, Bloomington, Indiana, 1980."},{"key":"26_CR3","doi-asserted-by":"crossref","first-page":"281","DOI":"10.1145\/359104.359108","volume":"22","author":"E. Chang","year":"1979","unstructured":"E. Chang and R. Roberts, An improved algorithm for decentralized extrema-finding in circular configurations of processes, CACM 22 (1979) 281\u2013283.","journal-title":"CACM"},{"key":"26_CR4","doi-asserted-by":"publisher","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, Journal of Algorithms 3 (1982) 245\u2013260.","journal-title":"Journal of Algorithms"},{"unstructured":"R.E. Filman and D.P. Friedman, Coordinated computing: Tools and techniques for distributed software, McGraw-Hill 1984.","key":"26_CR5"},{"key":"26_CR6","doi-asserted-by":"crossref","first-page":"336","DOI":"10.1145\/358506.358517","volume":"25","author":"W.R. Franklin","year":"1982","unstructured":"W.R. Franklin, On an improved algorithm for decentralized extrema finding in circular configurations of processors, CACM 25 (1982) 336\u2013337.","journal-title":"CACM"},{"doi-asserted-by":"crossref","unstructured":"G.N. Frederickson and N.A. Lynch, The impact of synchronous communication On the problem of electing a leader in a ring, Proceedings of the 16th Annual ACM Symposium on Theory of Computing, Washington, D.C.(1984) 493\u2013503.","key":"26_CR7","DOI":"10.1145\/800057.808719"},{"doi-asserted-by":"crossref","unstructured":"O. Goldreich and L. Shrira, The effects of link failure on computations in asynchronous rings, Proceedings of the ACM Symposium on Principles of Distributed Computing, Calgary Alberta (August 1986) 174\u2013185.","key":"26_CR8","DOI":"10.1145\/10590.10605"},{"key":"26_CR9","doi-asserted-by":"crossref","first-page":"627","DOI":"10.1145\/359024.359029","volume":"23","author":"D.S. Hirshberg","year":"1980","unstructured":"D.S. Hirshberg and J.B. Sinclair, Decentralized extrema-finding in circular configurations of processors, CACM 23 (1980) 627\u2013628.","journal-title":"CACM"},{"doi-asserted-by":"crossref","unstructured":"A. Itai and M. Rodeh, Symmetry breaking in distributive networks, Proceedings 22nd IEEE Symposium on Foundations of Computer Science (October 1981) 150\u2013158.","key":"26_CR10","DOI":"10.1109\/SFCS.1981.41"},{"doi-asserted-by":"crossref","unstructured":"E. Korach, D. Rotem and N. Santoro, Distributed election in a circle without a global sense of orientation, International Journal of Computer Mathematics 14 (1984).","key":"26_CR11","DOI":"10.1080\/00207168408803429"},{"key":"26_CR12","first-page":"155","volume-title":"Distributed systems \u2014 Towards a formal approach","author":"G. LeLann","year":"1977","unstructured":"G. LeLann, Distributed systems \u2014 Towards a formal approach, Information Processing 77, Elsevier Science, New York (1977) 155\u2013160."},{"unstructured":"S. Moran, M. Shalom and S. Zaks, A. 1.44...nlogn algorithm for distributed leader finding in bidirectional rings of processors, Technical report #389, Computer Science Department, Technion, November 1985.","key":"26_CR13"},{"key":"26_CR14","doi-asserted-by":"publisher","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 algorithms, Journal of ACM 31(1984), 905\u2013918.","journal-title":"Journal of ACM"},{"key":"26_CR15","doi-asserted-by":"publisher","first-page":"758","DOI":"10.1145\/69622.357194","volume":"4","author":"G.L. Peterson","year":"1982","unstructured":"G.L. Peterson, An O(nlogn) unidirectional algorithm for the circular extrema problem, ACM Transactions on Programming Languages and Systems 4(1982) 758\u2013762.","journal-title":"ACM Transactions on Programming Languages and Systems"},{"unstructured":"D. Rotem, E. Korach and N. Santoro, Analysis of a distributed algorithm for extrema finding in a ring, Technical report SCS-TR-61, School of Computer Science, Carleton University, August 1984.","key":"26_CR16"},{"doi-asserted-by":"crossref","unstructured":"P.M.B. Vitanyi, Distributed election in an Archimedean ring of processors, Proceedings of the 16th Annual ACM Symposium on the Theory of Computing, Washington, D.C.(1984), 542\u2013547.","key":"26_CR17","DOI":"10.1145\/800057.808725"}],"container-title":["Lecture Notes in Computer Science","Distributed Algorithms"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0019815","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,4]],"date-time":"2019-02-04T05:53:25Z","timestamp":1549259605000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0019815"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1988]]},"ISBN":["9783540193661","9783540392392"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/bfb0019815","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1988]]}}}