{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,30]],"date-time":"2026-07-30T12:48:16Z","timestamp":1785415696432,"version":"3.56.0"},"reference-count":20,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[1989,8,1]],"date-time":"1989-08-01T00:00:00Z","timestamp":617932800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Int J Parallel Prog"],"published-print":{"date-parts":[[1989,8]]},"DOI":"10.1007\/bf01407859","type":"journal-article","created":{"date-parts":[[2005,4,3]],"date-time":"2005-04-03T04:52:59Z","timestamp":1112503979000},"page":"255-276","source":"Crossref","is-referenced-by-count":13,"title":["Initial failures in distributed computations"],"prefix":"10.1007","volume":"18","author":[{"given":"Gadi","family":"Taubenfeld","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Shmuel","family":"Katz","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Shlomo","family":"Moran","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"issue":"2","key":"CR1","doi-asserted-by":"crossref","first-page":"374","DOI":"10.1145\/3149.214121","volume":"32","author":"M. Fischer","year":"1985","unstructured":"M. Fischer, N. Lynch, and M. Paterson, Impossibility of distributed consensus with one faulty process,JACM 32(2):374?382 (1985).","journal-title":"JACM"},{"key":"CR2","doi-asserted-by":"crossref","unstructured":"R. Bar-Yehuda, S. Kutten, Y. Wolfstahl, and S. Zaks, Making distributed spanning tree algorithms fault-resilient,STACS 87, LNCS No. 247, pp. 432?445.","DOI":"10.1007\/BFb0039625"},{"issue":"4","key":"CR3","doi-asserted-by":"crossref","first-page":"449","DOI":"10.1109\/12.2189","volume":"37","author":"H. Abu-Amara","year":"1988","unstructured":"H. Abu-Amara, Fault-Tolerant distributed algorithm for election in computer network,IEEE Transactions on Computers,37(4):449?453 (April 1988).","journal-title":"IEEE Transactions on Computers"},{"issue":"1","key":"CR4","doi-asserted-by":"crossref","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,JACM 34(1):77?97 (1987).","journal-title":"JACM"},{"issue":"2","key":"CR5","doi-asserted-by":"crossref","first-page":"288","DOI":"10.1145\/42282.42283","volume":"35","author":"C. Dwork","year":"1988","unstructured":"C. Dwork, N. Lynch, and L. Stockmeyer, Consensus in the presence of partial synchrony,JACM 35(2):288?323 (1988).","journal-title":"JACM"},{"key":"CR6","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1016\/0020-0190(87)90052-4","volume":"26","author":"S. Moran","year":"1987","unstructured":"S. Moran and Y. Wolfstahl, An extended impossibility result for asynchronous complete networks,IPL 26:145?151 (November, 1987).","journal-title":"IPL"},{"key":"CR7","unstructured":"G. Taubenfeld, Impossibility Results for Decision Protocols, Technion Technical Report #445 (January 1987). Revised version, Technion Technical Report #506 (April 1988)."},{"key":"CR8","doi-asserted-by":"crossref","unstructured":"O. Biran, S. Moran, and S. Zaks, A Combinatorial characterization of the distributed taks which are solvable in the presence of one faulty processor,ACM-PODC (1988).","DOI":"10.1145\/62546.62590"},{"key":"CR9","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,IEEE-FOCS, pp. 337?346 (1987).","DOI":"10.1109\/SFCS.1987.5"},{"key":"CR10","doi-asserted-by":"crossref","unstructured":"M. Bridgland and R. Watro, Fault-tolerant decision making in totally asynchronous distributed systems,ACM-PODC, pp. 52?63 (1987).","DOI":"10.1145\/41840.41845"},{"key":"CR11","unstructured":"G. Taubenfeld, S. Katz, and S. Moran, Impossibility Results in the presence of multiple faulty processes, Technion Technical Report #492 (January 1988). Also, in theProceeding of the 9th FCT-TCS Conference, Bangalore, India (December 1989)."},{"key":"CR12","doi-asserted-by":"crossref","unstructured":"B. Chor and L. Moscovici, Solvability in asynchronous environments,IEEE-FOCS, pp. 422?427 (1989).","DOI":"10.1109\/SFCS.1989.63513"},{"key":"CR13","doi-asserted-by":"crossref","unstructured":"G. Taubenfeld and S. Moran, Possibility and impossibility results in a shared memory environment,Proceedings of the 3rd International Workshop on Distributed Algorithms, Nice, France (September 1989). In:LNCS 392, eds., J. C. Bermond and M. Raynal, Springer Verlag (1989).","DOI":"10.1007\/3-540-51687-5_48"},{"key":"CR14","unstructured":"M. Chandy and J. Misra, On the nonexistence of robust commit protocols, Unpublished manuscript (November 1985)."},{"key":"CR15","doi-asserted-by":"crossref","unstructured":"M. Chandy and J. Misra, How processes learn,Distributed Computing, pp. 40?52 (1986).","DOI":"10.1007\/BF01843569"},{"key":"CR16","doi-asserted-by":"crossref","unstructured":"V. Hadzilacos, A knowledge theoretic analysis of atomic commitment protocols,ACM-PODS, pp. 129?134 (1987).","DOI":"10.1145\/28659.28672"},{"key":"CR17","unstructured":"H. Ebbinghaus, J. Flum, and W. Thomas, Mathematical Logic, Springer-Verlag (1984)."},{"key":"CR18","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,ACM-PODC, pp. 199?207 (1984).","DOI":"10.1145\/800222.806747"},{"key":"CR19","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1016\/0020-0190(88)90023-3","volume":"27","author":"R. Koo","year":"1988","unstructured":"R. Koo and S. Toueg, Effects of message loss on the termination of distributed protocols,IPL 27:181?188 (April 1988).","journal-title":"IPL"},{"key":"CR20","unstructured":"G. Moran, personal communication."}],"container-title":["International Journal of Parallel Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01407859.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01407859\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01407859","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,6]],"date-time":"2020-04-06T17:07:08Z","timestamp":1586192828000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01407859"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1989,8]]},"references-count":20,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1989,8]]}},"alternative-id":["BF01407859"],"URL":"https:\/\/doi.org\/10.1007\/bf01407859","relation":{},"ISSN":["0885-7458","1573-7640"],"issn-type":[{"value":"0885-7458","type":"print"},{"value":"1573-7640","type":"electronic"}],"subject":[],"published":{"date-parts":[[1989,8]]}}}