{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T13:09:51Z","timestamp":1725455391632},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540193661"},{"type":"electronic","value":"9783540392392"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1988]]},"DOI":"10.1007\/bfb0019816","type":"book-chapter","created":{"date-parts":[[2005,11,13]],"date-time":"2005-11-13T05:25:50Z","timestamp":1131859550000},"page":"355-373","source":"Crossref","is-referenced-by-count":0,"title":["Fault-tolerant distributed algorithm for election in complete networks"],"prefix":"10.1007","author":[{"given":"Hosame H.","family":"Abu-Amara","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,16]]},"reference":[{"key":"27_CR1","doi-asserted-by":"crossref","unstructured":"Y. Afek and E. Gafni, \"Time and Message Bounds for Election in Synchronous and Asynchronous Complete Networks,\" Proc. 4th ACM Sympos. Principles of Distributed Computing, Minacki, Ontario, pp. 186\u2013195, Aug. 1985.","DOI":"10.1145\/323596.323613"},{"key":"27_CR2","unstructured":"P. A. Alsberg and J. D. Day, \"A Principle for Resilient Sharing of Distributed Resources,\" Proc. 2nd Int. Conf. Software Eng., San Fransisco, pp. 562\u2013570, Oct. 1976."},{"key":"27_CR3","unstructured":"J. E. Burns, \"A Formal Model for Message Passing Systems,\" Technical Report TR-91, Indiana U., Bloomington, May 1980."},{"key":"27_CR4","doi-asserted-by":"crossref","unstructured":"I. A. Cimet and P. R. S. Kumar, \"A Resilient Distributed Protocol for Network Synchronization,\" ACM SIGCOMM Symp. Commun. Arch. and Protocols, Stowe, VT, pp. 358\u2013367, Aug. 1986.","DOI":"10.1145\/1013812.18212"},{"key":"27_CR5","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, \"Impossibility of Distributed Consensus with One Faulty Process,\" J. ACM, vol. 32, pp. 374\u2013382, April 1985.","journal-title":"J. ACM"},{"key":"27_CR6","doi-asserted-by":"crossref","unstructured":"E. Gafni, \"Improvements in the Complexity of Two Message-Optimal Election Algorithms,\" Proc. 4th ACM Sympos. Principles of Distributed Computing, Minacki, Ontario, pp. 175\u2013185, Aug. 1985.","DOI":"10.1145\/323596.323612"},{"key":"27_CR7","doi-asserted-by":"crossref","unstructured":"O. Goldreich and L. Shrira, \"The Effect of Link Failures on Computations in Asynchronous Rings,\" Proc. 5th ACM Sympos. Principles of Distributed Computing, Calgary, Alberta, pp. 174\u2013185, Aug. 1986.","DOI":"10.1145\/10590.10605"},{"key":"27_CR8","doi-asserted-by":"crossref","unstructured":"E. Korach, S. Moran, and S. Zaks, \"Tight Lower and Upper Bounds for Some Distributed Algorithms for a Complete Network of Processors,\" Proc. 3rd ACM Sympos. Principles of Distributed Computing, Vancouver, British Columbia, pp. 199\u2013207, Aug. 1984.","DOI":"10.1145\/800222.806747"},{"key":"27_CR9","doi-asserted-by":"crossref","unstructured":"R. Bar-Yehuda, S. Kutten, Y. Wolfstahl, and S. Zaks, \"Making Distributed Spanning Tree Algorithms Fault-Resilient,\" Proc. 4th Symposium on Theoretical Aspects of Computer Science, Passau, Germany, pp. 432\u2013444, Feb. 1987.","DOI":"10.1007\/BFb0039625"},{"key":"27_CR10","doi-asserted-by":"publisher","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, \"Election in Complete Networks with a Sense of Direction,\" Information Processing Letters, vol. 22, pp. 185\u2013187, April 1986.","journal-title":"Information Processing Letters"},{"key":"27_CR11","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1145\/320141.320143","volume":"5","author":"D. A. Menasce","year":"1980","unstructured":"D. A. Menasce, G. J. Popek, and R. R. Muntz, \"A Locking Protocol for Resource Coordination in Distributed Databases,\" ACM Trans. Database Systems, vol. 5, pp. 103\u2013138, June 1980.","journal-title":"ACM Trans. Database Systems"},{"key":"27_CR12","unstructured":"G. L. Peterson, \"Efficient Algorithms for Elections in Meshes and Complete Networks,\" Technical Report TR-140, U. Rochester, July 1985."},{"key":"27_CR13","doi-asserted-by":"publisher","first-page":"50","DOI":"10.1145\/1008959.1008961","volume":"16","author":"N. Santoro","year":"1984","unstructured":"N. Santoro, \"Sense of Direction, Topological Awareness, and Communication Complexity,\" ACM SIGACT NEWS, vol. 16, pp. 50\u201356, Summer 1984.","journal-title":"ACM SIGACT NEWS"},{"key":"27_CR14","doi-asserted-by":"publisher","first-page":"222","DOI":"10.1145\/357369.357371","volume":"1","author":"R. D. Schlichting","year":"1983","unstructured":"R. D. Schlichting and F. B. Schneider, \"Fail-Stop Processors: An Approach to Designing Fault-Tolerant Computing Systems,\" ACM Trans. Computer Systems, vol. 1, pp. 222\u2013238, Aug. 1983.","journal-title":"ACM Trans. Computer Systems"}],"container-title":["Lecture Notes in Computer Science","Distributed Algorithms"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0019816","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,10]],"date-time":"2020-04-10T20:38:59Z","timestamp":1586551139000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0019816"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1988]]},"ISBN":["9783540193661","9783540392392"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/bfb0019816","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1988]]}}}