{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T14:32:35Z","timestamp":1742913155042,"version":"3.40.3"},"publisher-location":"Cham","reference-count":68,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031744976"},{"type":"electronic","value":"9783031744983"}],"license":[{"start":{"date-parts":[[2024,10,20]],"date-time":"2024-10-20T00:00:00Z","timestamp":1729382400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,10,20]],"date-time":"2024-10-20T00:00:00Z","timestamp":1729382400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2025]]},"DOI":"10.1007\/978-3-031-74498-3_1","type":"book-chapter","created":{"date-parts":[[2024,10,19]],"date-time":"2024-10-19T11:02:30Z","timestamp":1729335750000},"page":"3-19","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["On Distributed Computing: A View, Physical Versus Logical Objects, and\u00a0a\u00a0Look at\u00a0Fully Anonymous Systems"],"prefix":"10.1007","author":[{"given":"Michel","family":"Raynal","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,10,20]]},"reference":[{"issue":"4","key":"1_CR1","doi-asserted-by":"publisher","first-page":"873","DOI":"10.1145\/153724.153741","volume":"40","author":"Y Afek","year":"1993","unstructured":"Afek, Y., Attiya, H., Dolev, D., Gafni, E., Merritt, M., Shavit, N.: Atomic snapshots of shared memory. J. ACM 40(4), 873\u2013890 (1993)","journal-title":"J. ACM"},{"key":"1_CR2","doi-asserted-by":"crossref","unstructured":"Angluin D., Local and global properties in networks of processes. In: Proceedings 12th Symposium on Theory of Computing (STOC\u201980), pp. 82\u201393. ACM Press (1980)","DOI":"10.1145\/800141.804655"},{"key":"1_CR3","doi-asserted-by":"crossref","unstructured":"Apt, K.R., Hoare, C.A.R. (eds.): Edsger Wybe Dijkstra: his life, work, and legacy. In: Association for Computing Machinery, p 550. Morgan and Claypool Publishers (2022)","DOI":"10.1145\/3544585"},{"key":"1_CR4","first-page":"22","volume":"132","author":"A Auvolat","year":"2020","unstructured":"Auvolat, A., Frey, D., Raynal, M., Ta\u00efani, F.: Money transfer made simple: a specification, a generic algorithm, and its proof. Electron. Bull. EATCS (European Association of Theoretical Computer Science) 132, 22\u201343 (2020)","journal-title":"Electron. Bull. EATCS (European Association of Theoretical Computer Science)"},{"key":"1_CR5","doi-asserted-by":"crossref","unstructured":"Ben-Or, M.: Another advantage of free choice: completely asynchronous agreement protocols. In: Proceedings of 2nd ACM Symposium on Principles of Distributed Computing (PODC\u201983), pp.\u00a027\u201330. ACM Press(1983)","DOI":"10.1145\/800221.806707"},{"key":"1_CR6","unstructured":"Berry, G.: Talks at Coll\u00e8ge de France (2012\u20132019)"},{"issue":"4","key":"1_CR7","doi-asserted-by":"publisher","first-page":"824","DOI":"10.1145\/4221.214134","volume":"32","author":"G Bracha","year":"1985","unstructured":"Bracha, G., Toueg, S.: Asynchronous consensus and broadcast protocols. J. ACM 32(4), 824\u2013840 (1985)","journal-title":"J. ACM"},{"key":"1_CR8","doi-asserted-by":"crossref","unstructured":"Brinch Hansen, P.: (ed.) The Origin of Concurrent Programming, p. 534. Springer (2002)","DOI":"10.1007\/978-1-4757-3472-0"},{"key":"1_CR9","doi-asserted-by":"crossref","unstructured":"Casta\u00f1eda A., Rajsbaum S., Raynal M.: Unifying concurrent objects and distributed tasks: Interval-linearizability. J. ACM 65(6), 42, Article 45 (2018)","DOI":"10.1145\/3266457"},{"issue":"1","key":"1_CR10","doi-asserted-by":"publisher","first-page":"60","DOI":"10.1145\/3546826","volume":"66","author":"A Casta\u00f1eda","year":"2023","unstructured":"Casta\u00f1eda, A., Rajsbaum, S., Raynal, M.: A linearizability-based hierarchy for concurrent specifications. Commun. ACM 66(1), 60\u201371 (2023)","journal-title":"Commun. ACM"},{"issue":"2","key":"1_CR11","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1007\/s00446-022-00440-y","volume":"36","author":"A Casta\u00f1eda","year":"2023","unstructured":"Casta\u00f1eda, A., Rajsbaum, S., Raynal, M.: Set-linearizable implementations from read\/write operations: sets, fetch & increment, stacks and queues with multiplicity. Distrib. Comput. 36(2), 89\u2013106 (2023)","journal-title":"Distrib. Comput."},{"key":"1_CR12","doi-asserted-by":"crossref","unstructured":"Censor-Hillel, K., Petrank, E., Timnat, S.: Help! In: Proceedings of 34th ACM Symposium on Principles of Distributed Computing (PODC\u201915), pp. 241\u2013250. ACM Press (2015)","DOI":"10.1145\/2767386.2767415"},{"issue":"4","key":"1_CR13","doi-asserted-by":"publisher","first-page":"685","DOI":"10.1145\/234533.234549","volume":"43","author":"TD Chandra","year":"1996","unstructured":"Chandra, T.D., Hadzilacos, V., Toueg, S.: The weakest failure detector for solving consensus. J. ACM 43(4), 685\u2013722 (1996)","journal-title":"J. ACM"},{"issue":"2","key":"1_CR14","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. J. ACM 43(2), 225\u2013267 (1996)","journal-title":"J. ACM"},{"key":"1_CR15","doi-asserted-by":"crossref","unstructured":"Charron-Bost, Schiper A.: Computing in distributed systems with benign faults. The heard-of model. Distrib. Comput. 22, 49\u201371 (2009)","DOI":"10.1007\/s00446-009-0084-6"},{"key":"1_CR16","doi-asserted-by":"crossref","unstructured":"Collins, D., Guerraoui, R., Komatovic, J., Monti, M., Xygkis, A., Pavlovic, M., Kuznetsov, P., Pignolet, Y.-A., Seredinschi, D.A., Tonlikh, A.: Online payments by merely broadcasting messages. In: Proceedings 50th IEEE\/IFIP International Conference on Dependable Systems and Networks (DSN\u201920), pp.\u00a026\u201338 (2020)","DOI":"10.1109\/DSN48063.2020.00023"},{"issue":"5","key":"1_CR17","doi-asserted-by":"publisher","first-page":"667","DOI":"10.1145\/362759.362813","volume":"14","author":"PJ Courtois","year":"1971","unstructured":"Courtois, P.J., Heymans, F., Parnas, D.L.: Concurrent control with readers and writers. Commun. ACM 14(5), 667\u2013668 (1971)","journal-title":"Commun. ACM"},{"key":"1_CR18","doi-asserted-by":"publisher","first-page":"492","DOI":"10.1016\/j.jpdc.2004.11.008","volume":"65","author":"C Delporte-Gallet","year":"2005","unstructured":"Delporte-Gallet, C., Fauconnier, H., Guerraoui, R., Kouznetsov, P.: Mutual exclusion in asynchronous systems with failure detectors. J. Parallel Distrib. Comput. 65, 492\u2013505 (2005)","journal-title":"J. Parallel Distrib. Comput."},{"key":"1_CR19","doi-asserted-by":"publisher","first-page":"110","DOI":"10.1016\/j.jpdc.2021.03.015","volume":"153","author":"C Delporte-Gallet","year":"2021","unstructured":"Delporte-Gallet, C., Fauconnier, H., Raynal, M.: On the weakest information on failures to solve mutual exclusion and consensus in asynchronous crash prone read\/write systems. J. Parallel Distrib. Comput. 153, 110\u2013118 (2021)","journal-title":"J. Parallel Distrib. Comput."},{"key":"1_CR20","unstructured":"Dijkstra, E.W.: Over de sequentialiteit van procesbeschrijvingen (on the nature of sequential processes). In: EW Dijkstra Archive (EWD-35), Center for American History, University of Texas at Austin (Translation by Martien van der Burgt and Heather Lawrence) (1962)"},{"issue":"9","key":"1_CR21","doi-asserted-by":"publisher","first-page":"569","DOI":"10.1145\/365559.365617","volume":"8","author":"EW Dijkstra","year":"1965","unstructured":"Dijkstra, E.W.: Solution of a problem in concurrent programming control. Commun. ACM 8(9), 569 (1965)","journal-title":"Commun. ACM"},{"key":"1_CR22","doi-asserted-by":"crossref","unstructured":"Dijkstra, E.W.: Cooperating sequential processes. In: Genuys, F. (ed.) Programming Languages, pp. 43\u2013112 . Academic Press (1968)","DOI":"10.1007\/978-1-4757-3472-0_2"},{"issue":"1","key":"1_CR23","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1007\/BF00289519","volume":"1","author":"EW Dijkstra","year":"1971","unstructured":"Dijkstra, E.W.: Hierarchical ordering of sequential processes. Acta Informatica 1(1), 115\u2013138 (1971)","journal-title":"Acta Informatica"},{"key":"1_CR24","doi-asserted-by":"publisher","first-page":"453","DOI":"10.1145\/360933.360975","volume":"8","author":"EW Dijkstra","year":"1975","unstructured":"Dijkstra, E.W.: Guarded commands, non-determinacy and formal derivation of programs. Commun. ACM 8, 453\u2013457 (1975)","journal-title":"Commun. ACM"},{"key":"1_CR25","unstructured":"Dijkstra, E.W., Dahl, O.-J., Hoare, C.A.R.: Structured Programming, p. 220. Academic Press (1972)"},{"issue":"1","key":"1_CR26","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1145\/7531.7533","volume":"34","author":"D Dolev","year":"1987","unstructured":"Dolev, D., Dwork, C., Stockmeyer, L.: On the minimal synchronism needed for distributed consensus. J. ACM 34(1), 77\u201397 (1987)","journal-title":"J. ACM"},{"issue":"2","key":"1_CR27","doi-asserted-by":"publisher","first-page":"374","DOI":"10.1145\/3149.214121","volume":"32","author":"MJ Fischer","year":"1985","unstructured":"Fischer, M.J., Lynch, N.A., Paterson, M.S.: Impossibility of distributed consensus with one faulty process. J. ACM 32(2), 374\u2013382 (1985)","journal-title":"J. ACM"},{"key":"1_CR28","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s00446-021-00399-2","volume":"35","author":"R Guerraoui","year":"2022","unstructured":"Guerraoui, R., Kuznetsov, P., Monti, M., Pavlovic, M., Seredinschi, D.A.: The consensus number of a cryptocurrency. Distrib. Comput. 35, 1\u201315 (2022)","journal-title":"Distrib. Comput."},{"key":"1_CR29","unstructured":"Harel, D., Feldman, Y.: Algorithmics: The Spirit of Computing, third edition, p. 572. Springer (2012)"},{"issue":"1","key":"1_CR30","doi-asserted-by":"publisher","first-page":"124","DOI":"10.1145\/114005.102808","volume":"13","author":"MP Herlihy","year":"1991","unstructured":"Herlihy, M.P.: Wait-free synchronization. ACM Trans. Program. Lang. Syst. 13(1), 124\u2013149 (1991)","journal-title":"ACM Trans. Program. Lang. Syst."},{"key":"1_CR31","unstructured":"Herlihy, M.P., Luchangco, V., Moir, M.: Obstruction-free synchronization: double-ended queues as an example. In: Proceedings 23th International IEEE Conference on Distributed Computing Systems (ICDCS\u201903), pp. 522\u2013529 . IEEE Press (2003)"},{"issue":"3","key":"1_CR32","doi-asserted-by":"publisher","first-page":"463","DOI":"10.1145\/78969.78972","volume":"12","author":"MP Herlihy","year":"1990","unstructured":"Herlihy, M.P., Wing, J.M.: Linearizability: a correctness condition for concurrent objects. ACM Trans. Program. Lang. Syst. 12(3), 463\u2013492 (1990)","journal-title":"ACM Trans. Program. Lang. Syst."},{"issue":"10","key":"1_CR33","doi-asserted-by":"publisher","first-page":"576","DOI":"10.1145\/363235.363259","volume":"12","author":"CAR Hoare","year":"1969","unstructured":"Hoare, C.A.R.: An axiomatic basis for computer programming. Commun. ACM 12(10), 576\u2013580 (1969)","journal-title":"Commun. ACM"},{"issue":"2","key":"1_CR34","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1109\/MS.1984.234042","volume":"1","author":"CAR Hoare","year":"1984","unstructured":"Hoare, C.A.R.: Programming: sorcery or science? IEEE Softw. 1(2), 5\u201316 (1984)","journal-title":"IEEE Softw."},{"key":"1_CR35","doi-asserted-by":"crossref","unstructured":"Imbs, D., Raynal, M., Taubenfeld, G.: Election in fully anonymous shared memory systems: tight space bounds and algorithms. In: Proceedings 29th International Colloquium on Structural Information and Communication Complexity (SIROCCO\u201922), pp.\u00a0174\u2013190 . Springer LNCS 13298 (2022)","DOI":"10.1007\/978-3-031-09993-9_10"},{"key":"1_CR36","doi-asserted-by":"crossref","unstructured":"Jones, C.B., Misra, J. (eds.): Theories of Programming: The Life and Works of Tony Hoare, p. 430. Association for computing machinery, Morgan & Claypool Publishers (2021)","DOI":"10.1145\/3477355"},{"issue":"8","key":"1_CR37","doi-asserted-by":"publisher","first-page":"453","DOI":"10.1145\/361082.361093","volume":"17","author":"L Lamport","year":"1974","unstructured":"Lamport, L.: A new solution of Dijkstra\u2019s concurrent programming problem. Commun. ACM 17(8), 453\u2013455 (1974)","journal-title":"Commun. ACM"},{"issue":"11","key":"1_CR38","doi-asserted-by":"publisher","first-page":"806","DOI":"10.1145\/359863.359878","volume":"20","author":"L Lamport","year":"1977","unstructured":"Lamport, L.: Concurrent reading and writing. Commun. ACM 20(11), 806\u2013811 (1977)","journal-title":"Commun. ACM"},{"issue":"7","key":"1_CR39","doi-asserted-by":"publisher","first-page":"558","DOI":"10.1145\/359545.359563","volume":"21","author":"L Lamport","year":"1978","unstructured":"Lamport, L.: Time, clocks, and the ordering of events in a distributed system. Commun. ACM 21(7), 558\u2013565 (1978)","journal-title":"Commun. ACM"},{"issue":"2","key":"1_CR40","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1007\/BF01786227","volume":"1","author":"L Lamport","year":"1986","unstructured":"Lamport, L.: On inter-process communications, part I: basic formalism. Distrib. Comput. 1(2), 77\u201385 (1986)","journal-title":"Distrib. Comput."},{"issue":"2","key":"1_CR41","doi-asserted-by":"publisher","first-page":"86","DOI":"10.1007\/BF01786228","volume":"1","author":"L Lamport","year":"1986","unstructured":"Lamport, L.: On inter-process communications, part II: algorithms. Distrib. Comput. 1(2), 86\u2013101 (1986)","journal-title":"Distrib. Comput."},{"issue":"2","key":"1_CR42","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1145\/5383.5384","volume":"33","author":"L Lamport","year":"1986","unstructured":"Lamport, L.: The mutual exclusion problem: part I- a theory of interprocess communication. J. ACM 33(2), 313\u2013326 (1986)","journal-title":"J. ACM"},{"issue":"2","key":"1_CR43","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1145\/5383.5384","volume":"33","author":"L Lamport","year":"1986","unstructured":"Lamport, L.: The mutual exclusion problem: Part II: statement and solutions. J. ACM 33(2), 313\u2013326 (1986)","journal-title":"J. ACM"},{"issue":"6","key":"1_CR44","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1145\/2771951","volume":"58","author":"L Lamport","year":"2015","unstructured":"Lamport, L.: The computer science of concurrency: the early years (Turing lecture). Commun. ACM 58(6), 71\u201376 (2015)","journal-title":"Commun. ACM"},{"issue":"9","key":"1_CR45","doi-asserted-by":"publisher","first-page":"58","DOI":"10.1145\/3513259","volume":"65","author":"L Lamport","year":"2022","unstructured":"Lamport, L.: Deconstructing the Bakery to build a distributed state machine. Commun. ACM 65(9), 58\u201366 (2022)","journal-title":"Commun. ACM"},{"issue":"3","key":"1_CR46","doi-asserted-by":"publisher","first-page":"382","DOI":"10.1145\/357172.357176","volume":"4","author":"L Lamport","year":"1982","unstructured":"Lamport, L., Shostak, R., Pease, S.: The Byzantine generals problem. ACM Trans. Program. Lang. Syst. 4(3), 382\u2013401 (1982)","journal-title":"ACM Trans. Program. Lang. Syst."},{"key":"1_CR47","unstructured":"Lewis, H.R., Papadimitriou, C.H.: Elements of the Theory of Computation, p. 361. Prentice Hall Int. Editions (1998)"},{"key":"1_CR48","doi-asserted-by":"crossref","unstructured":"Lo, W.K., Hadzilacos, V.: Using failure detectors to solve consensus in asynchronous shared memory systems. In: Proceedings 8th International Workshop on Distributed Algorithms (WDAG\u201994), pp. 280\u2013295. Springer LNCS 857 (1994)","DOI":"10.1007\/BFb0020440"},{"key":"1_CR49","unstructured":"Loui, M., Abu-Amara, H.: Memory requirements for agreement among unreliable asynchronous processes. Adv. Comput. Res. 4, 163\u2013183. JAI Press Inc. (1987)"},{"key":"1_CR50","doi-asserted-by":"crossref","unstructured":"Malkhi, D. (ed.): Concurrency: The Works of Leslie Lamport, p. 345. Association for Computing Machinery, Morgan & Claypool Publishers (2019)","DOI":"10.1145\/3335772"},{"key":"1_CR51","doi-asserted-by":"crossref","unstructured":"Most\u00e9faoui, A., Moumen, H., Raynal, M.: Signature-free asynchronous binary Byzantine consensus with $$t<n\/3$$, $$O(n^2)$$ messages, and $$O(1)$$ expected time. J. ACM 62(4), 21, Article 31 (2015)","DOI":"10.1145\/2785953"},{"key":"1_CR52","unstructured":"Most\u00e9faoui, A., Perrin, M., Raynal, M.: Send\/receive patterns versus read\/write patterns in crash-prone asynchronous distributed systems. In: Proceedings 37th International Symposium on Distributed Computing (DISC\u201923), Lipics, vol. 281, pp. 16:1\u201316:24 (2023)"},{"issue":"6","key":"1_CR53","doi-asserted-by":"publisher","first-page":"922","DOI":"10.1145\/950620.950624","volume":"50","author":"A Most\u00e9faoui","year":"2003","unstructured":"Most\u00e9faoui, A., Rajsbaum, S., Raynal, M.: Conditions on input vectors for consensus solvability in asynchronous distributed systems. J. ACM 50(6), 922\u2013954 (2003)","journal-title":"J. ACM"},{"key":"1_CR54","doi-asserted-by":"publisher","first-page":"228","DOI":"10.1145\/322186.322188","volume":"27","author":"M Pease","year":"1980","unstructured":"Pease, M., Shostak, R., Lamport, L.: Reaching agreement in the presence of faults. J. ACM 27, 228\u2013234 (1980)","journal-title":"J. ACM"},{"key":"1_CR55","doi-asserted-by":"crossref","unstructured":"Perrin, M., Most\u00e9faoui, Raynal, M.: A simple object that spans the whole consensus hierarchy. Parallel Process. Lett. 28(2), 9, 1850006 (2018)","DOI":"10.1142\/S0129626418500068"},{"issue":"3","key":"1_CR56","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1016\/0020-0190(81)90106-X","volume":"12","author":"GL Peterson","year":"1981","unstructured":"Peterson, G.L.: Myths about the mutual exclusion problem. Inf. Process. Lett. 12(3), 115\u2013116 (1981)","journal-title":"Inf. Process. Lett."},{"key":"1_CR57","doi-asserted-by":"publisher","first-page":"46","DOI":"10.1145\/357195.357198","volume":"5","author":"GL Peterson","year":"1983","unstructured":"Peterson, G.L.: Concurrent reading while writing. ACM Trans. Program. Lang. Syst. 5, 46\u201355 (1983)","journal-title":"ACM Trans. Program. Lang. Syst."},{"issue":"1","key":"1_CR58","doi-asserted-by":"publisher","first-page":"78","DOI":"10.1145\/3363823","volume":"63","author":"S Rajsbaum","year":"2020","unstructured":"Rajsbaum, S., Raynal, M.: Mastering concurrent computing through sequential thinking. Commun. ACM 63(1), 78\u201387 (2020)","journal-title":"Commun. ACM"},{"key":"1_CR59","unstructured":"Raynal, M.: Concurrent Programming: Algorithms, Principles and Foundations, p. 515. Springer. ISBN 978-3-642-32026-2 (2013)"},{"key":"1_CR60","doi-asserted-by":"crossref","unstructured":"Raynal, M.: Fault-Tolerant Message-Passing Distributed Systems: An Algorithmic Approach, p. 550. Springer (2018)","DOI":"10.1007\/978-3-319-94141-7"},{"key":"1_CR61","unstructured":"Raynal, M.: Mutual exclusion versus consensus: both sides of the same coin? Bull. EATCS 140, 10 (2023)"},{"key":"1_CR62","doi-asserted-by":"crossref","unstructured":"Raynal, M.: Concurrent crash-prone shared memory systems. In: Synthesis Lectures on Distributed Computing Theory, p. 115. Morgan & Claypool (2023)","DOI":"10.1007\/978-3-031-79213-7"},{"key":"1_CR63","doi-asserted-by":"crossref","unstructured":"Raynal, M., Taubenfeld, G.: Mutual exclusion in fully anonymous shared memory systems. Inf. Process. Lett. 158, 105938, 7 (2020) Corrigendum in Information Processing Letters, vol. 179:106304 (2023)","DOI":"10.1016\/j.ipl.2022.106304"},{"key":"1_CR64","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1016\/j.tcs.2022.03.030","volume":"919","author":"M Raynal","year":"2022","unstructured":"Raynal, M., Taubenfeld, G.: A visit to mutual exclusion in seven dates. Theoret. Comput. Sci. 919, 47\u201365 (2022)","journal-title":"Theoret. Comput. Sci."},{"key":"1_CR65","unstructured":"Taubenfeld, G.: Synchronization Algorithms and Concurrent Programming, p. 423. Pearson Education\/Prentice Hall. ISBN 0-131-97259-6 (2006)"},{"key":"1_CR66","doi-asserted-by":"crossref","unstructured":"Taubenfeld, G.: Concurrent programming, mutual exclusion. Springer Encyclopedia of Algorithms, pp.\u00a0421\u2013425 (2016)","DOI":"10.1007\/978-1-4939-2864-4_88"},{"key":"1_CR67","doi-asserted-by":"crossref","unstructured":"Taubenfeld, G.: Coordination without prior agreement. In: Proceedings 36th ACM Symposium on Principles of Distributed Computing (PODC\u201917), pp.\u00a0325\u2013334. ACM Press (2017)","DOI":"10.1145\/3087801.3087807"},{"key":"1_CR68","doi-asserted-by":"crossref","unstructured":"Taubenfeld, G.: Anonymous shared memory. J. ACM 69(4), 30, Article 24 (2022)","DOI":"10.1145\/3529752"}],"container-title":["Lecture Notes in Computer Science","Stabilization, Safety, and Security of Distributed Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-74498-3_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,12,30]],"date-time":"2024-12-30T22:02:40Z","timestamp":1735596160000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-74498-3_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,10,20]]},"ISBN":["9783031744976","9783031744983"],"references-count":68,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-74498-3_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2024,10,20]]},"assertion":[{"value":"20 October 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"SSS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on Stabilizing, Safety, and Security of Distributed Systems","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Nagoya","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Japan","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20 October 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22 October 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"sss2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/sss2024.github.io\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}