{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,11]],"date-time":"2026-04-11T02:14:58Z","timestamp":1775873698220,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":27,"publisher":"ACM","license":[{"start":{"date-parts":[[2010,6,5]],"date-time":"2010-06-05T00:00:00Z","timestamp":1275696000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2010,6,5]]},"DOI":"10.1145\/1806596.1806650","type":"proceedings-article","created":{"date-parts":[[2010,6,8]],"date-time":"2010-06-08T08:37:34Z","timestamp":1275986254000},"page":"483-496","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":23,"title":["Traceable data types for self-adjusting computation"],"prefix":"10.1145","author":[{"given":"Umut A.","family":"Acar","sequence":"first","affiliation":[{"name":"Max-Planck Institute for Software Systems, Kaiserslautern, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Guy","family":"Blelloch","sequence":"additional","affiliation":[{"name":"Carnegie Mellon University, Pittsburgh, PA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ruy","family":"Ley-Wild","sequence":"additional","affiliation":[{"name":"Carnegie Mellon University, Pittsburgh, PA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kanat","family":"Tangwongsan","sequence":"additional","affiliation":[{"name":"Carnegie Mellon University, Pittsburgh, PA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Duru","family":"Turkoglu","sequence":"additional","affiliation":[{"name":"University of Chicago, Chicago, IL, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2010,6,5]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/232627.232638"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/1186632.1186634"},{"key":"e_1_3_2_1_3_1","volume-title":"Non-oblivious retroactive data structures. Technical report","author":"Acar U. A.","year":"2007","unstructured":"U. A. Acar , G. E. Blelloch , and K. Tangwongsan . Non-oblivious retroactive data structures. Technical report , Carnegie Mellon University , 2007 . U. A. Acar, G. E. Blelloch, and K. Tangwongsan. Non-oblivious retroactive data structures. Technical report, Carnegie Mellon University, 2007."},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-87744-8_3"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/1596527.1596530"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/1810959.1811011"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/592642.592647"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/235815.235821"},{"key":"e_1_3_2_1_9_1","volume-title":"Princeton University Press","author":"Bellman R.","year":"1957","unstructured":"R. Bellman . ph Dynamic Programming . Princeton University Press , 1957 . R. Bellman. phDynamic Programming. Princeton University Press, 1957."},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/581478.581482"},{"issue":"9","key":"e_1_3_2_1_11_1","first-page":"1412","volume":"80","author":"Chiang Y.-J.","year":"1992","unstructured":"Y.-J. Chiang and R. Tamassia . Dynamic algorithms in computational geometry. Proceedings of the IEEE , 80 ( 9 ): 1412 -- 1434 , 1992 . Y.-J. Chiang and R. Tamassia. Dynamic algorithms in computational geometry. Proceedings of the IEEE, 80 (9): 1412--1434, 1992.","journal-title":"Dynamic algorithms in computational geometry. Proceedings of the IEEE"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/567532.567544"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/28395.28434"},{"key":"e_1_3_2_1_14_1","volume-title":"Algorithms and Theory of Computation Handbook","author":"Eppstein D.","year":"1999","unstructured":"D. Eppstein , Z. Galil , and G. F. Italiano . Dynamic graph algorithms . In M. J. Atallah, editor, Algorithms and Theory of Computation Handbook , chapter 8. CRC Press , 1999 . D. Eppstein, Z. Galil, and G. F. Italiano. Dynamic graph algorithms. In M. J. Atallah, editor, Algorithms and Theory of Computation Handbook, chapter 8. CRC Press, 1999."},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/91556.91679"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/1542476.1542480"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/349299.349341"},{"key":"e_1_3_2_1_18_1","volume-title":"Department of Computer Science","author":"Hoover R.","year":"1987","unstructured":"R. Hoover . phIncremental Graph Evaluation. PhD thesis , Department of Computer Science , Cornell University , May 1987 . R. Hoover. phIncremental Graph Evaluation. PhD thesis, Department of Computer Science, Cornell University, May 1987."},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/1411204.1411249"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/1480881.1480907"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0049-237X(08)72018-4"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1038\/218019a0"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/75277.75305"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/158511.158710"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/1250734.1250770"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/99583.99587"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/103135.103137"}],"event":{"name":"PLDI '10: ACM SIGPLAN Conference on Programming Language Design and Implementation","location":"Toronto Ontario Canada","acronym":"PLDI '10","sponsor":["SIGPLAN ACM Special Interest Group on Programming Languages"]},"container-title":["Proceedings of the 31st ACM SIGPLAN Conference on Programming Language Design and Implementation"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1806596.1806650","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1806596.1806650","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T07:22:32Z","timestamp":1750231352000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1806596.1806650"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,6,5]]},"references-count":27,"alternative-id":["10.1145\/1806596.1806650","10.1145\/1806596"],"URL":"https:\/\/doi.org\/10.1145\/1806596.1806650","relation":{"is-identical-to":[{"id-type":"doi","id":"10.1145\/1809028.1806650","asserted-by":"object"}]},"subject":[],"published":{"date-parts":[[2010,6,5]]},"assertion":[{"value":"2010-06-05","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}