{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,29]],"date-time":"2022-03-29T13:50:25Z","timestamp":1648561825910},"reference-count":6,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1994,1,1]],"date-time":"1994-01-01T00:00:00Z","timestamp":757382400000},"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":[[1994,1]]},"DOI":"10.1016\/0020-0190(94)90028-0","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T23:37:30Z","timestamp":1027640250000},"page":"57-61","source":"Crossref","is-referenced-by-count":3,"title":["Real-time leader election"],"prefix":"10.1016","volume":"49","author":[{"given":"Gurdip","family":"Singh","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0020-0190(94)90028-0_BIB1","first-page":"186","article-title":"Time and message bounds for election in synchronous and asynchronous complete networks","author":"Afek","year":"1985","journal-title":"Proc. ACM Symp. on Principles of Distributed Computing"},{"key":"10.1016\/0020-0190(94)90028-0_BIB2","first-page":"166","article-title":"Agreeing on a leader in real-time","author":"Coan","year":"1990","journal-title":"Proc. IEEE of the Real-Time Systems Symp."},{"issue":"4","key":"10.1016\/0020-0190(94)90028-0_BIB3","doi-asserted-by":"crossref","DOI":"10.1007\/BF01784719","article-title":"Reaching agreement on processor-group membership in synchronous distributed systems","volume":"4","author":"Cristian","year":"1991","journal-title":"Distributed Comput."},{"issue":"1","key":"10.1016\/0020-0190(94)90028-0_BIB4","doi-asserted-by":"crossref","first-page":"48","DOI":"10.1109\/TC.1982.1675885","article-title":"Elections in a distributed computing system","volume":"31","author":"Garcia-Molina","year":"1982","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/0020-0190(94)90028-0_BIB5","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. ACM Symp. on Principles of Distributed Computing"},{"key":"10.1016\/0020-0190(94)90028-0_BIB6","first-page":"179","article-title":"Leader election in complete networks","author":"Singh","year":"1992","journal-title":"Proc. ACM Symp. on Principles of Distributed Computing"}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019094900280?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019094900280?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:29:17Z","timestamp":1555129757000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0020019094900280"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994,1]]},"references-count":6,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1994,1]]}},"alternative-id":["0020019094900280"],"URL":"https:\/\/doi.org\/10.1016\/0020-0190(94)90028-0","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1994,1]]}}}