{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,3]],"date-time":"2026-04-03T04:30:09Z","timestamp":1775190609157,"version":"3.50.1"},"reference-count":7,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1982,9,1]],"date-time":"1982-09-01T00:00:00Z","timestamp":399686400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Algorithms"],"published-print":{"date-parts":[[1982,9]]},"DOI":"10.1016\/0196-6774(82)90023-2","type":"journal-article","created":{"date-parts":[[2005,2,10]],"date-time":"2005-02-10T08:44:36Z","timestamp":1108025076000},"page":"245-260","source":"Crossref","is-referenced-by-count":146,"title":["An O(n log n) unidirectional distributed algorithm for extrema finding in a circle"],"prefix":"10.1016","volume":"3","author":[{"given":"Danny","family":"Dolev","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Maria","family":"Klawe","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michael","family":"Rodeh","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0196-6774(82)90023-2_BIB1","series-title":"A Formal Model for Message Passing Systems","author":"Burns","year":"1980"},{"key":"10.1016\/0196-6774(82)90023-2_BIB2","doi-asserted-by":"crossref","first-page":"281","DOI":"10.1145\/359104.359108","article-title":"An improved algorithm for decentralized extrema-finding in circular configurations of processes","volume":"22","author":"Chang","year":"1979","journal-title":"Comm. ACM"},{"key":"10.1016\/0196-6774(82)90023-2_BIB3","article-title":"A Distributed Algorithm for Minimum Spanning Tree","author":"Gallager","year":"1979","journal-title":"MIT, LIDS-P-906-A"},{"key":"10.1016\/0196-6774(82)90023-2_BIB4","doi-asserted-by":"crossref","DOI":"10.1145\/359024.359029","article-title":"Decentralized extrema-finding in circular configurations of processes","volume":"23","author":"Hirschberg","year":"1980","journal-title":"Comm. ACM"},{"key":"10.1016\/0196-6774(82)90023-2_BIB5","series-title":"The Lord of the Ring or Probabilistic Methods for Breaking Symmetry in Distributive Networks","author":"Itai","year":"1981"},{"key":"10.1016\/0196-6774(82)90023-2_BIB6","first-page":"155","article-title":"Distributed Systems\u2014Toward a Formal Approach","author":"LeLann","year":"1977"},{"key":"10.1016\/0196-6774(82)90023-2_BIB7","unstructured":"G. L. Peterson, An O(n log n) unidirectional algorithm for the circular extrema problem, to appear in Transactions on Programming Languages and Systems."}],"container-title":["Journal of Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0196677482900232?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0196677482900232?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,1,29]],"date-time":"2019-01-29T06:51:49Z","timestamp":1548744709000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0196677482900232"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1982,9]]},"references-count":7,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1982,9]]}},"alternative-id":["0196677482900232"],"URL":"https:\/\/doi.org\/10.1016\/0196-6774(82)90023-2","relation":{},"ISSN":["0196-6774"],"issn-type":[{"value":"0196-6774","type":"print"}],"subject":[],"published":{"date-parts":[[1982,9]]}}}