{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T13:59:26Z","timestamp":1725544766134},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540327554"},{"type":"electronic","value":"9783540327561"}],"license":[{"start":{"date-parts":[[2006,1,1]],"date-time":"2006-01-01T00:00:00Z","timestamp":1136073600000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11682462_47","type":"book-chapter","created":{"date-parts":[[2006,2,17]],"date-time":"2006-02-17T06:50:30Z","timestamp":1140159030000},"page":"502-514","source":"Crossref","is-referenced-by-count":9,"title":["The Committee Decision Problem"],"prefix":"10.1007","author":[{"given":"Eli","family":"Gafni","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sergio","family":"Rajsbaum","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michel","family":"Raynal","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Corentin","family":"Travers","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"47_CR1","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1007\/978-1-4757-1793-8","volume-title":"Basic Topology","author":"M.A. Armstrong","year":"1983","unstructured":"Armstrong, M.A.: Basic Topology, p. 251. Springer, Heidelberg (1983)"},{"key":"47_CR2","first-page":"451","volume-title":"Distributed Computing: Fundamentals, Simulations and Advanced Topics","author":"H. Attiya","year":"1998","unstructured":"Attiya, H., Welch, J.: Distributed Computing: Fundamentals, Simulations and Advanced Topics, 451 pages. McGraw\u2013Hill, New York (1998)"},{"issue":"1","key":"47_CR3","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1006\/inco.1995.1101","volume":"120","author":"A. Bar-Noy","year":"1995","unstructured":"Bar-Noy, A., Deng, X., Garay, J., Kameda, T.: Optimal amortized distributed consensus. Info. and Comp.\u00a0120(1), 93\u2013100 (1995)","journal-title":"Info. and Comp."},{"key":"47_CR4","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":"47_CR5","doi-asserted-by":"crossref","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)"},{"issue":"3","key":"47_CR6","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":"47_CR7","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"},{"issue":"2","key":"47_CR8","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":"47_CR9","unstructured":"Gafni E.: DISC\/GODEL presentation: R\/W Reductions (DISC 2004) (2004), \n                    \n                      http:\/\/www.cs.ucla.edu\/~eli\/eli\/godel.ppt"},{"key":"47_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1007\/11561927_7","volume-title":"Distributed Computing","author":"E. Gafni","year":"2005","unstructured":"Gafni, E., Rajsbaum, S.: Musical Benches. In: Fraigniaud, P. (ed.) DISC 2005. LNCS, vol.\u00a03724, pp. 63\u201377. Springer, Heidelberg (2005)"},{"key":"47_CR11","unstructured":"Gafni, E., Rajsbaum, R., Raynal, M., Travers, C.: The Committee Decision Problem. Tech Report #1745, IRISA, University of Rennes 1, France (2005), \n                    \n                      http:\/\/www.irisa.fr\/bibli\/publi\/pi\/2005\/1745\/1745.html"},{"issue":"1","key":"47_CR12","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":"47_CR13","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":"47_CR14","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"},{"key":"47_CR15","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 1998), pp. 133\u2013142 (1998)","DOI":"10.1145\/277697.277722"},{"key":"47_CR16","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 2004) (2004)"},{"issue":"6","key":"47_CR17","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":"47_CR18","first-page":"872","volume-title":"Distributed Algorithms","author":"N. Lynch","year":"1996","unstructured":"Lynch, N.: Distributed Algorithms, p. 872. Morgan Kaufmann Pub., San Francisco (1996)"},{"key":"47_CR19","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)"},{"issue":"2","key":"47_CR20","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1145\/279227.279229","volume":"16","author":"L. Lamport","year":"1998","unstructured":"Lamport, L.: The Part-Time Parliament. ACM Transactions On Computer Systems\u00a016(2), 133\u2013169 (1998)","journal-title":"ACM Transactions On Computer Systems"},{"issue":"5","key":"47_CR21","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","LATIN 2006: Theoretical Informatics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11682462_47","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,12]],"date-time":"2019-03-12T02:44:08Z","timestamp":1552358648000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11682462_47"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540327554","9783540327561"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/11682462_47","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}