{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,19]],"date-time":"2025-03-19T16:10:36Z","timestamp":1742400636469},"reference-count":6,"publisher":"Elsevier BV","issue":"4","license":[{"start":{"date-parts":[[1986,4,1]],"date-time":"1986-04-01T00:00:00Z","timestamp":512697600000},"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":[[1986,4]]},"DOI":"10.1016\/0020-0190(86)90025-6","type":"journal-article","created":{"date-parts":[[2003,3,14]],"date-time":"2003-03-14T19:37:33Z","timestamp":1047670653000},"page":"185-187","source":"Crossref","is-referenced-by-count":43,"title":["Election in a complete network with a sense of direction"],"prefix":"10.1016","volume":"22","author":[{"given":"Michael C.","family":"Loui","sequence":"first","affiliation":[]},{"given":"Teresa A.","family":"Matsushita","sequence":"additional","affiliation":[]},{"given":"Douglas B.","family":"West","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0020-0190(86)90025-6_BIB1","series-title":"Proc. 22nd Ann. Allerton Conf. on Communication","first-page":"689","article-title":"Simple and efficient distributed algorithms for election in complete networks","author":"Afek","year":"1984"},{"key":"10.1016\/0020-0190(86)90025-6_BIB2","series-title":"Proc. 3rd Ann. ACM Symp. on Principles of Distributed Computing","first-page":"199","article-title":"Tight lower and upper bounds for some distributed algorithms for a complete network of processors","author":"Korach","year":"1984"},{"key":"10.1016\/0020-0190(86)90025-6_BIB3","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. Programming Language Systems"},{"key":"10.1016\/0020-0190(86)90025-6_BIB4","article-title":"Efficient algorithms for elections in meshes and complete networks","author":"Peterson","year":"1984"},{"key":"10.1016\/0020-0190(86)90025-6_BIB5","article-title":"O(n) election algorithms in complete graphs with sense of direction","author":"Sack","year":"1984"},{"issue":"2","key":"10.1016\/0020-0190(86)90025-6_BIB6","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"}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019086900256?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019086900256?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,26]],"date-time":"2019-03-26T09:29:20Z","timestamp":1553592560000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0020019086900256"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1986,4]]},"references-count":6,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1986,4]]}},"alternative-id":["0020019086900256"],"URL":"https:\/\/doi.org\/10.1016\/0020-0190(86)90025-6","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1986,4]]}}}