{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,12,29]],"date-time":"2022-12-29T21:26:18Z","timestamp":1672349178616},"reference-count":13,"publisher":"Elsevier BV","issue":"6","license":[{"start":{"date-parts":[[1988,5,1]],"date-time":"1988-05-01T00:00:00Z","timestamp":578448000000},"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":["Information Processing Letters"],"published-print":{"date-parts":[[1988,5]]},"DOI":"10.1016\/0020-0190(88)90215-3","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T00:11:21Z","timestamp":1027642281000},"page":"287-290","source":"Crossref","is-referenced-by-count":7,"title":["A better lower bound for distributed leader finding in bidirectional asynchronous rings of processors"],"prefix":"10.1016","volume":"27","author":[{"given":"Hans L.","family":"Bodlaender","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0020-0190(88)90215-3_BIB1","series-title":"Ph.D. Thesis","article-title":"Distributed Computing, Structure and Complexity","author":"Bodlaender","year":"1986"},{"key":"10.1016\/0020-0190(88)90215-3_BIB2","series-title":"Tech. Rept. RUU-CS-87-11","article-title":"A New Lower Bound Technique for Distributed Extrema Finding on Rings of Professors","author":"Bodlaender","year":"1987"},{"key":"10.1016\/0020-0190(88)90215-3_BIB3","series-title":"Tech. Rept. 91","article-title":"A Formal Model for Message Passing Systems","author":"Burns","year":"1980"},{"key":"10.1016\/0020-0190(88)90215-3_BIB4","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 process","volume":"22","author":"Chang","year":"1979","journal-title":"Comm. ACM"},{"key":"10.1016\/0020-0190(88)90215-3_BIB5","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\/0020-0190(88)90215-3_BIB6","first-page":"326","article-title":"Two lower bounds in asynchronous distributed computation","author":"Duris","year":"1987","journal-title":"Proc. FOCS '87"},{"key":"10.1016\/0020-0190(88)90215-3_BIB7","author":"Flayolet","year":"1986","journal-title":"Personal communication"},{"key":"10.1016\/0020-0190(88)90215-3_BIB8","doi-asserted-by":"crossref","first-page":"98","DOI":"10.1145\/7531.7919","article-title":"Electing a leader in a synchronous ring","volume":"34","author":"Frederickson","year":"1987","journal-title":"J. ACM"},{"key":"10.1016\/0020-0190(88)90215-3_BIB9","series-title":"Tech. Rept.","article-title":"An Algorithm for Distributed Leader Finding in Bidirectional Rings Without Common Sense of Direction","author":"Moran","year":"1985"},{"key":"10.1016\/0020-0190(88)90215-3_BIB10","doi-asserted-by":"crossref","first-page":"905","DOI":"10.1145\/1634.1889","article-title":"Lower bounds for distributed maximum-finding algorithms","volume":"31","author":"Pachl","year":"1984","journal-title":"J. ACM"},{"key":"10.1016\/0020-0190(88)90215-3_BIB11","doi-asserted-by":"crossref","first-page":"758","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. Programm. Lang. & Systems"},{"key":"10.1016\/0020-0190(88)90215-3_BIB12","doi-asserted-by":"crossref","first-page":"575","DOI":"10.1016\/0743-7315(87)90031-1","article-title":"Analysis of a distributed algorithm for extrema finding in a ring","volume":"4","author":"Rotem","year":"1987","journal-title":"J. Parall. Distrib. Comput."},{"key":"10.1016\/0020-0190(88)90215-3_BIB13","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1007\/BF01782775","article-title":"An improved upperbound for decentralized extrema-finding in bidirectional rings of processors","volume":"2","author":"Van Leeuwen","year":"1987","journal-title":"Distrib. Comput."}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019088902153?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019088902153?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,12]],"date-time":"2019-04-12T13:21:03Z","timestamp":1555075263000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0020019088902153"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1988,5]]},"references-count":13,"journal-issue":{"issue":"6","published-print":{"date-parts":[[1988,5]]}},"alternative-id":["0020019088902153"],"URL":"https:\/\/doi.org\/10.1016\/0020-0190(88)90215-3","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1988,5]]}}}