{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T22:56:25Z","timestamp":1725663385169},"publisher-location":"Berlin, Heidelberg","reference-count":9,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540516873"},{"type":"electronic","value":"9783540467502"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1989]]},"DOI":"10.1007\/3-540-51687-5_41","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T21:12:45Z","timestamp":1330204365000},"page":"171-182","source":"Crossref","is-referenced-by-count":11,"title":["Optimal fault-tolerant distributed algorithms for election in complete networks with a global sense of direction"],"prefix":"10.1007","author":[{"given":"Toshimitsu","family":"Masuzawa","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Naoki","family":"Nishikawa","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ken'ichi","family":"Hagihara","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nobuki","family":"Tokura","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,2]]},"reference":[{"key":"15_CR1","doi-asserted-by":"crossref","unstructured":"Y.Afek and E.Gafni, \u201cTime and message bound for election in synchronous and asynchronous complete networks\u201d, Proc. 4th PODC, Minacki, Canada, pp. 186\u2013195 (Aug. 1985).","DOI":"10.1145\/323596.323613"},{"key":"15_CR2","doi-asserted-by":"crossref","unstructured":"R.Bar-Yehuda, S.Kutten, Y.Wolfstahl and S.Zaks, \u201cMaking distributed spanning tree algorithms fault-resilient\u201d, Proc. 4th Ann. Sympo. on Theoretical Aspects of Computer Science, LNCS 247, pp.432\u2013444 (Feb. 1987).","DOI":"10.1007\/BFb0039625"},{"issue":"2","key":"15_CR3","doi-asserted-by":"publisher","first-page":"374","DOI":"10.1145\/3149.214121","volume":"32","author":"M.J. Fischer","year":"1985","unstructured":"M.J. Fischer, N.A. Lynch and M.S. Paterson, \u201cImpossibility of distributed consensus with one faulty process\u201d, JACM, Vol.32, No.2, pp.374\u2013382 (Apr. 1985).","journal-title":"JACM"},{"key":"15_CR4","doi-asserted-by":"crossref","unstructured":"E. Korach, S.Moran and S.Zaks, \u201cTight lower and upper bounds for some distributed algorithms for a complete network of processors\u201d, Proc. 3rd PODC, Vancouver, Canada, pp.199\u2013207 (Aug. 1984).","DOI":"10.1145\/800222.806747"},{"key":"15_CR5","series-title":"Tech. Rep.","volume-title":"Optimal distributed t-resilient election in complete networks","author":"S. Kutten","year":"1986","unstructured":"S. Kutten, Y. Wolfstahl and S. Zaks, \u201cOptimal distributed t-resilient election in complete networks\u201d, Tech. Rep. #430, Computer Science Department, Technion, Israel (Aug. 1986)."},{"key":"15_CR6","series-title":"Tech. Rep.","volume-title":"Optimal distributed t-resilient election in complete networks","author":"S. Kutten","year":"1986","unstructured":"S. Kutten, \u201cOptimal fault-tolerant distributed construction of a spanning tree\u201d, (the final version of [5]). \u201c"},{"issue":"4","key":"15_CR7","doi-asserted-by":"crossref","first-page":"185","DOI":"10.1016\/0020-0190(86)90025-6","volume":"22","author":"M.C. Loui","year":"1986","unstructured":"M.C. Loui, T.A. Matsushita and D.B. West, \u201cElection in complete networks with a sense of direction\u201d, Information Processing Letters, vol.22, No.4, pp.185\u2013187 (Apr. 1986).","journal-title":"Information Processing Letters"},{"key":"15_CR8","unstructured":"T.Masuzawa, N.Nishikawa, K.Hagihara, N.Tokura and K.Fujita, \u201cLeader election problem on faulty complete networks with global sense of direction\u201d (in Japanese), Tech. Rep. IECEJ,COMP88-98 (Mar. 1989)."},{"key":"15_CR9","doi-asserted-by":"crossref","first-page":"50","DOI":"10.1145\/1008959.1008961","volume":"16","author":"N. Santoro","year":"1984","unstructured":"N. Santoro, \u201cSense of direction, topological awareness and communication complexity\u201d, ACM SIGACT NEWS, vol.16, pp.50\u201356 (Summer 1984).","journal-title":"ACM SIGACT NEWS"}],"container-title":["Lecture Notes in Computer Science","Distributed Algorithms"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-51687-5_41.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T21:22:31Z","timestamp":1605648151000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-51687-5_41"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1989]]},"ISBN":["9783540516873","9783540467502"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/3-540-51687-5_41","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1989]]}}}