{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,10,18]],"date-time":"2023-10-18T02:02:36Z","timestamp":1697594556615},"reference-count":23,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1991,4,1]],"date-time":"1991-04-01T00:00:00Z","timestamp":670464000000},"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":8143,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[1991,4]]},"DOI":"10.1016\/0304-3975(91)90193-6","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T23:47:37Z","timestamp":1027640857000},"page":"237-256","source":"Crossref","is-referenced-by-count":17,"title":["New lower bound techniques for distributed leader finding and other problems on rings of processors"],"prefix":"10.1016","volume":"81","author":[{"given":"Han L.","family":"Bodlaender","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(91)90193-6_BIB1","doi-asserted-by":"crossref","first-page":"12","DOI":"10.1137\/0218002","article-title":"The bit complexity of probabilistic leader election on a unidirectional ring","volume":"18","author":"Abrahamson","year":"1989","journal-title":"Siam J. Comput."},{"key":"10.1016\/0304-3975(91)90193-6_BIB2","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1007\/BF01784021","article-title":"Ramdomized function evaluation on a ring","volume":"3","author":"Abrahamson","year":"1989","journal-title":"Distributed Computing"},{"key":"10.1016\/0304-3975(91)90193-6_BIB3","doi-asserted-by":"crossref","first-page":"845","DOI":"10.1145\/48014.48247","article-title":"Computing on an anonymous ring","volume":"35","author":"Attiya","year":"1988","journal-title":"J. ACM"},{"key":"10.1016\/0304-3975(91)90193-6_BIB4","series-title":"Proc. 3rd Aegan Workshop on Computing","first-page":"329","article-title":"Better computing on the anonymous ring, ext. abstract","author":"Attiya","year":"1988"},{"key":"10.1016\/0304-3975(91)90193-6_BIB5","series-title":"Ph.D. Thesis","article-title":"Distributed computing: structure and complexity","volume":"43","author":"Bodlaender","year":"1987"},{"key":"10.1016\/0304-3975(91)90193-6_BIB6","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1016\/0020-0190(88)90215-3","article-title":"A beter lower bound for distributed leader finding in bidirectional asynchronous rings of processors","volume":"27","author":"Bodlaender","year":"1988","journal-title":"Inform. Process Lett"},{"key":"10.1016\/0304-3975(91)90193-6_BIB7","series-title":"Proc. 3rd Ann. Sym. on Theoretical Aspects of Computer Science","first-page":"119","article-title":"New upperbounds for decentralized extrema finding in a ring of processors","volume":"210","author":"Bodlaender","year":"1986"},{"key":"10.1016\/0304-3975(91)90193-6_BIB8","series-title":"Proc. 17e Jahrestagung GI","first-page":"82","article-title":"New lower bounds for distributed leader finding in asynchronous rings of processors","volume":"156","author":"Bodlaender","year":"1987"},{"key":"10.1016\/0304-3975(91)90193-6_BIB9","series-title":"Tech. Rep. RUU-CS-88-33","article-title":"The distributed bit complexity of the ring: from the anonymous to the non-anonymous case","author":"Bodlaender","year":"1988"},{"key":"10.1016\/0304-3975(91)90193-6_BIB10","series-title":"Extremal Graph Theory","author":"Bollob\u00e1s","year":"1978"},{"key":"10.1016\/0304-3975(91)90193-6_BIB11","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\/0304-3975(91)90193-6_BIB12","doi-asserted-by":"crossref","first-page":"245","DOI":"10.1016\/0196-6774(82)90023-2","article-title":"An O(n log n) underitional distributed algorithm for extrema finding in a circle","volume":"3","author":"Dolev","year":"1982","journal-title":"J. Algorithms"},{"key":"10.1016\/0304-3975(91)90193-6_BIB13","doi-asserted-by":"crossref","first-page":"326","DOI":"10.1109\/SFCS.1987.60","article-title":"Two lowerbounds in asynchronous distributed computation","author":"Duris","year":"1987","journal-title":"Proc. 28th Ann. IEEE Sym. on Foundations of Computer Science"},{"key":"10.1016\/0304-3975(91)90193-6_BIB14","author":"Flajolet","year":"1986","journal-title":"Personal communication"},{"key":"10.1016\/0304-3975(91)90193-6_BIB15","doi-asserted-by":"crossref","first-page":"95","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\/0304-3975(91)90193-6_BIB16","series-title":"Res. Rep. CS-81-19","article-title":"A probabilistic algorithm for decentralized extrema-finding in a circular configuration of processors","author":"Korach","year":"1981"},{"key":"10.1016\/0304-3975(91)90193-6_BIB17","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1016\/0020-0190(89)90208-1","article-title":"Average number of messages for distributed leader finding in rings of processors","volume":"30","author":"Lavault","year":"1989","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0304-3975(91)90193-6_BIB18","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":"Distributed Computing"},{"key":"10.1016\/0304-3975(91)90193-6_BIB19","series-title":"Tech. Rep.","article-title":"An algorithm for distributed leader finding in bidirectional rings without common sense of direction","author":"Moran","year":"1985"},{"key":"10.1016\/0304-3975(91)90193-6_BIB20","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1145\/10590.10602","article-title":"Gap theorems for distributed computation","author":"Moran","year":"1986","journal-title":"Proc. 5th Ann. ACM Symp. on Principles of Distributed Computing"},{"key":"10.1016\/0304-3975(91)90193-6_BIB21","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1016\/0196-6774(87)90027-7","article-title":"A lower for probabilistic distributed algorithms","volume":"8","author":"Pachl","year":"1987","journal-title":"J. Algorithms"},{"key":"10.1016\/0304-3975(91)90193-6_BIB22","doi-asserted-by":"crossref","first-page":"905","DOI":"10.1145\/1634.1889","article-title":"Lowerbounds for distributed maximum-finding algorithms","volume":"31","author":"Pachl","year":"1984","journal-title":"J. ACM"},{"key":"10.1016\/0304-3975(91)90193-6_BIB23","doi-asserted-by":"crossref","first-page":"758","DOI":"10.1145\/69622.357194","article-title":"it An O(n log n) unidirictional algorithm for the circular extrema problem","volume":"4","author":"Peterson","year":"1982","journal-title":"ACM Trans. Prog. Lang. Systems"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397591901936?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397591901936?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,2,5]],"date-time":"2020-02-05T06:26:34Z","timestamp":1580883994000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0304397591901936"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991,4]]},"references-count":23,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1991,4]]}},"alternative-id":["0304397591901936"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(91)90193-6","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1991,4]]}}}