{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:34:49Z","timestamp":1759638889611},"reference-count":13,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1989,4,1]],"date-time":"1989-04-01T00:00:00Z","timestamp":607392000000},"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":8873,"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":[[1989,4]]},"DOI":"10.1016\/0304-3975(89)90103-5","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:48:55Z","timestamp":1027655335000},"page":"125-132","source":"Crossref","is-referenced-by-count":30,"title":["Optimal lower bounds for some distributed algorithms for a complete network of processors"],"prefix":"10.1016","volume":"64","author":[{"given":"E.","family":"Korach","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"S.","family":"Moran","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"S.","family":"Zaks","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(89)90103-5_BIB1","first-page":"689","article-title":"Simple and efficient distributed algorithms for election in complete networks","author":"Afek","year":"1984","journal-title":"Proc. 22nd Ann. Allerton Conf. on Communication, Control, and Computing"},{"key":"10.1016\/0304-3975(89)90103-5_BIB2","first-page":"186","article-title":"Time and message bounds for election in synchronous and asynchronous complete networks","author":"Afek","year":"1985","journal-title":"Proc. 4th ACM Symp. on Principles of Distributed Computing"},{"issue":"1","key":"10.1016\/0304-3975(89)90103-5_BIB3","doi-asserted-by":"crossref","first-page":"98","DOI":"10.1145\/7531.7919","article-title":"Electing a leader in a synchronous ring","volume":"34","author":"Fredrickson","year":"1987","journal-title":"J. ACM"},{"issue":"1","key":"10.1016\/0304-3975(89)90103-5_BIB4","doi-asserted-by":"crossref","first-page":"66","DOI":"10.1145\/357195.357200","article-title":"A distributed algorithm for minimum spanning tree","volume":"5","author":"Gallager","year":"1983","journal-title":"ACM Trans. Progr. Languages and Systems"},{"key":"10.1016\/0304-3975(89)90103-5_BIB5","doi-asserted-by":"crossref","first-page":"1139","DOI":"10.1109\/CDC.1984.272191","article-title":"Selecting a leader in a clique in O(n log n) messages","author":"Humblet","year":"1984","journal-title":"Proc. 23rd Conf. on Decision and Control"},{"key":"10.1016\/0304-3975(89)90103-5_BIB6","first-page":"163","article-title":"A modular technique for the design of efficient distributed leader finding algorithms","author":"Korach","year":"1985","journal-title":"Proc. 4th ACM Symp. on Principles of Distributed Computing"},{"key":"10.1016\/0304-3975(89)90103-5_BIB7","series-title":"Tech. Rept. TR-464","article-title":"Algorithm for distributed spanning tree construction in dynamic networks","author":"Korach","year":"1987"},{"key":"10.1016\/0304-3975(89)90103-5_BIB8_1","first-page":"199","article-title":"Tight lower and upper bounds for some distributed algorithms for a complete network of processors","author":"Korach","year":"1984","journal-title":"Proc. 3rd ACM Symp. on Principles of Distributed Computing"},{"key":"10.1016\/0304-3975(89)90103-5_BIB8_2","series-title":"Tech. Rept. TR-272","year":"1983"},{"issue":"2","key":"10.1016\/0304-3975(89)90103-5_BIB9","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1137\/0216019","article-title":"The optimality of distributive constructions of minimum weight and degree restricted spanning trees in a complete network of processors","volume":"16","author":"Korach","year":"1987","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0304-3975(89)90103-5_BIB10","first-page":"155","article-title":"Distributed systems\u2014towards a formal approach","volume":"77","author":"LeLann","year":"1977"},{"key":"10.1016\/0304-3975(89)90103-5_BIB11","series-title":"Tech. Rept. TR 140","article-title":"Efficient algorithms for elections in meshes and complete networks","author":"Peterson","year":"1985"},{"issue":"3","key":"10.1016\/0304-3975(89)90103-5_BIB12","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":"Int. J. Comput. Inform. Sci."}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397589901035?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397589901035?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T03:55:27Z","timestamp":1555127727000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0304397589901035"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1989,4]]},"references-count":13,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1989,4]]}},"alternative-id":["0304397589901035"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(89)90103-5","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1989,4]]}}}