{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T23:39:53Z","timestamp":1743118793994,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":35,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642043543"},{"type":"electronic","value":"9783642043550"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"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":[[2009]]},"DOI":"10.1007\/978-3-642-04355-0_35","type":"book-chapter","created":{"date-parts":[[2009,9,22]],"date-time":"2009-09-22T22:44:15Z","timestamp":1253659455000},"page":"341-355","source":"Crossref","is-referenced-by-count":7,"title":["The Price of Anonymity: Optimal Consensus Despite Asynchrony, Crash and Anonymity"],"prefix":"10.1007","author":[{"given":"Fran\u00e7ois","family":"Bonnet","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michel","family":"Raynal","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"35_CR1","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1016\/S0020-0190(99)00100-3","volume":"71","author":"M.K. Aguilera","year":"1999","unstructured":"Aguilera, M.K., Toueg, S.: A Simple Bivalency Proof that t-Resilient Consensus Requires t\u2009+\u20091 Rounds. Information Processing Letters\u00a071, 155\u2013178 (1999)","journal-title":"Information Processing Letters"},{"key":"35_CR2","first-page":"82","volume-title":"Proc. 12th Symposium on Theory of Computing (STOC 1980)","author":"D. Angluin","year":"1980","unstructured":"Angluin, D.: Local and Global Properties in Networks of Processes. In: Proc. 12th Symposium on Theory of Computing (STOC 1980), pp. 82\u201393. ACM Press, New York (1980)"},{"issue":"2","key":"35_CR3","doi-asserted-by":"publisher","first-page":"162","DOI":"10.1006\/inco.2001.3119","volume":"173","author":"H. Attiya","year":"2002","unstructured":"Attiya, H., Gorbach, A., Moran, S.: Computing in Totally Anonymous Asynchronous Shared Memory Systems. Inf. and Comp.\u00a0173(2), 162\u2013183 (2002)","journal-title":"Inf. and Comp."},{"key":"35_CR4","doi-asserted-by":"crossref","unstructured":"Attiya, H., Welch, J.: Distributed Computing, Fundamentals, Simulation and Advanced Topics, 2nd edn. Wiley Series on Parallel and Distributed Computing, 414 page (2004)","DOI":"10.1002\/0471478210"},{"key":"35_CR5","doi-asserted-by":"crossref","unstructured":"Bonnet, F., Raynal, M.: The Price of Anonymity: Optimal Consensus despite Asynchrony, Crash and Anonymity. Tech. Report, #1918, IRISA, Universit\u00e9 de Rennes (France) (December 2008)","DOI":"10.1007\/978-3-642-04355-0_35"},{"key":"35_CR6","doi-asserted-by":"crossref","unstructured":"Borowsky, E., Gafni, E., Generalized, F.L.P.: Impossibility Results for t-Resilient Asynchronous Computations. In: Proc. 25th ACM Symposium on Theory of Computation (STOC 1993), pp. 91\u2013100 (1993)","DOI":"10.1145\/167088.167119"},{"issue":"3","key":"35_CR7","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1007\/s00446-005-0121-z","volume":"18","author":"H. Buhrman","year":"2006","unstructured":"Buhrman, H., Panconesi, A., Silvestri, R., Vityani, P.: On the Importance of Having an Identity or Is Consensus Really Universal? Distributed Computing\u00a018(3), 167\u2013175 (2006)","journal-title":"Distributed Computing"},{"issue":"2","key":"35_CR8","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1145\/226643.226647","volume":"43","author":"T. Chandra","year":"1996","unstructured":"Chandra, T., Toueg, S.: Unreliable Failure Detectors for Reliable Distributed Systems. Journal of the ACM\u00a043(2), 225\u2013267 (1996)","journal-title":"Journal of the ACM"},{"issue":"4","key":"35_CR9","doi-asserted-by":"publisher","first-page":"685","DOI":"10.1145\/234533.234549","volume":"43","author":"T. Chandra","year":"1996","unstructured":"Chandra, T., Hadzilacos, V., Toueg, S.: The Weakest Failure Detector for Solving Consensus. Journal of the ACM\u00a043(4), 685\u2013722 (1996)","journal-title":"Journal of the ACM"},{"key":"35_CR10","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":"5","key":"35_CR11","doi-asserted-by":"publisher","first-page":"912","DOI":"10.1145\/355483.355489","volume":"47","author":"S. Chaudhuri","year":"2000","unstructured":"Chaudhuri, S., Herlihy, M., Lynch, N., Tuttle, M.: Tight Bounds for k-Set Agreement. Journal of the ACM\u00a047(5), 912\u2013943 (2000)","journal-title":"Journal of the ACM"},{"issue":"9","key":"35_CR12","doi-asserted-by":"publisher","first-page":"909","DOI":"10.1109\/TPDS.2003.1233713","volume":"14","author":"C. Delporte-Gallet","year":"2003","unstructured":"Delporte-Gallet, C., Fauconnier, H., Helary, J.-M., Raynal, M.: Early Stopping in Global Data Computation. IEEE Transactions Parallel Distributed Systems\u00a014(9), 909\u2013921 (2003)","journal-title":"IEEE Transactions Parallel Distributed Systems"},{"issue":"4","key":"35_CR13","doi-asserted-by":"publisher","first-page":"720","DOI":"10.1145\/96559.96565","volume":"37","author":"D. Dolev","year":"1990","unstructured":"Dolev, D., Reischuk, R., Strong, R.: Early Stopping in Byzantine Agreement. Journal of the ACM\u00a037(4), 720\u2013741 (1990)","journal-title":"Journal of the ACM"},{"issue":"2","key":"35_CR14","doi-asserted-by":"publisher","first-page":"156","DOI":"10.1016\/0890-5401(90)90014-9","volume":"88","author":"C. Dwork","year":"1990","unstructured":"Dwork, C., Moses, Y.: Knowledge and Common Knowledge in a Byzantine Environment: Crash Failures. Information and Computation\u00a088(2), 156\u2013186 (1990)","journal-title":"Information and Computation"},{"issue":"4","key":"35_CR15","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1016\/0020-0190(82)90033-3","volume":"14","author":"M.J. Fischer","year":"1982","unstructured":"Fischer, M.J., Lynch, N.A.: A Lower Bound on the Time to Assure Interactive Consistency. Information Processing Letters\u00a014(4), 183\u2013186 (1982)","journal-title":"Information Processing Letters"},{"issue":"2","key":"35_CR16","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":"35_CR17","first-page":"143","volume-title":"Proc. 17th ACM Symposium on Principles of Distributed Computing (PODC 2000)","author":"E. Gafni","year":"1998","unstructured":"Gafni, E.: Round-by-round Fault Detectors: Unifying Synchrony and Asynchrony. In: Proc. 17th ACM Symposium on Principles of Distributed Computing (PODC 2000), pp. 143\u2013152. ACM Press, New York (1998)"},{"issue":"3","key":"35_CR18","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1007\/s00446-007-0042-0","volume":"20","author":"R. Guerraoui","year":"2007","unstructured":"Guerraoui, R., Ruppert, E.: Anonymous and Fault-tolerant Shared Memory Computing. Distributed Computing\u00a020(3), 165\u2013177 (2007)","journal-title":"Distributed Computing"},{"issue":"3","key":"35_CR19","doi-asserted-by":"publisher","first-page":"549","DOI":"10.1145\/79147.79161","volume":"37","author":"J.Y. Halpern","year":"1990","unstructured":"Halpern, J.Y., Moses, Y.: Knowledge and Common Knowledge in a Distributed Environment. Journal of the ACM\u00a037(3), 549\u2013587 (1990)","journal-title":"Journal of the ACM"},{"issue":"9","key":"35_CR20","doi-asserted-by":"publisher","first-page":"897","DOI":"10.1109\/71.879773","volume":"11","author":"J.-M. H\u00e9lary","year":"2000","unstructured":"H\u00e9lary, J.-M., Hurfin, M., Mostefaoui, A., Raynal, M., Tronel, F.: Computing Global Functions in Asynchronous Distributed Systems with Perfect Failure Detectors. IEEE Trans. on Parallel and Distributed Systems\u00a011(9), 897\u2013909 (2000)","journal-title":"IEEE Trans. on Parallel and Distributed Systems"},{"issue":"1","key":"35_CR21","doi-asserted-by":"publisher","first-page":"124","DOI":"10.1145\/114005.102808","volume":"13","author":"M.P. Herlihy","year":"1991","unstructured":"Herlihy, M.P.: Wait-Free Synchronization. ACM Transactions on Programming Languages and Systems\u00a013(1), 124\u2013149 (1991)","journal-title":"ACM Transactions on Programming Languages and Systems"},{"issue":"6","key":"35_CR22","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":"35_CR23","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1016\/S0020-0190(02)00333-2","volume":"85","author":"I. Keidar","year":"2003","unstructured":"Keidar, I., Rajsbaum, S.: A Simple Proof of the Uniform Consensus Synchronous Lower Bound. Information Processing Letters\u00a085, 47\u201352 (2003)","journal-title":"Information Processing Letters"},{"key":"35_CR24","first-page":"163","volume":"4","author":"M.C. Loui","year":"1987","unstructured":"Loui, M.C., Abu-Amara, H.: Memory Requirements for Agreement Among Unreliable Asynchronous Processes. Advances in Computing research\u00a04, 163\u2013183 (1987)","journal-title":"Advances in Computing research"},{"key":"35_CR25","first-page":"872","volume-title":"Distributed Algorithms","author":"N.A. Lynch","year":"1996","unstructured":"Lynch, N.A.: Distributed Algorithms, 872 pages. Morgan Kaufmann, San Francisco (1996)"},{"issue":"4","key":"35_CR26","doi-asserted-by":"publisher","first-page":"400","DOI":"10.1016\/j.jpdc.2009.01.001","volume":"69","author":"Y. Moses","year":"2009","unstructured":"Moses, Y., Raynal, M.: Revisiting Simultaneous Consensus with Crash Failures. Journal of Parallel and Distributed Computing\u00a069(4), 400\u2013409 (2009)","journal-title":"Journal of Parallel and Distributed Computing"},{"key":"35_CR27","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1007\/BF01762112","volume":"3","author":"Y. Moses","year":"1988","unstructured":"Moses, Y., Tuttle, M.R.: Programming Simultaneous Actions Using Common Knowledge. Algorithmica\u00a03, 121\u2013169 (1988)","journal-title":"Algorithmica"},{"issue":"3","key":"35_CR28","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1007\/s00446-008-0064-2","volume":"21","author":"A. Mostefaoui","year":"2008","unstructured":"Mostefaoui, A., Rajsbaum, S., Raynal, M., Travers, C.: On the Computability Power and the Robustness of Set Agreement-oriented Failure Detector Classes. Distributed Computing\u00a021(3), 201\u2013222 (2008)","journal-title":"Distributed Computing"},{"key":"35_CR29","doi-asserted-by":"crossref","unstructured":"Mostefaoui, A., Rajsbaum, S., Raynal, M., Travers, C.: The Combined Power of Conditions and Information on Failures to Solve Asynchronous Set Agreement. SIAM Journal of Computing\u00a038(4), 1574\u20131601 (2008)","DOI":"10.1137\/050645580"},{"issue":"1","key":"35_CR30","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1142\/S0129626401000452","volume":"11","author":"A. Mostefaoui","year":"2001","unstructured":"Mostefaoui, A., Raynal, M.: Leader-Based Consensus. Parallel Processing Letters\u00a011(1), 95\u2013107 (2001)","journal-title":"Parallel Processing Letters"},{"issue":"3","key":"35_CR31","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1007\/s004460050045","volume":"11","author":"A. Panconesi","year":"1998","unstructured":"Panconesi, A., Papatriantafilou, M., Tsigas, P., Vityani, P.: Randomized Naming Using Wait-free Shared Variables. Distributed Computing\u00a011(3), 113\u2013124 (1998)","journal-title":"Distributed Computing"},{"key":"35_CR32","first-page":"221","volume-title":"Proc. 9th IEEE Pacific Rim Int\u2019l Symposium on Dependable Computing (PRDC 2002)","author":"M. Raynal","year":"2002","unstructured":"Raynal, M.: Consensus in Synchronous Systems: a Concise Guided Tour. In: Proc. 9th IEEE Pacific Rim Int\u2019l Symposium on Dependable Computing (PRDC 2002), pp. 221\u2013228. IEEE Computer Society Press, Los Alamitos (2002)"},{"issue":"5","key":"35_CR33","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"},{"issue":"1","key":"35_CR34","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1109\/71.481599","volume":"7","author":"M. Yamashita","year":"1996","unstructured":"Yamashita, M., Kameda, T.: Computing on Anonymous Networks: Part I -Characterizing the Solvable Cases. IEEE Transactions on Parallel Distributed Systems\u00a07(1), 69\u201389 (1996)","journal-title":"IEEE Transactions on Parallel Distributed Systems"},{"issue":"1","key":"35_CR35","doi-asserted-by":"publisher","first-page":"90","DOI":"10.1109\/71.481600","volume":"7","author":"M. Yamashita","year":"1996","unstructured":"Yamashita, M., Kameda, T.: Computing on Anonymous Networks: Part II -Decision and Membership Problems. IEEE Transactions on Parallel Distributed Systems\u00a07(1), 90\u201396 (1996)","journal-title":"IEEE Transactions on Parallel Distributed Systems"}],"container-title":["Lecture Notes in Computer Science","Distributed Computing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-04355-0_35","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,22]],"date-time":"2019-05-22T15:44:16Z","timestamp":1558539856000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-04355-0_35"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642043543","9783642043550"],"references-count":35,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-04355-0_35","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}