{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:18:29Z","timestamp":1759637909590,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540411437"},{"type":"electronic","value":"9783540400264"}],"license":[{"start":{"date-parts":[[2000,1,1]],"date-time":"2000-01-01T00:00:00Z","timestamp":946684800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2000]]},"DOI":"10.1007\/3-540-40026-5_9","type":"book-chapter","created":{"date-parts":[[2007,6,12]],"date-time":"2007-06-12T19:59:07Z","timestamp":1181678347000},"page":"134-148","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["On the Importance of Having an Identity or, is Consensus really Universal?"],"prefix":"10.1007","author":[{"given":"Harry","family":"Buhrman","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alessandro","family":"Panconesi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Riccardo","family":"Silvestri","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Paul","family":"Vitanyil","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2002,3,15]]},"reference":[{"issue":"3","key":"9_CR1","doi-asserted-by":"crossref","first-page":"414","DOI":"10.1006\/jagm.1993.1022","volume":"14","author":"J. Aspnes","year":"1993","unstructured":"J. Aspnes, Time-and space-efficient randomized consensus. Journal of Algorithms 14(3):414\u2013431, May 1993.","journal-title":"Journal of Algorithms"},{"issue":"3","key":"9_CR2","doi-asserted-by":"crossref","first-page":"415","DOI":"10.1145\/278298.278304","volume":"45","author":"J. Aspnes","year":"1998","unstructured":"J. Aspnes, Lower bounds for distributed coin-flipping and randomized consensus. Journal of the Association for Computing Machinery 45(3):415\u2013450, May 1998.","journal-title":"Journal of the Association for Computing Machinery"},{"issue":"3","key":"9_CR3","doi-asserted-by":"crossref","first-page":"441","DOI":"10.1016\/0196-6774(90)90021-6","volume":"11","author":"J. Aspnes","year":"1990","unstructured":"J. Aspnes and M. Herlihy, Fast randomized consensus using shared memory, Journal of Algorithms 11(3):441\u2013461, September 1990.","journal-title":"Journal of Algorithms"},{"issue":"5","key":"9_CR4","doi-asserted-by":"crossref","first-page":"1024","DOI":"10.1137\/S0097539792240881","volume":"25","author":"J. Aspnes","year":"1996","unstructured":"J. Aspnes and O. Waarts, Randomized consensus in O(n log n) operations per processor, SIAM Journal on Computing 25(5):1024\u20131044, October 1996.","journal-title":"SIAM Journal on Computing"},{"key":"9_CR5","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1007\/BFb0056473","volume-title":"DISC 98","author":"A. Attiya","year":"1998","unstructured":"A. Attiya, Gorbach, S. Moran, Computing in totally anonymous shared memory systems, DISC 98, LNCS 1499, pp. 49\u201361"},{"key":"9_CR6","doi-asserted-by":"crossref","unstructured":"Y. Aumann, Efficient Asynchronous Consensus with the Weak Adversary Scheduler, in Proceedings of the 16th ACM S1GACT-SIGOPS Symposium on Principles of Distributed Computing (PODC 1997), pp. 209\u2013218","DOI":"10.1145\/259380.259441"},{"key":"9_CR7","doi-asserted-by":"crossref","unstructured":"A. Bar-Noy and D. Dolev, Shared Memory vs. Message-passing in an Asynchronous Distributed Environment. In Proceedings of the 8th ACM Symposium on Principles of Distributed Computing, 1989, pp. 307\u2013318.","DOI":"10.1145\/72981.73003"},{"key":"9_CR8","doi-asserted-by":"crossref","unstructured":"E. Borowsky and E. Gafni, Immediate Atomic Snapshots and Fast Renaming. In Proceedings of the 12th ACM Symposium on Principles of Distributed Computing, 1993, pp. 41\u201352.","DOI":"10.1145\/164051.164056"},{"key":"9_CR9","doi-asserted-by":"crossref","unstructured":"T. D. Chandra, Polylog Randomized Wait-Free Consensus, in Proceedings of the 15th ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing (PODC 1996)","DOI":"10.1145\/248052.248083"},{"issue":"4","key":"9_CR10","doi-asserted-by":"crossref","first-page":"685","DOI":"10.1145\/234533.234549","volume":"43","author":"T. D. Chandra","year":"1996","unstructured":"T. D. Chandra, V. Hadzilacos, and S. Toueg. The weakest failure detector for solving Consensus. Journal of the ACM, 43(4):685\u2013722, July 1996.","journal-title":"Journal of the ACM"},{"issue":"2","key":"9_CR11","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1145\/226643.226647","volume":"43","author":"T. D. Chandra","year":"1996","unstructured":"T. D. Chandra and S. Toueg, Unreliable failure detectors for reliable distributed systems. Journal of the ACM, 43(2):225\u2013267, March 1996.","journal-title":"Journal of the ACM"},{"key":"9_CR12","unstructured":"M. Herlihy, Wait-Free Synchronization, preliminary version in Proceedings of the 7th ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing (PODC 1988)"},{"key":"9_CR13","doi-asserted-by":"crossref","unstructured":"M. Herlihy and N. Shavit, The Asynchronous Computability Theorem for t-Resilient Tasks. In Proc. 25th ACM Symp. Theory of Computing, 1993, pp. 111\u2013120.","DOI":"10.1145\/167088.167125"},{"issue":"4","key":"9_CR14","doi-asserted-by":"crossref","first-page":"592","DOI":"10.1145\/263867.263888","volume":"44","author":"P. Jayanti","year":"1997","unstructured":"P. Jayanti, Robust wait-free hierarchies. Journal of the ACM, 44(4):592\u2013614, July 1997.","journal-title":"Journal of the ACM"},{"key":"9_CR15","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"277","DOI":"10.1007\/3-540-54099-7_19","volume-title":"WDAG 1990","author":"P. Jayanti","year":"1991","unstructured":"P. Jayanti and S. Toueg, Wake-up under read\/write atomicity, WDAG 1990, LNCS 486, pp. 277\u2013288."},{"key":"9_CR16","unstructured":"S. Kutten, R. Ostrovsky and B. Patt-Shamir. The Las-Vegas Processor Identity Problem (How and When to Be Uniique), Proceedings of the 1st Israel Symposium on Theory of Computing and Systems, 1993."},{"key":"9_CR17","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1016\/0020-0190(90)90103-5","volume":"36","author":"R.J. Lipton","year":"1990","unstructured":"R.J. Lipton and A. Park, Solving the processor identity problem in O(n) space, Inform. Process. Lett., 36(1990), 91\u201394.","journal-title":"O(n) space, Inform. Process. Lett."},{"key":"9_CR18","doi-asserted-by":"crossref","unstructured":"Wai-Kau Lo and V. Hadzilacos. Using Failure Detectors to Solve Consensus in Asynchronous Shared-Memory Systems, Proceedings of the 8th International Workshop on Distributed Algorithms. Terschelling, The Netherlands, September-October 1994, pp. 280\u2013295.","DOI":"10.1007\/BFb0020440"},{"key":"9_CR19","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1007\/s004460050045","volume":"11","author":"A. Panconesi","year":"1998","unstructured":"A. Panconesi, M. Papatriantafilou, P. Tsigas and P. Vitanyi, Randomized naming using wait-free shared variables. Distributed Computing (1998) 11:113\u2013124","journal-title":"Distributed Computing"},{"key":"9_CR20","doi-asserted-by":"crossref","unstructured":"A. Pogosyants, R. Segal and Nancy Lynch, Verification of the Randomized Consensus Algorithm of Aspnes and Herlihy: a Case Study, MIT Technical Memo number MIT\/LCS\/TM-555, June 1997.","DOI":"10.1007\/BFb0030673"}],"container-title":["Lecture Notes in Computer Science","Distributed Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-40026-5_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,1,8]],"date-time":"2020-01-08T22:49:15Z","timestamp":1578523755000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-40026-5_9"}},"subtitle":["(Extended Abstract)"],"short-title":[],"issued":{"date-parts":[[2000]]},"ISBN":["9783540411437","9783540400264"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/3-540-40026-5_9","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2000]]},"assertion":[{"value":"15 March 2002","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}