{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,5]],"date-time":"2026-01-05T15:06:17Z","timestamp":1767625577261,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":20,"publisher":"ACM","license":[{"start":{"date-parts":[[2022,4,5]],"date-time":"2022-04-05T00:00:00Z","timestamp":1649116800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/100000001","name":"NSF (National Science Foundation)","doi-asserted-by":"publisher","award":["CNS-2107101, CNS-1703560, ACI-1541215"],"award-info":[{"award-number":["CNS-2107101, CNS-1703560, ACI-1541215"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2022,4,5]]},"DOI":"10.1145\/3517209.3524038","type":"proceedings-article","created":{"date-parts":[[2022,3,23]],"date-time":"2022-03-23T16:32:23Z","timestamp":1648053143000},"page":"39-46","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":2,"title":["Ordering operations for generic replicated data types using version trees"],"prefix":"10.1145","author":[{"given":"Nazmus","family":"Saquib","sequence":"first","affiliation":[{"name":"Univ. of California"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chandra","family":"Krintz","sequence":"additional","affiliation":[{"name":"Univ. of California"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rich","family":"Wolski","sequence":"additional","affiliation":[{"name":"Univ. of California"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2022,4,5]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jpdc.2017.08.003"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/2933057.2933090"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-22496-7_3"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0000(89)90034-2"},{"key":"e_1_3_2_1_5_1","unstructured":"Victor Grishchenko. [n. d.]. Causal trees: towards real-time read-write hypertext.  Victor Grishchenko. [n. d.]. Causal trees: towards real-time read-write hypertext."},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/1832772.1832777"},{"key":"e_1_3_2_1_8_1","volume-title":"Victor BF Gomes, and Alastair R Beresford","author":"Kleppmann Martin","year":"2020","unstructured":"Martin Kleppmann , Dominic P Mulligan , Victor BF Gomes, and Alastair R Beresford . 2020 . A highly-available move operation for replicated trees and distributed filesystems. Martin Kleppmann, Dominic P Mulligan, Victor BF Gomes, and Alastair R Beresford. 2020. A highly-available move operation for replicated trees and distributed filesystems."},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"crossref","unstructured":"Leslie Lamport. 2019. Time clocks and the ordering of events in a distributed system. In Concurrency: the Works of Leslie Lamport. 179--196.  Leslie Lamport. 2019. Time clocks and the ordering of events in a distributed system. In Concurrency: the Works of Leslie Lamport. 179--196.","DOI":"10.1145\/3335772.3335934"},{"key":"e_1_3_2_1_10_1","volume-title":"An applicative random-access stack. Information processing letters 17, 5","author":"Myers Eugene W","year":"1983","unstructured":"Eugene W Myers . 1983. An applicative random-access stack. Information processing letters 17, 5 ( 1983 ), 241--248. Eugene W Myers. 1983. An applicative random-access stack. Information processing letters 17, 5 (1983), 241--248."},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/2494266.2494278"},{"key":"e_1_3_2_1_12_1","unstructured":"Diego Ongaro and John Ousterhout. 2014. In search of an understandable consensus algorithm. In 2014 {USENIX} Annual Technical Conference ({USENIX} {ATC} 14). 305--319.  Diego Ongaro and John Ousterhout. 2014. In search of an understandable consensus algorithm. In 2014 { USENIX } Annual Technical Conference ( { USENIX } { ATC } 14). 305--319."},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/1180875.1180916"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-77525-8_185"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDCS.2009.20"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/2166.357218"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jpdc.2010.12.006"},{"key":"e_1_3_2_1_18_1","volume-title":"PEDaLS: Persisting Versioned Data Structures. In 2021 IEEE International Conference on Cloud Engineering (IC2E). IEEE, 179--190","author":"Saquib Nazmus","year":"2021","unstructured":"Nazmus Saquib , Chandra Krintz , and Rich Wolski . 2021 . PEDaLS: Persisting Versioned Data Structures. In 2021 IEEE International Conference on Cloud Engineering (IC2E). IEEE, 179--190 . Nazmus Saquib, Chandra Krintz, and Rich Wolski. 2021. PEDaLS: Persisting Versioned Data Structures. In 2021 IEEE International Conference on Cloud Engineering (IC2E). IEEE, 179--190."},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/6138.6151"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.5555\/2050613.2050642"},{"key":"e_1_3_2_1_22_1","volume-title":"HIDDEN LINE REMOVAL, GRAPHICS, COMPLEXITY).","author":"Swart Garret Frederick","year":"1986","unstructured":"Garret Frederick Swart . 1986. EFFICIENT ALGORITHMS FOR COMPUTING GEOMETRIC INTERSECTIONS (DECISION TREE , HIDDEN LINE REMOVAL, GRAPHICS, COMPLEXITY). ( 1986 ). Garret Frederick Swart. 1986. EFFICIENT ALGORITHMS FOR COMPUTING GEOMETRIC INTERSECTIONS (DECISION TREE, HIDDEN LINE REMOVAL, GRAPHICS, COMPLEXITY). (1986)."}],"event":{"name":"EuroSys '22: Seventeenth European Conference on Computer Systems","sponsor":["SIGOPS ACM Special Interest Group on Operating Systems"],"location":"Rennes France","acronym":"EuroSys '22"},"container-title":["Proceedings of the 9th Workshop on Principles and Practice of Consistency for Distributed Data"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3517209.3524038","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/abs\/10.1145\/3517209.3524038","content-type":"text\/html","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3517209.3524038","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3517209.3524038","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T19:31:29Z","timestamp":1750188689000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3517209.3524038"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,4,5]]},"references-count":20,"alternative-id":["10.1145\/3517209.3524038","10.1145\/3517209"],"URL":"https:\/\/doi.org\/10.1145\/3517209.3524038","relation":{},"subject":[],"published":{"date-parts":[[2022,4,5]]},"assertion":[{"value":"2022-04-05","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}