{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,19]],"date-time":"2025-03-19T10:43:01Z","timestamp":1742380981170},"reference-count":22,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2005,3,10]],"date-time":"2005-03-10T00:00:00Z","timestamp":1110412800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Distrib. Comput."],"published-print":{"date-parts":[[2006,2]]},"DOI":"10.1007\/s00446-005-0121-z","type":"journal-article","created":{"date-parts":[[2005,3,9]],"date-time":"2005-03-09T09:08:40Z","timestamp":1110359320000},"page":"167-176","source":"Crossref","is-referenced-by-count":29,"title":["On the importance of having an identity or, is consensus really universal?"],"prefix":"10.1007","volume":"18","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":"Vitanyi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,3,10]]},"reference":[{"key":"121_CR1","doi-asserted-by":"crossref","unstructured":"Aspnes J: Time- and space-efficient randomized consensus. J Algorithms 14(3):414-431 (1993)","DOI":"10.1006\/jagm.1993.1022"},{"key":"121_CR2","doi-asserted-by":"crossref","unstructured":"Aspnes J: Lower bounds for distributed coin-flipping and randomized consensus. J Assoc Comput Machin 45(3):415-450 (1998)","DOI":"10.1145\/278298.278304"},{"key":"121_CR3","doi-asserted-by":"crossref","unstructured":"Aspnes J, Herlihy M: Fast randomized consensus using shared memory, J Algorithms 11(3):441-461 (1990)","DOI":"10.1016\/0196-6774(90)90021-6"},{"key":"121_CR4","doi-asserted-by":"crossref","unstructured":"Aspnes J, Waarts O: Randomized consensus in O(n log n) operations per processor. SIAM J Comput 25(5):1024-1044 (1996)","DOI":"10.1137\/S0097539792240881"},{"key":"121_CR5","doi-asserted-by":"crossref","unstructured":"Attiya A, Gorbach \u2663, Moran S: Computing in totally anonymous shared memory systems, DISC 98. LNCS 1499, pp. 49\u201361","DOI":"10.1007\/BFb0056473"},{"key":"121_CR6","unstructured":"Attiya H, Welch EJ: Distributed Computing, McGraw-Hill"},{"key":"121_CR7","doi-asserted-by":"crossref","unstructured":"Aumann Y: Efficient Asynchronous Consensus with the Weak Adversary Scheduler, In: Proceedings of the 16th ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing (PODC 1997), pp. 209-218","DOI":"10.1145\/259380.259441"},{"key":"121_CR8","doi-asserted-by":"crossref","unstructured":"Bar-Noy A, Dolev D: 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-318","DOI":"10.1145\/72981.73003"},{"key":"121_CR9","doi-asserted-by":"crossref","unstructured":"Borowsky E, Gafni E: Immediate Atomic Snapshots and Fast Renaming. In: Proceedings of the 12th ACM Symposium on Principles of Distributed Computing, 1993, pp. 41-52","DOI":"10.1145\/164051.164056"},{"key":"121_CR10","doi-asserted-by":"crossref","unstructured":"Chandra TD: 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"},{"key":"121_CR11","doi-asserted-by":"crossref","unstructured":"Chandra TD, Hadzilacos V, Toueg S: The weakest failure detector for solving Consensus. J ACM 43(4):685-722 (1996)","DOI":"10.1145\/234533.234549"},{"key":"121_CR12","doi-asserted-by":"crossref","unstructured":"Chandra TD, Toueg S: Unreliable failure detectors for reliable distributed systems. J ACM 43(2):225-267 (1996)","DOI":"10.1145\/226643.226647"},{"key":"121_CR13","doi-asserted-by":"crossref","unstructured":"Herlihy M: Wait-Free Synchronization. Preliminary version in Proceedings of the 7th ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing (PODC 1988)","DOI":"10.1145\/114005.102808"},{"key":"121_CR14","doi-asserted-by":"crossref","unstructured":"Herlihy M, Shavit N: The Asynchronous Computability Theorem for t-Resilient Tasks. In: Proc. 25th ACM Symp. Theory of Computing, 1993, pp. 111-120","DOI":"10.1145\/167088.167125"},{"key":"121_CR15","doi-asserted-by":"crossref","unstructured":"Jayanti P: Robust wait-free hierarchies. J ACM 44(4):592-614 (1997)","DOI":"10.1145\/263867.263888"},{"key":"121_CR16","doi-asserted-by":"crossref","unstructured":"Jayanti P, Toueg S: Wake-up under read\/write atomicity, WDAG 1990, LNCS 486, pp. 277-288","DOI":"10.1007\/3-540-54099-7_19"},{"key":"121_CR17","doi-asserted-by":"crossref","unstructured":"Kutten S, Ostrovsky R, Patt-Shamir B: The Las-Vegas Processor Identity Problem (How and When to Be Unique). Proceedings of the 1st Israel Symposium on Theory of Computing and Systems, 1993","DOI":"10.1109\/ISTCS.1993.253474"},{"key":"121_CR18","doi-asserted-by":"crossref","unstructured":"Lipton RJ, Park A: Solving the processor identity problem in O(n) space. Inform Process Lett 36, 91-94 (1990)","DOI":"10.1016\/0020-0190(90)90103-5"},{"key":"121_CR19","doi-asserted-by":"crossref","unstructured":"Wai-Kau Lo, Hadzilacos V: 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-295","DOI":"10.1007\/BFb0020440"},{"key":"121_CR20","unstructured":"Lynch N: Distributed Algorithms, Morgan Kaufmann"},{"key":"121_CR21","doi-asserted-by":"crossref","unstructured":"Panconesi A, Papatriantafilou M, Tsigas P, Vitanyi P: Randomized naming using wait-free shared variables. Distrib Comput 11:113-124 (1998)","DOI":"10.1007\/s004460050045"},{"key":"121_CR22","doi-asserted-by":"crossref","unstructured":"Pogosyants A, Segala R, Lynch N: 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":["Distributed Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00446-005-0121-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00446-005-0121-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00446-005-0121-z","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,6]],"date-time":"2020-04-06T07:51:11Z","timestamp":1586159471000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00446-005-0121-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005,3,10]]},"references-count":22,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2006,2]]}},"alternative-id":["121"],"URL":"https:\/\/doi.org\/10.1007\/s00446-005-0121-z","relation":{},"ISSN":["0178-2770","1432-0452"],"issn-type":[{"value":"0178-2770","type":"print"},{"value":"1432-0452","type":"electronic"}],"subject":[],"published":{"date-parts":[[2005,3,10]]}}}