{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,18]],"date-time":"2025-11-18T12:15:06Z","timestamp":1763468106572,"version":"3.40.4"},"publisher-location":"Berlin, Heidelberg","reference-count":32,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642356674"},{"type":"electronic","value":"9783642356681"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-35668-1_16","type":"book-chapter","created":{"date-parts":[[2013,1,4]],"date-time":"2013-01-04T10:07:03Z","timestamp":1357294023000},"page":"225-239","source":"Crossref","is-referenced-by-count":25,"title":["Asynchrony from Synchrony"],"prefix":"10.1007","author":[{"given":"Yehuda","family":"Afek","sequence":"first","affiliation":[]},{"given":"Eli","family":"Gafni","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"16_CR1","doi-asserted-by":"crossref","unstructured":"Afek, Y., Attiya, H., Dolev, D., Gafni, E., Merrit, M., Shavit, N.: Atomic Snapshots of Shared Memory. In: Proc. 9th ACM Symposium on Principles of Distributed Computing (PODC 1990), pp. 1\u201313. ACM Press (1990)","DOI":"10.21236\/ADA222765"},{"key":"16_CR2","doi-asserted-by":"crossref","unstructured":"Afek, Y., Attiya, H., Fouren, A., Stupp, G., Touitou, D.: Long-Lived Renaming Made Adaptive. In: PODC, pp. 91\u2013103 (1999)","DOI":"10.1145\/301308.301335"},{"key":"16_CR3","doi-asserted-by":"crossref","unstructured":"Awerbuch, B., Even, S.: Efficient and reliable broadcast is achievable in an eventually connected network (Extended Abstract). In: Proceedings of the Third Annual ACM Symposium on Principles of Distributed Computing, PODC 1984, Vancouver, British Columbia, Canada, pp. 278\u2013281 (1984)","DOI":"10.1145\/800222.806754"},{"key":"16_CR4","doi-asserted-by":"crossref","unstructured":"Afek, Y., Gafni, E.: End-to-end communication in unreliable networks. In: Proceedings of the Seventh Annual ACM Symposium on Principles of Distributed Computing, PODC 1988, Toronto, Ontario, Canada, pp. 131\u2013148 (1988)","DOI":"10.1145\/62546.62570"},{"key":"16_CR5","unstructured":"Afek, Y., Gafni, E., Linial, N.: A King in two tournaments (submitted for publication)"},{"key":"16_CR6","doi-asserted-by":"crossref","unstructured":"Afek, Y., Stupp, G., Touitou, D.: Long-lived Adaptive Collect with Applications. In: FOCS, pp. 262\u2013272 (1999)","DOI":"10.1109\/SFFCS.1999.814598"},{"issue":"1","key":"16_CR7","doi-asserted-by":"publisher","first-page":"124","DOI":"10.1145\/200836.200869","volume":"42","author":"H. Attiya","year":"1995","unstructured":"Attiya, H., Bar-Noy, A., Dolev, D.: Sharing Memory Robustly in Message-Passing Systems. J. ACM\u00a042(1), 124\u2013142 (1995)","journal-title":"J. ACM"},{"issue":"1","key":"16_CR8","doi-asserted-by":"publisher","first-page":"7","DOI":"10.1137\/0403002","volume":"3","author":"A. Bar-Noy","year":"1990","unstructured":"Bar-Noy, A., Naor, J.: Sorting, Minimal Feedback Sets and Hamilton Paths in Tournaments. SIAM Journal on Discrete Mathematics\u00a03(1), 7\u201320 (1990), doi:10.1137\/0403002.","journal-title":"SIAM Journal on Discrete Mathematics"},{"key":"16_CR9","doi-asserted-by":"crossref","unstructured":"Borowsky, E., Gafni, E.: Generalized FLP Impossibility Results for t-Resilient Asynchronous Computations. In: Proc. 25th ACM Symposium on the Theory of Computing (STOC 1993), pp. 91\u2013100. ACM Press (1993)","DOI":"10.1145\/167088.167119"},{"key":"16_CR10","doi-asserted-by":"crossref","unstructured":"Borowsky, E., Gafni, E.: Immediate Atomic Snapshots and Fast Renaming (Extended Abstract). In: PODC, pp. 41\u201351 (1993)","DOI":"10.1145\/164051.164056"},{"key":"16_CR11","doi-asserted-by":"crossref","unstructured":"Borowsky, E., Gafni, E.: A Simple Algorithmically Reasoned Characterization of Wait-Free Computations (Extended Abstract). In: Proc. 16th ACM Symposium on Principles of Distributed Computing (PODC 1997), pp. 189\u2013198. ACM Press (August 1997)","DOI":"10.1145\/259380.259439"},{"issue":"3","key":"16_CR12","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1007\/PL00008933","volume":"14","author":"E. Borowsky","year":"2001","unstructured":"Borowsky, E., Gafni, E., Lynch, N., Rajsbaum, S.: The BG Distributed Simulation Algorithm. Distributed Computing\u00a014(3), 127\u2013146 (2001)","journal-title":"Distributed Computing"},{"issue":"1","key":"16_CR13","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1007\/s00446-009-0084-6","volume":"22","author":"B. Charron-Bost","year":"2009","unstructured":"Charron-Bost, B., Schiper, A.: The Heard-Of model: computing in distributed systems with benign faults. Distributed Computing\u00a022(1), 49\u201371 (2009)","journal-title":"Distributed Computing"},{"issue":"1","key":"16_CR14","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1145\/2455.214112","volume":"32","author":"D. Dolev","year":"1985","unstructured":"Dolev, D., Reischuk, R.: Bounds on information exchange for Byzantine agreement. JACM\u00a032(1), 191\u2013204 (1985)","journal-title":"JACM"},{"issue":"2","key":"16_CR15","doi-asserted-by":"publisher","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. Journal of the ACM\u00a032(2), 374\u2013382 (1985)","journal-title":"Journal of the ACM"},{"key":"16_CR16","doi-asserted-by":"crossref","unstructured":"Gafni, E.: Round-by-Round Fault Detectors, Unifying Synchrony and Asynchrony (Extended Abstract). In: PODC, pp. 143\u2013152 (1998)","DOI":"10.1145\/277697.277724"},{"issue":"3","key":"16_CR17","doi-asserted-by":"publisher","first-page":"970","DOI":"10.1137\/S0097539796305766","volume":"28","author":"E. Gafni","year":"1999","unstructured":"Gafni, E., Koutsoupias, E.: Three-Processor Tasks Are Undecidable. SIAM J. Comput.\u00a028(3), 970\u2013983 (1999)","journal-title":"SIAM J. Comput."},{"key":"16_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"246","DOI":"10.1007\/978-3-540-92221-6_17","volume-title":"Principles of Distributed Systems","author":"E. Gafni","year":"2008","unstructured":"Gafni, E.: The 0\u20131-Exclusion Families of Tasks. In: Baker, T.P., Bui, A., Tixeuil, S. (eds.) OPODIS 2008. LNCS, vol.\u00a05401, pp. 246\u2013258. Springer, Heidelberg (2008)"},{"issue":"1","key":"16_CR19","doi-asserted-by":"publisher","first-page":"124","DOI":"10.1145\/114005.102808","volume":"11","author":"M.P. Herlihy","year":"1991","unstructured":"Herlihy, M.P.: Wait-Free Synchronization. ACM Transactions on programming Languages and Systems\u00a011(1), 124\u2013149 (1991)","journal-title":"ACM Transactions on programming Languages and Systems"},{"key":"16_CR20","doi-asserted-by":"crossref","unstructured":"Herlihy, M., Rajsbaum, S., Tuttle, M.R.: Unifying Synchronous and Asynchronous Message-Passing Models. In: PODC, pp. 133\u2013142 (1998)","DOI":"10.1145\/277697.277722"},{"issue":"6","key":"16_CR21","doi-asserted-by":"publisher","first-page":"858","DOI":"10.1145\/331524.331529","volume":"46","author":"M.P. Herlihy","year":"1999","unstructured":"Herlihy, M.P., Shavit, N.: The Topological Structure of Asynchronous Computability. Journal of the ACM\u00a046(6), 858\u2013923 (1999)","journal-title":"Journal of the ACM"},{"key":"16_CR22","doi-asserted-by":"crossref","unstructured":"Kuhn, F., Lynch, N., Oshman, R.: Distributed Computation in Dynamic Graphs. In: 42nd ACM Symposium on Theory of Computing (STOC 2010) (2010)","DOI":"10.1145\/1806689.1806760"},{"issue":"2","key":"16_CR23","doi-asserted-by":"publisher","first-page":"86","DOI":"10.1007\/BF01786228","volume":"1","author":"L. Lamport","year":"1986","unstructured":"Lamport, L.: On Interprocess Communication. Part II: Algorithms. Distributed Computing\u00a01(2), 86\u2013101 (1986)","journal-title":"Distributed Computing"},{"issue":"2","key":"16_CR24","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1007\/BF02476378","volume":"15","author":"H. Landau","year":"1953","unstructured":"Landau, H.: On dominance relations and the structure of animal societies, III: The condition for score structure. Bulletin of Mathematical Biophysics\u00a015(2), 143\u2013148 (1953)","journal-title":"Bulletin of Mathematical Biophysics"},{"issue":"3","key":"16_CR25","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1016\/0020-0190(87)90052-4","volume":"26","author":"S. Moran","year":"1987","unstructured":"Moran, S., Wolfstahl, Y.: Extended impossibility results for asynchronous complete networks. Inf. Process. Lett.\u00a026(3), 145\u2013151 (1987)","journal-title":"Inf. Process. Lett."},{"key":"16_CR26","doi-asserted-by":"crossref","unstructured":"Moses, Y., Rajsbaum, S.: The Unified Structure of Consensus: A Layered Analysis Approach. In: PODC, pp. 123\u2013132 (1998)","DOI":"10.1145\/277697.277720"},{"key":"16_CR27","unstructured":"Munkres, J.R.: Elements of algebraic topology. Addison-Wesley (1984)"},{"issue":"5","key":"16_CR28","doi-asserted-by":"publisher","first-page":"1449","DOI":"10.1137\/S0097539796307698","volume":"29","author":"M. Saks","year":"2000","unstructured":"Saks, M., Zaharoglou, F.: Wait-Free k-Set Agreement is Impossible: The Topology of Public Knowledge. SIAM Journal on Computing\u00a029(5), 1449\u20131483 (2000)","journal-title":"SIAM Journal on Computing"},{"key":"16_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"304","DOI":"10.1007\/BFb0028994","volume-title":"STACS 89","author":"S. Nicola","year":"1989","unstructured":"Nicola, S., Peter, W.: Time is Not a Healer. In: Cori, R., Monien, B. (eds.) STACS 1989. LNCS, vol.\u00a0349, pp. 304\u2013313. Springer, Heidelberg (1989)"},{"issue":"2-3","key":"16_CR30","doi-asserted-by":"publisher","first-page":"232","DOI":"10.1016\/j.tcs.2007.04.036","volume":"384","author":"S. Nicola","year":"2007","unstructured":"Nicola, S., Peter, W.: Agreement in synchronous networks with ubiquitous faults. Theor. Comput. Sci.\u00a0384(2-3), 232\u2013249 (2007)","journal-title":"Theor. Comput. Sci."},{"key":"16_CR31","unstructured":"Sperner, E.: Fifty years of further development of a combinatorial lemma. In: Numerical solution of highly nonlinear problems (Sympos. Fixed Point Algorithms and Complementarity Problems, Univ. Southampton, Southampton), Part A, pp. 183\u2013197, Part B, pp. 199\u2013214 (1979)"},{"issue":"5","key":"16_CR32","doi-asserted-by":"publisher","first-page":"1912","DOI":"10.1137\/S009753970443999X","volume":"38","author":"U. Schmid","year":"2009","unstructured":"Schmid, U., Weiss, B., Keidar, I.: Impossibility results and lower bounds for consensus under link failures. SIAM Journal on Computing\u00a038(5), 1912\u20131951 (2009)","journal-title":"SIAM Journal on Computing"}],"container-title":["Lecture Notes in Computer Science","Distributed Computing and Networking"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-35668-1_16.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,29]],"date-time":"2025-04-29T16:00:11Z","timestamp":1745942411000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-35668-1_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642356674","9783642356681"],"references-count":32,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-35668-1_16","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}