{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,31]],"date-time":"2022-03-31T15:42:38Z","timestamp":1648741358646},"reference-count":15,"publisher":"Elsevier BV","issue":"5","license":[{"start":{"date-parts":[[1991,6,1]],"date-time":"1991-06-01T00:00:00Z","timestamp":675734400000},"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":[[1991,6]]},"DOI":"10.1016\/0020-0190(91)90069-t","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T23:38:59Z","timestamp":1027640339000},"page":"265-270","source":"Crossref","is-referenced-by-count":14,"title":["Towards optimal distributed election on chordal rings"],"prefix":"10.1016","volume":"38","author":[{"given":"T.Z.","family":"Kalamboukis","sequence":"first","affiliation":[]},{"given":"S.L.","family":"Mantzaris","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0020-0190(91)90069-T_BIB1","doi-asserted-by":"crossref","first-page":"291","DOI":"10.1109\/TC.1981.1675777","article-title":"Analysis of chordal ring network","volume":"30","author":"Arden","year":"1981","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/0020-0190(91)90069-T_BIB2","doi-asserted-by":"crossref","first-page":"437","DOI":"10.1007\/BF01553900","article-title":"Efficient elections in chordal ring networks","volume":"5","author":"Attiya","year":"1989","journal-title":"Algorithmica"},{"key":"10.1016\/0020-0190(91)90069-T_BIB3","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(91)90069-T_BIB4","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\/0020-0190(91)90069-T_BIB5","series-title":"Internal Memorandum","article-title":"Finding a leader in a network with O(e)+O(n log n) messages","author":"Gallager","year":"1979"},{"key":"10.1016\/0020-0190(91)90069-T_BIB6","first-page":"823","article-title":"Election processes in distributed systems","author":"Hirschberg","year":"1980","journal-title":"Proc. 18th Allerton Conf. on Communication, Control and Computing"},{"key":"10.1016\/0020-0190(91)90069-T_BIB7","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1145\/800222.806747","article-title":"Tight lower and upper bounds for some distributed algorithms for a complete network of processors","author":"Korach","year":"1984","journal-title":"Proc. Third ACM Symp. on Principles of Distributed Computing"},{"key":"10.1016\/0020-0190(91)90069-T_BIB8","doi-asserted-by":"crossref","first-page":"185","DOI":"10.1016\/0020-0190(86)90025-6","article-title":"Election in a complete network with a sense of direction","volume":"22","author":"Loui","year":"1986","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0020-0190(91)90069-T_BIB9","series-title":"Tech. Rept. 389","article-title":"An 1.44n log n algorithm for distributed leader finding in bidirectional rings of processors","author":"Moran","year":"1985"},{"key":"10.1016\/0020-0190(91)90069-T_BIB10","doi-asserted-by":"crossref","first-page":"905","DOI":"10.1145\/1634.1889","article-title":"Lower bounds for distributed extrema-finding algorithms","volume":"31","author":"Pachl","year":"1984","journal-title":"J. ACM"},{"key":"10.1016\/0020-0190(91)90069-T_BIB11","doi-asserted-by":"crossref","first-page":"758","DOI":"10.1145\/69622.357194","article-title":"An O(n log n) unidirectional distributed algorithm for the circular extrema problem","volume":"4","author":"Peterson","year":"1982","journal-title":"ACM Trans. Programming Language Systems"},{"issue":"2","key":"10.1016\/0020-0190(91)90069-T_BIB12","doi-asserted-by":"crossref","first-page":"50","DOI":"10.1145\/1008959.1008961","article-title":"Sense of direction, topological awareness and communication complexity","volume":"16","author":"Santoro","year":"1984","journal-title":"SIGACT News"},{"key":"10.1016\/0020-0190(91)90069-T_BIB13","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1007\/BF00979869","article-title":"On the message complexity of distributed problems","volume":"13","author":"Santoro","year":"1984","journal-title":"Internat. J. Comput. Inform. Sci."},{"key":"10.1016\/0020-0190(91)90069-T_BIB14","first-page":"123","article-title":"Sense of direction and communication complexity in distributed networks","author":"Santoro","year":"1985","journal-title":"Proc. First Internat. Workshop on Distributed Algorithms on Graphs"},{"key":"10.1016\/0020-0190(91)90069-T_BIB15","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1007\/BF01782775","article-title":"An improved upperbound for decentralised extrema-finding in bidirectional rings of processors","volume":"2","author":"Van Leeuwen","year":"1987","journal-title":"Distributed Computing"}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:002001909190069T?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:002001909190069T?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T04:24:20Z","timestamp":1555129460000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/002001909190069T"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991,6]]},"references-count":15,"journal-issue":{"issue":"5","published-print":{"date-parts":[[1991,6]]}},"alternative-id":["002001909190069T"],"URL":"https:\/\/doi.org\/10.1016\/0020-0190(91)90069-t","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1991,6]]}}}