{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:19:00Z","timestamp":1759637940804,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":30,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642258725"},{"type":"electronic","value":"9783642258732"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"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":[[2011]]},"DOI":"10.1007\/978-3-642-25873-2_13","type":"book-chapter","created":{"date-parts":[[2011,12,8]],"date-time":"2011-12-08T15:16:34Z","timestamp":1323357394000},"page":"175-190","source":"Crossref","is-referenced-by-count":4,"title":["Anonymous Agreement: The Janus Algorithm"],"prefix":"10.1007","author":[{"given":"Zohir","family":"Bouzid","sequence":"first","affiliation":[]},{"given":"Pierre","family":"Sutra","sequence":"additional","affiliation":[]},{"given":"Corentin","family":"Travers","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"13_CR1","doi-asserted-by":"crossref","unstructured":"Abrahamson, K.: On achieving consensus using a shared memory. In: Proc. of the 17th Symp. on Principles of Distributed Computing (PODC), pp. 291\u2013302. ACM (1988)","DOI":"10.1145\/62546.62594"},{"issue":"4","key":"13_CR2","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1007\/s00446-005-0138-3","volume":"18","author":"D. Angluin","year":"2006","unstructured":"Angluin, D., Aspnes, J., Diamadi, Z., Fischer, M.J., Peralta, R.: Computation in networks of passively mobile finite-state sensors. Distributed Computing\u00a018(4), 235\u2013253 (2006)","journal-title":"Distributed Computing"},{"key":"13_CR3","doi-asserted-by":"crossref","unstructured":"Aspnes, J.: A modular approach to shared-memory consensus, with applications to the probabilistic-write model. In: Proc. of the 29th Symp. on Principles of Distributed Computing (PODC), pp. 460\u2013467. ACM (2010)","DOI":"10.1145\/1835698.1835802"},{"key":"13_CR4","doi-asserted-by":"crossref","unstructured":"Aspnes, J., Ellen, F.: Tight bounds for anonymous adopt-commit objects. In: Proc. of the 23rd Symp. on Parallelism in Algorithms and Architectures (SPAA), pp. 317\u2013324. ACM (2011)","DOI":"10.1145\/1989493.1989548"},{"key":"13_CR5","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. Comput.\u00a0173, 162\u2013183 (2002)","journal-title":"Inf. Comput."},{"key":"13_CR6","doi-asserted-by":"crossref","unstructured":"Ben-Or, M.: Another advantage of free choice: Completely asynchronous agreement protocols (extended abstract). In: Proc. of the 2nd Symp. on Principles of Distributed Computing (PODC), pp. 27\u201330. ACM (1983)","DOI":"10.1145\/800221.806707"},{"key":"13_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"341","DOI":"10.1007\/978-3-642-04355-0_35","volume-title":"Distributed Computing","author":"F. Bonnet","year":"2009","unstructured":"Bonnet, F., Raynal, M.: The Price of Anonymity: Optimal Consensus Despite Asynchrony, Crash and Anonymity. In: Keidar, I. (ed.) DISC 2009. LNCS, vol.\u00a05805, pp. 341\u2013355. Springer, Heidelberg (2009)"},{"key":"13_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"206","DOI":"10.1007\/978-3-642-15763-9_22","volume-title":"Distributed Computing","author":"F. Bonnet","year":"2010","unstructured":"Bonnet, F., Raynal, M.: Anonymous Asynchronous Systems: The Case of Failure Detectors. In: Lynch, N.A., Shvartsman, A.A. (eds.) DISC 2010. LNCS, vol.\u00a06343, pp. 206\u2013220. Springer, Heidelberg (2010)"},{"key":"13_CR9","unstructured":"Bouzid, Z., Sutra, P., Travers, C.: Anonymous Agreement: The Janus Algorithm. Technical report, http:\/\/hal.inria.fr\/inria-00625704\/en\/"},{"issue":"3","key":"13_CR10","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., Vit\u00e1nyi, P.M.B.: On the importance of having an identity or, is consensus really universal? Distributed Computing\u00a018(3), 167\u2013176 (2006)","journal-title":"Distributed Computing"},{"issue":"4","key":"13_CR11","doi-asserted-by":"publisher","first-page":"685","DOI":"10.1145\/234533.234549","volume":"43","author":"T.D. Chandra","year":"1996","unstructured":"Chandra, T.D., Hadzilacos, V., Toueg, S.: The weakest failure detector for solving consensus. J. ACM\u00a043(4), 685\u2013722 (1996)","journal-title":"J. ACM"},{"issue":"2","key":"13_CR12","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1145\/226643.226647","volume":"43","author":"T.D. Chandra","year":"1996","unstructured":"Chandra, T.D., Toueg, S.: Unreliable failure detectors for reliable distributed systems. J. ACM\u00a043(2), 225\u2013267 (1996)","journal-title":"J. ACM"},{"key":"13_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"744","DOI":"10.1007\/11596042_77","volume-title":"Embedded and Ubiquitous Computing \u2013 EUC 2005 Workshops","author":"T. Chothia","year":"2005","unstructured":"Chothia, T., Chatzikokolakis, K.: A Survey of Anonymous Peer-to-Peer File-Sharing. In: Enokido, T., Yan, L., Xiao, B., Kim, D.Y., Dai, Y.-S., Yang, L.T. (eds.) EUC-WS 2005. LNCS, vol.\u00a03823, pp. 744\u2013755. Springer, Heidelberg (2005)"},{"key":"13_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1007\/978-3-540-92295-7_31","volume-title":"Distributed Computing and Networking","author":"C. Delporte-Gallet","year":"2008","unstructured":"Delporte-Gallet, C., Fauconnier, H.: Two Consensus Algorithms with Atomic Registers and Failure Detector \u03a9. In: Garg, V., Wattenhofer, R., Kothapalli, K. (eds.) ICDCN 2009. LNCS, vol.\u00a05408, pp. 251\u2013262. Springer, Heidelberg (2008)"},{"key":"13_CR15","doi-asserted-by":"crossref","unstructured":"Delporte-Gallet, C., Fauconnier, H., Guerraoui, R., Kermarrec, A.M., Ruppert, E., Tran-The, H.: Byzantine agreement with homonyms. In: Proc. of the 30th Symp. on Principles of Distributed Computing (PODC), pp. 21\u201330. ACM (2011)","DOI":"10.1145\/1993806.1993810"},{"key":"13_CR16","doi-asserted-by":"crossref","unstructured":"Delporte-Gallet, C., Fauconnier, H., Tielmann, A.: Fault-tolerant consensus in unknown and anonymous networks. In: Proc. of the 29th Int\u2019l Conference on Distributed Computing Systems (ICDCS), pp. 368\u2013375. IEEE (2009)","DOI":"10.1109\/ICDCS.2009.36"},{"issue":"1","key":"13_CR17","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1007\/s00446-005-0124-9","volume":"18","author":"P. Dutta","year":"2005","unstructured":"Dutta, P., Guerraoui, R.: The inherent price of indulgence. Distributed Computing\u00a018(1), 85\u201398 (2005)","journal-title":"Distributed Computing"},{"issue":"2","key":"13_CR18","doi-asserted-by":"publisher","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\u00a035(2), 288\u2013323 (1988)","journal-title":"J. ACM"},{"key":"13_CR19","series-title":"Lecture Notes in Computer Science","volume-title":"Designing Privacy Enhancing Technologies","year":"2001","unstructured":"Federrath, H. (ed.): Designing Privacy Enhancing Technologies. LNCS, vol.\u00a02009. Springer, Heidelberg (2001)"},{"issue":"2","key":"13_CR20","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.: Impossibility of distributed consensus with one faulty process. J. ACM\u00a032(2), 374\u2013382 (1985)","journal-title":"J. ACM"},{"key":"13_CR21","doi-asserted-by":"crossref","unstructured":"Gafni, E.: Round-by-round fault detectors: unifying synchrony and asynchrony. In: Proc. of the 17th Symp. on Principles of Distributed Computing (PODC), pp. 143\u2013152. ACM (1998)","DOI":"10.1145\/277697.277724"},{"key":"13_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"244","DOI":"10.1007\/11561927_19","volume-title":"Distributed Computing","author":"R. Guerraoui","year":"2005","unstructured":"Guerraoui, R., Ruppert, E.: What can be implemented anonymously? In: Fraigniaud, P. (ed.) DISC 2005. LNCS, vol.\u00a03724, pp. 244\u2013259. Springer, Heidelberg (2005)"},{"key":"13_CR23","doi-asserted-by":"crossref","unstructured":"Guerraoui, R., Lynch, N.A.: A general characterization of indulgence. TAAS\u00a03(4) (2008)","DOI":"10.1145\/1452001.1452010"},{"issue":"3","key":"13_CR24","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":"1","key":"13_CR25","doi-asserted-by":"publisher","first-page":"124","DOI":"10.1145\/114005.102808","volume":"13","author":"M. Herlihy","year":"1991","unstructured":"Herlihy, M.: Wait-free synchronization. ACM Trans. Program. Lang. Syst.\u00a013(1), 124\u2013149 (1991)","journal-title":"ACM Trans. Program. Lang. Syst."},{"key":"13_CR26","unstructured":"Herlihy, M., Luchangco, V., Moir, M.: Obstruction-free synchronization: Double-ended queues as an example. In: Proc. of the 23rd Int\u2019l Conference on Distributed Computing Systems (ICDCS), pp. 522\u2013529. IEEE (2003)"},{"issue":"3","key":"13_CR27","doi-asserted-by":"publisher","first-page":"463","DOI":"10.1145\/78969.78972","volume":"12","author":"M. Herlihy","year":"1990","unstructured":"Herlihy, M., Wing, J.: Linearizability: a correcteness condition for concurrent objects. ACM Trans. on Prog. Lang.\u00a012(3), 463\u2013492 (1990)","journal-title":"ACM Trans. on Prog. Lang."},{"key":"13_CR28","first-page":"163","volume":"4","author":"M. Loui","year":"1987","unstructured":"Loui, M., 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":"13_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"386","DOI":"10.1007\/978-3-540-77096-1_28","volume-title":"Principles of Distributed Systems","author":"E. Ruppert","year":"2007","unstructured":"Ruppert, E.: The Anonymous Consensus Hierarchy and Naming Problems. In: Tovar, E., Tsigas, P., Fouchal, H. (eds.) OPODIS 2007. LNCS, vol.\u00a04878, pp. 386\u2013400. Springer, Heidelberg (2007)"},{"issue":"9","key":"13_CR30","doi-asserted-by":"publisher","first-page":"878","DOI":"10.1109\/71.798313","volume":"10","author":"M. Yamashita","year":"1999","unstructured":"Yamashita, M., Kameda, T.: Leader election problem on networks in which processor identity numbers are not distinct. IEEE Transactions on Parallel and Distributed Systems\u00a010(9), 878\u2013887 (1999)","journal-title":"IEEE Transactions on Parallel and Distributed Systems"}],"container-title":["Lecture Notes in Computer Science","Principles of Distributed Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-25873-2_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,15]],"date-time":"2025-03-15T06:07:38Z","timestamp":1742018858000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-25873-2_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642258725","9783642258732"],"references-count":30,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-25873-2_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}