{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,6]],"date-time":"2025-08-06T12:31:32Z","timestamp":1754483492897},"reference-count":23,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1991,2,1]],"date-time":"1991-02-01T00:00:00Z","timestamp":665366400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":8202,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Computer and System Sciences"],"published-print":{"date-parts":[[1991,2]]},"DOI":"10.1016\/0022-0000(91)90041-3","type":"journal-article","created":{"date-parts":[[2004,2,7]],"date-time":"2004-02-07T10:16:00Z","timestamp":1076148960000},"page":"97-118","source":"Crossref","is-referenced-by-count":4,"title":["Some lower bound results for decentralized extrema-finding in rings of processors"],"prefix":"10.1016","volume":"42","author":[{"given":"H.L.","family":"Bodlaender","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0022-0000(91)90041-3_BIB1","year":"1977"},{"key":"10.1016\/0022-0000(91)90041-3_BIB2","series-title":"Proceedings, 3rd Annu. Sympos. on Theoretical Aspects of Computer Science","first-page":"119","article-title":"New upperbounds for decentralized extrema-finding in a ring of processors","volume":"Vol. 210","author":"Bodlaender","year":"1986"},{"key":"10.1016\/0022-0000(91)90041-3_BIB3","first-page":"82","article-title":"New lower bounds for distributed leader finding in asynchronous rings of processors","volume":"Vol. 156","author":"Bodlaender","year":"1987"},{"key":"10.1016\/0022-0000(91)90041-3_BIB4","first-page":"287","article-title":"A better lower bound for distributed leader finding in bidirectional asynchronous rings of processors","volume":"27","author":"Bodlaender","year":"1988"},{"key":"10.1016\/0022-0000(91)90041-3_BIB5","doi-asserted-by":"crossref","unstructured":"H. L. Bodlaender, New lower bound techniques for distributed leader finding and other problems on rings of processors, Theoret. Comput. Sci., to appear.","DOI":"10.1016\/0304-3975(91)90193-6"},{"key":"10.1016\/0022-0000(91)90041-3_BIB6","article-title":"A Formal Model for Message Passing Systems","author":"Burns","year":"1980"},{"key":"10.1016\/0022-0000(91)90041-3_BIB7","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\/0022-0000(91)90041-3_BIB8","doi-asserted-by":"crossref","first-page":"245","DOI":"10.1016\/0196-6774(82)90023-2","article-title":"An O(n log n) unidirectional distributed algorithm for extrema-finding in a circle","volume":"3","author":"Dolev","year":"1982","journal-title":"J. Algorithms"},{"key":"10.1016\/0022-0000(91)90041-3_BIB9","series-title":"Proceedings, 28th Annu. Sympos. on Fundamentals of Comput. Sci.","first-page":"326","article-title":"Two lower bounds in asynchronous distributed computation","author":"Duris","year":"1987"},{"key":"10.1016\/0022-0000(91)90041-3_BIB10","doi-asserted-by":"crossref","first-page":"336","DOI":"10.1145\/358506.358517","article-title":"On an improved algorithm for decentralized extrema-finding in circular configurations of processors","volume":"25","author":"Franklin","year":"1982","journal-title":"Comm. ACM"},{"key":"10.1016\/0022-0000(91)90041-3_BIB11_1","series-title":"Proceedings, 16th ACM Sympos. Theory of Computing","first-page":"493","article-title":"The impact of synchronous communication on the problem of electing a leader in a ring","author":"Frederickson","year":"1984"},{"key":"10.1016\/0022-0000(91)90041-3_BIB11_2","doi-asserted-by":"crossref","first-page":"98","DOI":"10.1145\/7531.7919","article-title":"Electing leader in a Synchronous Ring","volume":"34","author":"Frederickson","year":"1987","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/0022-0000(91)90041-3_BIB12","doi-asserted-by":"crossref","first-page":"627","DOI":"10.1145\/359024.359029","article-title":"Decentralized extrema-finding in circular configurations of processors","volume":"23","author":"Hirschberg","year":"1980","journal-title":"Comm. ACM"},{"key":"10.1016\/0022-0000(91)90041-3_BIB13","article-title":"A probabilistic algorithm for decentralized extremafinding in a circular configuration of processors","author":"Korach","year":"1981"},{"key":"10.1016\/0022-0000(91)90041-3_BIB14","first-page":"167","article-title":"Average number of messages for distributed leader-finding in rings of processors","volume":"30","author":"Lavault","year":"1989"},{"key":"10.1016\/0022-0000(91)90041-3_BIB15","first-page":"155","article-title":"Distributed systems\u2014Towards a formal approach","volume":"Vol. 77","author":"Le Lann","year":"1977"},{"key":"10.1016\/0022-0000(91)90041-3_BIB16","series-title":"An algorithm for distributed leader finding in bidirectional rings without common sense of direction","author":"Moran","year":"1985"},{"key":"10.1016\/0022-0000(91)90041-3_BIB17_1","series-title":"Proceedings, 14th ACM Sympos. Theory of Computing","first-page":"378","article-title":"A technique for proving lower-bounds for distributed maximum-finding algorithms","author":"Pachl","year":"1982"},{"key":"10.1016\/0022-0000(91)90041-3_BIB17_2","doi-asserted-by":"crossref","first-page":"905","DOI":"10.1145\/1634.1889","article-title":"Lowerbounds for Distributed Maximum-Finding Algorithms","volume":"31","author":"Korach","year":"1984","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/0022-0000(91)90041-3_BIB18","doi-asserted-by":"crossref","first-page":"762","DOI":"10.1145\/69622.357194","article-title":"An O(n log n) unidirectional algorithm for the circular extrema problem","volume":"4","author":"Peterson","year":"1982","journal-title":"ACM Trans. Program. Lang. Syst."},{"key":"10.1016\/0022-0000(91)90041-3_BIB19","first-page":"401","article-title":"Decentralized extrema-finding in circular configurations of processor: An improved algorithm","volume":"34","author":"Santoro","year":"1982","journal-title":"Congr. Numer."},{"key":"10.1016\/0022-0000(91)90041-3_BIB20","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1007\/BF01782775","article-title":"An improved upperbound for distributed election in bidirectional rings of processors","volume":"2","author":"Van Leeuwen","year":"1987","journal-title":"Distr. Comput."},{"key":"10.1016\/0022-0000(91)90041-3_BIB21","series-title":"Proceedings, 16th ACM Sympos. Theory of Computing","first-page":"547","article-title":"Distributed elections in an archimedian ring of processors","author":"Vit\u00e1nyi","year":"1984"}],"container-title":["Journal of Computer and System Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0022000091900413?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0022000091900413?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,2,15]],"date-time":"2019-02-15T05:20:44Z","timestamp":1550208044000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0022000091900413"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991,2]]},"references-count":23,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1991,2]]}},"alternative-id":["0022000091900413"],"URL":"https:\/\/doi.org\/10.1016\/0022-0000(91)90041-3","relation":{},"ISSN":["0022-0000"],"issn-type":[{"value":"0022-0000","type":"print"}],"subject":[],"published":{"date-parts":[[1991,2]]}}}