{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,3,12]],"date-time":"2024-03-12T18:40:54Z","timestamp":1710268854330},"reference-count":13,"publisher":"Springer Science and Business Media LLC","issue":"1-4","license":[{"start":{"date-parts":[[1989,6,1]],"date-time":"1989-06-01T00:00:00Z","timestamp":612662400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Algorithmica"],"published-print":{"date-parts":[[1989,6]]},"DOI":"10.1007\/bf01553900","type":"journal-article","created":{"date-parts":[[2005,4,20]],"date-time":"2005-04-20T22:07:35Z","timestamp":1114034855000},"page":"437-446","source":"Crossref","is-referenced-by-count":28,"title":["Efficient elections in chordal ring networks"],"prefix":"10.1007","volume":"4","author":[{"given":"Hagit","family":"Attiya","sequence":"first","affiliation":[]},{"given":"Jan","family":"van Leeuwen","sequence":"additional","affiliation":[]},{"given":"Nicola","family":"Santoro","sequence":"additional","affiliation":[]},{"given":"Shmuel","family":"Zaks","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"BF01553900_CR1","doi-asserted-by":"crossref","first-page":"291","DOI":"10.1109\/TC.1981.1675777","volume":"30","author":"B. Arden","year":"1981","unstructured":"B. Arden and H. Lee, Analysis of Chordal Ring Network,IEEE Transactions on Computers, Vol. 30, 1981, pp. 291\u2013294.","journal-title":"IEEE Transactions on Computers"},{"key":"BF01553900_CR2","unstructured":"J. Burns, A Formal Model for Message-Passing Systems, Technical Report 91, Indiana University, 1980."},{"issue":"No. 3","key":"BF01553900_CR3","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, AnO(n logn) Unidirectional Distributed Algorithm for Extrema-Finding in a Circle,Journal of Algorithms, Vol. 3, No. 3, 1982, pp. 245\u2013260.","journal-title":"Journal of Algorithms"},{"issue":"No. 5","key":"BF01553900_CR4","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,Communications of the ACM, Vol. 25, No. 5, 1982, pp. 336\u2013337.","journal-title":"Communications of the ACM"},{"issue":"No. 1","key":"BF01553900_CR5","doi-asserted-by":"crossref","first-page":"98","DOI":"10.1145\/7531.7919","volume":"34","author":"G. N. Frederickson","year":"1987","unstructured":"G. N. Frederickson and N. A. Lynch, Electing a Leader in a Synchronous Ring,Journal of the ACM, Vol. 34, No. 1, 1987, pp. 98\u2013115.","journal-title":"Journal of the ACM"},{"key":"BF01553900_CR6","doi-asserted-by":"crossref","unstructured":"E. Korach, S. Moran, and S. Zaks, Tight Lower and Upper Bounds for Some Distributed Algorithms for a Complete Network of Processors,Proceedings of the Third ACM Symposium on Principles of Distributed Computing, Vancouver, August 1984, pp. 199\u2013207; also to appear inTheoretical Computer Science.","DOI":"10.1145\/800222.806747"},{"key":"BF01553900_CR7","doi-asserted-by":"crossref","first-page":"185","DOI":"10.1016\/0020-0190(86)90025-6","volume":"22","author":"M. Loui","year":"1986","unstructured":"M. Loui, T. Matsushita, and D. West, Election in a Complete Network with a Sense of Direction,Information Processing Letters, Vol. 22, 1986, pp. 185\u2013187.","journal-title":"Information Processing Letters"},{"issue":"No. 4","key":"BF01553900_CR8","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 Extrema-Finding Algorithms,Journal of the ACM, Vol. 31, No. 4, 1984, pp. 905\u2013918.","journal-title":"Journal of the ACM"},{"issue":"No. 4","key":"BF01553900_CR9","doi-asserted-by":"crossref","first-page":"758","DOI":"10.1145\/69622.357194","volume":"4","author":"G. L. Peterson","year":"1982","unstructured":"G. L. Peterson, AnO(n logn) Unidirectional Algorithm for the Circular Extrema Problem,ACM Transactions on Programming Languages and Systems, Vol. 4, No. 4, 1982, pp. 758\u2013762.","journal-title":"ACM Transactions on Programming Languages and Systems"},{"key":"BF01553900_CR10","series-title":"Report SCS-TR-49","volume-title":"O(n) Election Algorithms in Complete Networks with Global Sense of Orientation","author":"J. Sack","year":"1984","unstructured":"J. Sack, N. Santoro, and J. Urrutia,O(n) Election Algorithms in Complete Networks with Global Sense of Orientation, Report SCS-TR-49, Carleton University, Ottawa, May 1984."},{"issue":"2","key":"BF01553900_CR11","doi-asserted-by":"crossref","first-page":"50","DOI":"10.1145\/1008959.1008961","volume":"16","author":"N. Santoro","year":"1984","unstructured":"N. Santoro, Sense of Direction, Topological Awareness and Communication Complexity,SIGACT News, 16:2, 1984, pp. 50\u201356.","journal-title":"SIGACT News"},{"key":"BF01553900_CR12","doi-asserted-by":"crossref","unstructured":"N. Santoro, J. Urrutia, and S. Zaks, Sense of Direction and Communication Complexity in Distributed Networks,Proceedings of the First International Workshop on Distributed Algorithms on Graphs, Ottawa, August 1985, pp. 123\u2013132.","DOI":"10.1515\/9780773573475-009"},{"key":"BF01553900_CR13","doi-asserted-by":"crossref","first-page":"392","DOI":"10.1145\/321832.321838","volume":"21","author":"C. K. Wong","year":"1974","unstructured":"C. K. Wong and D. Coppersmith, A Combinatorial Problem Related to Multimodule Memory Organization,Journal of the ACM, Vol. 21, 1974, pp. 392\u2013402.","journal-title":"Journal of the ACM"}],"container-title":["Algorithmica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01553900.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01553900\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01553900","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,1,25]],"date-time":"2024-01-25T03:38:08Z","timestamp":1706153888000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01553900"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1989,6]]},"references-count":13,"journal-issue":{"issue":"1-4","published-print":{"date-parts":[[1989,6]]}},"alternative-id":["BF01553900"],"URL":"https:\/\/doi.org\/10.1007\/bf01553900","relation":{},"ISSN":["0178-4617","1432-0541"],"issn-type":[{"value":"0178-4617","type":"print"},{"value":"1432-0541","type":"electronic"}],"subject":[],"published":{"date-parts":[[1989,6]]}}}