{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T22:56:22Z","timestamp":1725663382528},"publisher-location":"Berlin, Heidelberg","reference-count":12,"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_28","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T21:12:32Z","timestamp":1330204352000},"page":"13-23","source":"Crossref","is-referenced-by-count":1,"title":["Fault-tolerant critical section management in asynchronous networks"],"prefix":"10.1007","author":[{"given":"Amotz","family":"Bar-Noy","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Danny","family":"Dolev","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Daphne","family":"Koller","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"David","family":"Peleg","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,2]]},"reference":[{"key":"2_CR1","doi-asserted-by":"crossref","unstructured":"H. Attiya, A. Bar-Noy, D. Dolev D. Koller, D. Peleg, and R. Reischuk, Achievable Cases in an Asynchronous Environment, Proc. 28th Symp. on Foundations of Comp. Science, pp. 196\u2013203, 1987.","DOI":"10.1109\/SFCS.1987.5"},{"key":"2_CR2","doi-asserted-by":"crossref","unstructured":"O. Biran, S. Moran, and S. Zaks, A Combinatorial Characterization of the Distributed Tasks which are Solvable in the Presence of One Faulty Processor, Proc. 7rd ACM Symp. of Principles of Dist. Computing, pp. 263\u2013273, 1988.","DOI":"10.1145\/62546.62590"},{"key":"2_CR3","doi-asserted-by":"crossref","unstructured":"M. F. Bridgland, and R. J. Watro, Fault-Tolerant Decision Making in Totally Asynchronous Distributed Systems, Proc. 6rd ACM Symp. of Principles of Dist. Computing, pp. 52\u201363, 1987.","DOI":"10.1145\/41840.41845"},{"key":"2_CR4","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1145\/7531.7533","volume":"34","author":"D. Dolev","year":"1987","unstructured":"D. Dolev, C. Dwork and L. Stockmeyer, On the Minimal Synchronism Needed for Distributed Consensus, Journal of the ACM, 34 pp. 77\u201397, 1987.","journal-title":"Journal of the ACM"},{"key":"2_CR5","doi-asserted-by":"crossref","unstructured":"D. Dolev, E. Gafni, and N. Shavit, Toward a Non-Atomic Era: L-Exclusion as a Test Case, Proc. 19th ACM SIGACT Symposium on Theory of Computing, pp. 78\u201392, 1988.","DOI":"10.1145\/62212.62220"},{"key":"2_CR6","doi-asserted-by":"publisher","first-page":"499","DOI":"10.1145\/5925.5931","volume":"33","author":"D. Dolev","year":"1986","unstructured":"D. Dolev, N. A. Lynch, S. Pinter, E. Stark, and W. E. Weihl, Reaching Approximate Agreement in the Presence of Faults, Journal of the ACM, 33 pp. 499\u2013516, 1986.","journal-title":"Journal of the ACM"},{"key":"2_CR7","doi-asserted-by":"crossref","unstructured":"M.J. Fischer, N.A. Lynch, J. E. Burns, and A. Borodin, Resource Allocation with Immunity to Limited Process Failure, Proc. 20th Symp. on Foundations of Comp. Science, pp. 234\u2013254, 1979.","DOI":"10.1109\/SFCS.1979.37"},{"issue":"2","key":"2_CR8","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, M.S. Paterson, Impossibility of Distributed Consensus with one Faulty Processor, Journal of the ACM, Vol. 32, No. 2, April 1985, pp. 374\u2013382.","journal-title":"Journal of the ACM"},{"key":"2_CR9","unstructured":"D. Koller, Token Survival: Resilient Token Algorithms, M.Sc. Thesis, Hebrew University, 1986."},{"key":"2_CR10","unstructured":"J. L. Peterson, and A. Silberschatz, Operating Systems Concepts, 2nd Edition, Addison-Wesley Publishing Co., 1985, Ch. 8,9,13."},{"key":"2_CR11","unstructured":"M. Raynal, Algorithms for Mutual Exclusion, North Oxford Academic Publishers Ltd, 1986."},{"key":"2_CR12","unstructured":"L. S. Rudolph, Software Structures for Ultra Parallel Computing, Ph.D. Dissertation, Courant Institute, New York University, 1981."}],"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_28.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T21:22:27Z","timestamp":1605648147000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-51687-5_28"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1989]]},"ISBN":["9783540516873","9783540467502"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/3-540-51687-5_28","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1989]]}}}