{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,4]],"date-time":"2025-01-04T22:10:30Z","timestamp":1736028630987,"version":"3.32.0"},"publisher-location":"Berlin, Heidelberg","reference-count":34,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540291633"},{"type":"electronic","value":"9783540320753"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11561927_7","type":"book-chapter","created":{"date-parts":[[2005,10,10]],"date-time":"2005-10-10T14:14:47Z","timestamp":1128953687000},"page":"63-77","source":"Crossref","is-referenced-by-count":8,"title":["Musical Benches"],"prefix":"10.1007","author":[{"given":"Eli","family":"Gafni","sequence":"first","affiliation":[]},{"given":"Sergio","family":"Rajsbaum","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"4","key":"7_CR1","doi-asserted-by":"publisher","first-page":"873","DOI":"10.1145\/153724.153741","volume":"40","author":"Y. Afek","year":"1993","unstructured":"Afek, Y., Attiya, H., Dolev, D., Gafni, E., Merritt, M., Shavit, N.: Atomic Snapshots of Shared Memory. Journal of the ACM\u00a040(4), 873\u2013890 (1993)","journal-title":"Journal of the ACM"},{"issue":"1","key":"7_CR2","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. Journal of the ACM\u00a042(1), 124\u2013142 (1995)","journal-title":"Journal of the ACM"},{"issue":"3","key":"7_CR3","doi-asserted-by":"publisher","first-page":"524","DOI":"10.1145\/79147.79158","volume":"37","author":"H. Attiya","year":"1990","unstructured":"Attiya, H., Bar-Noy, A., Dolev, D., Peleg, D., Reischuk, R.: Renaming In An Asynchronous Environment. Journal of the ACM\u00a037(3), 524\u2013548 (1990)","journal-title":"Journal of the ACM"},{"issue":"2","key":"7_CR4","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1137\/S0097539795279463","volume":"27","author":"H. Attiya","year":"1998","unstructured":"Attiya, H., Rachman, O.: Atomic Snapshots in O(nlogn) Operations. SIAM Journal of Computing\u00a027(2), 319\u2013340 (1998)","journal-title":"SIAM Journal of Computing"},{"issue":"4","key":"7_CR5","doi-asserted-by":"publisher","first-page":"1286","DOI":"10.1137\/S0097539797330689","volume":"31","author":"H. Attiya","year":"2002","unstructured":"Attiya, H., Rajsbaum, S.: The Combinatorial Structure of Wait-Free Solvable Tasks. SIAM J. Comput.\u00a031(4), 1286\u20131313 (2002)","journal-title":"SIAM J. Comput."},{"key":"7_CR6","first-page":"91","volume-title":"Proc. 25th ACM Symposium on the Theory of Computing (STOC 1993)","author":"E. Borowsky","year":"1993","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, New York (1993)"},{"key":"7_CR7","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1145\/164051.164056","volume-title":"Proc. 12th ACM Symposium on Principles of Distributed Computing (PODC 1993)","author":"E. Borowsky","year":"1993","unstructured":"Borowsky, E., Gafni, E.: Immediate Atomic Snapshots and Fast Renaming (Extended Abstract). In: Proc. 12th ACM Symposium on Principles of Distributed Computing (PODC 1993), pp. 41\u201351. ACM Press, New York (1993)"},{"key":"7_CR8","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1145\/259380.259439","volume-title":"Proc. 16th ACM Symposium on Principles of Distributed Computing (PODC 1997)","author":"E. Borowsky","year":"1997","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, New York (1997)"},{"issue":"3","key":"7_CR9","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"},{"key":"7_CR10","doi-asserted-by":"crossref","unstructured":"Burns, J., Peterson, G.: The Ambiguity of Choosing. In: Proc. 8th ACM Symposium on Principles of Distributed Computing (PODC), Edmonton, Alberta, Canada, August 14\u201316, pp. 145\u2013157 (1989)","DOI":"10.1145\/72981.72991"},{"key":"7_CR11","doi-asserted-by":"publisher","first-page":"132","DOI":"10.1006\/inco.1993.1043","volume":"105","author":"S. Chaudhuri","year":"1993","unstructured":"Chaudhuri, S.: More Choices Allow More Faults: Set Consensus Problems in Totally Asynchronous Systems. Information and Computation\u00a0105, 132\u2013158 (1993)","journal-title":"Information and Computation"},{"key":"7_CR12","doi-asserted-by":"publisher","first-page":"9","DOI":"10.1007\/BF01783662","volume":"4","author":"A. Fekete","year":"1990","unstructured":"Fekete, A.: Asymptotically Optimal Algorithms for Approximate Agreement. Distributed Computing\u00a04, 9\u201329 (1990)","journal-title":"Distributed Computing"},{"issue":"2","key":"7_CR13","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":"7_CR14","doi-asserted-by":"crossref","unstructured":"Gafni, E.: Round-by-Round Fault Detectors: Unifying Synchrony and Asynchrony (Extended Abstract). In: Proc. 17th ACM Symposium on Principles of Distributed Computing (PODC), Puerto Vallarta, Mexico, June 28\u2013July 2, pp. 143\u2013152 (1998)","DOI":"10.1145\/277697.277724"},{"key":"7_CR15","unstructured":"Gafni, E.: DISC\/GODEL presentation: R\/W Reductions. October 4 (2004), http:\/\/www.cs.ucla.edu\/~eli\/eli\/godel.ppt"},{"issue":"3","key":"7_CR16","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":"7_CR17","doi-asserted-by":"crossref","unstructured":"Gafni, E., Guerraoui, R., Pochon, B.: From a Static Impossibility to an Adaptive Lower Bound: The Complexity of Early Deciding Set Agreement. In: Proc. 37th ACM Symposium on Theory of Computing (STOC 2005), Baltimore (MD) (May 2005)","DOI":"10.1145\/1060590.1060696"},{"key":"7_CR18","unstructured":"Goubault, E.: A historical note on Geometry and Concurrency, http:\/\/www.di.ens.fr\/~goubault\/index1.html"},{"issue":"2","key":"7_CR19","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1007\/s004460050068","volume":"13","author":"J. Havlicek","year":"2000","unstructured":"Havlicek, J.: Computable Obstructions to Wait-Free Computability. Distributed Computing\u00a013(2), 59\u201383 (2000)","journal-title":"Distributed Computing"},{"issue":"1","key":"7_CR20","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":"7_CR21","first-page":"589","volume-title":"Proc. 29th ACM Symposium on the Theory of Computing (STOC 1997)","author":"M. Herlihy","year":"1997","unstructured":"Herlihy, M., Rajsbaum, S.: The Decidability of Distributed Decision Tasks (Extended Abstract). In: Proc. 29th ACM Symposium on the Theory of Computing (STOC 1997), May 1997, pp. 589\u2013598. ACM Press, New York (1997)"},{"key":"7_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"170","DOI":"10.1007\/3-540-48340-3_16","volume-title":"Mathematical Foundations of Computer Science 1999","author":"M. Herlihy","year":"1999","unstructured":"Herlihy, M., Rajsbaum, S.: New Perspectives in Distributed Computing. In: Kuty\u0142owski, M., Wierzbicki, T., Pacholski, L. (eds.) MFCS 1999. LNCS, vol.\u00a01672, pp. 170\u2013186. Springer, Heidelberg (1999)"},{"issue":"4","key":"7_CR23","doi-asserted-by":"publisher","first-page":"549","DOI":"10.1017\/S0960129500003170","volume":"10","author":"H. Herlihy","year":"2000","unstructured":"Herlihy, H., Rajsbaum, S.: Algebraic spans. Mathematical Structures in Computer Science\u00a010(4), 549\u2013573 (2000)","journal-title":"Mathematical Structures in Computer Science"},{"issue":"1","key":"7_CR24","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1016\/S0304-3975(01)00396-6","volume":"291","author":"H. Herlihy","year":"2003","unstructured":"Herlihy, H., Rajsbaum, S.: A classification of wait-free loop agreement tasks. Theor. Comput. Sci.\u00a0291(1), 55\u201377 (2003)","journal-title":"Theor. Comput. Sci."},{"key":"7_CR25","doi-asserted-by":"crossref","unstructured":"Herlihy, M., Rajsbaum, S., Tuttle, M.: Unifying Synchronous and Asynchronous Message-Passing Models. In: Proc. 17th ACM Symposium on Principles of Distributed Computing (PODC), Puerto Vallarta, Mexico, June 28\u2013July 2, pp. 133\u2013142 (1998)","DOI":"10.1145\/277697.277722"},{"key":"7_CR26","doi-asserted-by":"crossref","unstructured":"Herlihy, M., Rajsbaum, S., Tuttle, M.: An Overview of Synchronous Message-Passing and Topology. Electr. Notes Theor. Comput. Sci.\u00a039(2) (2001)","DOI":"10.1016\/S1571-0661(05)01148-5"},{"key":"7_CR27","unstructured":"Herlihy, M., Rajsbaum, S., Tuttle, M.: An axiomatic approach to computing the connectivity of synchronous and asynchronous systems. In: Proc. of the 6th workshop on Geometric and Topological Methods in Concurrency and Distributed Computing (GETCO), October 4 (2004)"},{"key":"7_CR28","doi-asserted-by":"crossref","unstructured":"Hoest, G., Shavit, N.: Towards a Topological Characterization of Asynchronous Complexity (Preliminary Version). In: Proc. 16th ACM Symposium on Principles of Distributed Computing (PODC), Santa Barbara, California, USA, August 21\u201324, pp. 199\u2013208","DOI":"10.1145\/259380.259440"},{"issue":"6","key":"7_CR29","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"},{"issue":"3","key":"7_CR30","doi-asserted-by":"publisher","first-page":"451","DOI":"10.1145\/278298.278305","volume":"45","author":"P. Jayanti","year":"1998","unstructured":"Jayanti, P., Chandra, T., Toueg, S.: Fault-tolerant wait-free shared objects. Journal of the ACM\u00a045(3), 451\u2013500 (1998)","journal-title":"Journal of the ACM"},{"key":"7_CR31","series-title":"Lectures on Topological Methods in Combinatorics and Geometry","volume-title":"Using the Borsuk-Ulam Theorem","author":"J. Matousek","year":"2003","unstructured":"Matousek, J.: Using the Borsuk-Ulam Theorem. Lectures on Topological Methods in Combinatorics and Geometry. Springer, Heidelberg (2003)"},{"key":"7_CR32","doi-asserted-by":"publisher","first-page":"283","DOI":"10.1109\/WORDS.1997.609969","volume-title":"Proc. 3rd Int. Workshop on Object-Oriented Real-Time Dependable Systems (WORDS 1997)","author":"M. Raynal","year":"1997","unstructured":"Raynal, M.: Real-time dependable decisions in timed asynchronous distributed systems. In: Proc. 3rd Int. Workshop on Object-Oriented Real-Time Dependable Systems (WORDS 1997), pp. 283\u2013290. IEEE Computer Society Press, Newport Beach (1997)"},{"key":"7_CR33","unstructured":"Tel, G.: Introduction to Distributed Algorithms, 2nd edn., February 15. Cambridge University Press, Cambridge (2001)"},{"issue":"5","key":"7_CR34","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"}],"container-title":["Lecture Notes in Computer Science","Distributed Computing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11561927_7.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,4]],"date-time":"2025-01-04T21:44:05Z","timestamp":1736027045000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11561927_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540291633","9783540320753"],"references-count":34,"URL":"https:\/\/doi.org\/10.1007\/11561927_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}