{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,23]],"date-time":"2026-08-23T17:51:39Z","timestamp":1787507499693,"version":"build-2736575974"},"reference-count":21,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[1996,2,1]],"date-time":"1996-02-01T00:00:00Z","timestamp":823132800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Acta Informatica"],"published-print":{"date-parts":[[1996,2]]},"DOI":"10.1007\/s002360050034","type":"journal-article","created":{"date-parts":[[2002,8,25]],"date-time":"2002-08-25T03:47:25Z","timestamp":1030247245000},"page":"1-20","source":"Crossref","is-referenced-by-count":22,"title":["Possibility and impossibility results in a shared memory environment"],"prefix":"10.1007","volume":"33","author":[{"given":"Gadi","family":"Taubenfeld","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Shlomo","family":"Moran","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"60330001236_CR1","doi-asserted-by":"crossref","unstructured":"Attiya, H., Bar-Noy, A., Dolev, D., Koller, D., Peleg, D., Reischuk, R.: Achievable cases in an asynchronous environment. In Proc. 28th IEEE Symp. on Foundations of Computer Science, pp 337\u2013346 (1987)","DOI":"10.1109\/SFCS.1987.5"},{"key":"60330001236_CR2","doi-asserted-by":"crossref","unstructured":"Abrahamson, K.: On achieving consensus using shared memory. In Proc. 7th ACM Symp. on Principles of Distributed Computing, pp 291\u2013302 (1988)","DOI":"10.1145\/62546.62594"},{"key":"60330001236_CR3","doi-asserted-by":"crossref","unstructured":"Bar-Yehuda, R., Kutten, S., Wolfstahl, Y., Zaks, S., Making distributed spanning tree algorithms fault-resilient. In Proc. 4th Annual Symposium on Theoretical Aspects of Computer Science; Lecture Notes in Computer Science 247, pp. 222\u2013231 (1987)","DOI":"10.1007\/BFb0039625"},{"key":"60330001236_CR4","doi-asserted-by":"crossref","unstructured":"Biran, O., Moran, S., Zaks, S.: A combinatorial characterization of the distributed tasks which are solvable in the presence of one faulty processor. In Proc. 7th ACM Symp. on Principles of Distributed Computing, pp 263\u2013275 (1988)","DOI":"10.1145\/62546.62590"},{"key":"60330001236_CR5","doi-asserted-by":"crossref","unstructured":"Bridgland, M., Watro, R.: Fault-tolerant decision making in totally asynchronous distributed systems. In Proc 6th ACM Symp. on Principles of Distributed Computing, pp 52\u201363 (1987)","DOI":"10.1145\/41840.41845"},{"key":"60330001236_CR6","doi-asserted-by":"crossref","unstructured":"Chor, B., Israeli, A., Li, M: On processor coordination using asynchronous hardware. In Proc. 6th ACM Symp. on Principles of Distributed Computing, pp 86\u201397 (1987)","DOI":"10.1145\/41840.41848"},{"key":"60330001236_CR7","unstructured":"Chandy, M., Misra, J.: On the nonexistence of robust commit protocols. Manuscript, November 1985."},{"key":"60330001236_CR8","doi-asserted-by":"crossref","first-page":"40","DOI":"10.1007\/BF01843569","volume":"1","author":"M. Chandy","year":"1986","unstructured":"Chandy, M. and Misra, J., How processes learn. J. Distributed Computing 1, 40\u201352 (1986)","journal-title":"J. Distributed Computing"},{"key":"60330001236_CR9","doi-asserted-by":"crossref","unstructured":"Chor, B., Moscovici, L.: Solvability in asynchronous environments. In Proc. 30th IEEE Symp. on Foundations of Computer Science, pp 422\u2013427 (1989)","DOI":"10.1109\/SFCS.1989.63513"},{"issue":"1","key":"60330001236_CR10","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1145\/7531.7533","volume":"34","author":"D. Dolev","year":"1987","unstructured":"Dolev, D., Dwork, C., Stockmeyer, L.: On the minimal synchronism needed for distributed consensus. J. ACM 34(1) 77\u201397 (1987)","journal-title":"J. ACM"},{"issue":"2","key":"60330001236_CR11","doi-asserted-by":"crossref","first-page":"288","DOI":"10.1145\/42282.42283","volume":"35","author":"C. Dwork","year":"1988","unstructured":"Dwork, C., Lynch, N., Stockmeyer, L.: Consensus in the presence of partial synchrony. J. ACM 35(2), 288\u2013323 (1988)","journal-title":"J. ACM"},{"key":"60330001236_CR12","volume-title":"Mathematical Logic","author":"H. Ebbinghaus","year":"1984","unstructured":"Ebbinghaus, H., Flum, J., Thomas, W.: Mathematical Logic Berlin: Springer 1984"},{"issue":"2","key":"60330001236_CR13","doi-asserted-by":"crossref","first-page":"374","DOI":"10.1145\/3149.214121","volume":"32","author":"M. J. Fischer","year":"1985","unstructured":"Fischer, M. J., Lynch, N. A., Paterson, M. S.: Impossibility of distributed consensus with one faulty process. J. ACM 32(2) 374\u2013382 (1985)","journal-title":"J. ACM"},{"key":"60330001236_CR14","doi-asserted-by":"crossref","unstructured":"Hadzilacos, V.: A knowledge theoretic analysis of atomic commitment protocols. In Proc. 6th ACM Symp. on Principles of Database Systems, pp 129\u2013134 (1987)","DOI":"10.1145\/28659.28672"},{"key":"60330001236_CR15","doi-asserted-by":"crossref","unstructured":"Herlihy, P. M.: Impossibility and universality results for wait-free synchronization. In Proc. 7th ACM Symp. on Principles of Distributed Computing, pp 276\u2013290 (1988)","DOI":"10.1145\/62546.62593"},{"key":"60330001236_CR16","first-page":"163","volume":"4","author":"C. M. Loui","year":"1988","unstructured":"Loui, C. M., Abu-Amara, H.: Memory requirements for agreement among unreliable asynchronous processes. Advances in Computing Research, 4:163\u2013183 (1988)","journal-title":"Advances in Computing Research"},{"key":"60330001236_CR17","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1016\/0020-0190(87)90052-4","volume":"26","author":"S. Moran","year":"1987","unstructured":"Moran S., Wolfsthal, Y.: An extended impossibility result for asynchronous complete networks. Inform. Process. Lett. 26:141\u2013151 (1987)","journal-title":"Inform. Process. Lett."},{"key":"60330001236_CR18","unstructured":"Taubenfeld, G.: Impossibility results for decision protocols. Technical Report 445, Technion, January 1987. Revised version appeared as Technion TR-#506, April 1988."},{"key":"60330001236_CR19","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1016\/0020-0190(89)90183-X","volume":"33","author":"G. Taubenfeld","year":"1989","unstructured":"Taubenfeld, G.: Leader election in the presence of n-1 initial failures. Informa. Process. Lett. 33, 25\u201328 (1989)","journal-title":"Informa. Process. Lett."},{"issue":"2","key":"60330001236_CR20","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1006\/inco.1994.1068","volume":"113","author":"G. Taubenfeld","year":"1994","unstructured":"Taubenfeld G., Katz, S., Moran, S.: Impossibility results in the presence of multiple faulty processes. Inforn. Comput. 113(2), 173\u2013198 (1994) Also in: LNCS 405 (eds.: C. E. Veni Madhavan), Springer Verlag 1989, pp 109\u2013120","journal-title":"Inforn. Comput."},{"key":"60330001236_CR21","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1007\/BF01407859","volume":"18","author":"G. Taubenfeld","year":"1989","unstructured":"Taubenfeld, G., Katz, S., Moran, S.: Initial failures in distributed computations. Int. J. Parallel Programming 18, 255\u2013276 (1989)","journal-title":"Int. J. Parallel Programming"}],"container-title":["Acta Informatica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s002360050034.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s002360050034\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s002360050034","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,24]],"date-time":"2019-05-24T09:42:00Z","timestamp":1558690920000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s002360050034"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996,2]]},"references-count":21,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1996,2]]}},"alternative-id":["60330001236"],"URL":"https:\/\/doi.org\/10.1007\/s002360050034","relation":{},"ISSN":["0001-5903","1432-0525"],"issn-type":[{"value":"0001-5903","type":"print"},{"value":"1432-0525","type":"electronic"}],"subject":[],"published":{"date-parts":[[1996,2]]}}}