{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,27]],"date-time":"2026-02-27T03:46:03Z","timestamp":1772163963757,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":30,"publisher":"ACM","license":[{"start":{"date-parts":[[2006,6,11]],"date-time":"2006-06-11T00:00:00Z","timestamp":1149984000000},"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":[[2006,6,11]]},"DOI":"10.1145\/1133981.1133993","type":"proceedings-article","created":{"date-parts":[[2006,7,24]],"date-time":"2006-07-24T12:53:01Z","timestamp":1153745581000},"page":"96-107","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":33,"title":["An experimental analysis of self-adjusting computation"],"prefix":"10.1145","author":[{"given":"Umut A.","family":"Acar","sequence":"first","affiliation":[{"name":"Toyota Technological Institute"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Guy E.","family":"Blelloch","sequence":"additional","affiliation":[{"name":"Carnegie Mellon University"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Matthias","family":"Blume","sequence":"additional","affiliation":[{"name":"Toyota Technological Institute"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kanat","family":"Tangwongsan","sequence":"additional","affiliation":[{"name":"Carnegie Mellon University"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2006,6,11]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/232627.232638"},{"key":"e_1_3_2_1_3_1","volume-title":"ACM SIGPLAN Workshop on ML","author":"Acar U. A.","year":"2005","unstructured":"U. A. Acar , G. E. Blelloch , M. Blume , R. Harper , and K. Tangwongsan . A library for self-adjusting computation . In ACM SIGPLAN Workshop on ML , 2005 . U. A. Acar, G. E. Blelloch, M. Blume, R. Harper, and K. Tangwongsan. A library for self-adjusting computation. In ACM SIGPLAN Workshop on ML, 2005."},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/503272.503296"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/604131.604133"},{"key":"e_1_3_2_1_6_1","volume-title":"ACM-SIAM Symposium on Discrete Algorithms (SODA)","author":"Acar U. A.","year":"2004","unstructured":"U. A. Acar , G. E. Blelloch , R. Harper , J. L. Vittes , and M. Woo . Dynamizing static algorithms with applications to dynamic trees and history independence . In ACM-SIAM Symposium on Discrete Algorithms (SODA) , 2004 . U. A. Acar, G. E. Blelloch, R. Harper, J. L. Vittes, and M. Woo. Dynamizing static algorithms with applications to dynamic trees and history independence. In ACM-SIAM Symposium on Discrete Algorithms (SODA), 2004."},{"key":"e_1_3_2_1_8_1","volume-title":"Workshop on Algorithm Engineering and Experimentation","author":"Acar U. A.","year":"2005","unstructured":"U. A. Acar , G. E. Blelloch , and J. L. Vittes . An experimental analysis of change propagation in dynamic trees . In Workshop on Algorithm Engineering and Experimentation , 2005 . U. A. Acar, G. E. Blelloch, and J. L. Vittes. An experimental analysis of change propagation in dynamic trees. In Workshop on Algorithm Engineering and Experimentation, 2005."},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/235815.235821"},{"key":"e_1_3_2_1_10_1","volume-title":"Dynamic Programming","author":"Bellman R.","year":"1957","unstructured":"R. Bellman . Dynamic Programming . Princeton University Press , 1957 . R. Bellman. Dynamic Programming. Princeton University Press, 1957."},{"key":"e_1_3_2_1_11_1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"152","DOI":"10.1007\/3-540-45749-6_17","volume-title":"Two simplified algorithms for maintaining order in a list","author":"Bender M. A.","year":"2002","unstructured":"M. A. Bender , R. Cole , E. D. Demaine , M. Farach-Colton , and J. Zito . Two simplified algorithms for maintaining order in a list . In Lecture Notes in Computer Science , pages 152 -- 164 , 2002 . M. A. Bender, R. Cole, E. D. Demaine, M. Farach-Colton, and J. Zito. Two simplified algorithms for maintaining order in a list. In Lecture Notes in Computer Science, pages 152--164, 2002."},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.5555\/645413.757575"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/581478.581482"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02712873"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/363647.363652"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1109\/5.163409"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/567532.567544"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/28395.28434"},{"key":"e_1_3_2_1_19_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_20_1","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(72)90045-2"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/349299.349341"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1137\/0215021"},{"key":"e_1_3_2_1_23_1","volume-title":"Sorting and Searching","author":"Knuth D.","year":"1998","unstructured":"D. Knuth . The Art of Computer Programming : Sorting and Searching . Addison Wesley , 1998 . D. Knuth. The Art of Computer Programming: Sorting and Searching. Addison Wesley, 1998."},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/237721.237769"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/291889.291895"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0049-237X(08)72018-4"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1038\/218019a0"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0000(81)90012-X"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/75277.75305"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/158511.158710"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/98524.98570"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02523195"}],"event":{"name":"PLDI06: ACM SIGPLAN Conference on Programming Language Design and Implementation 2006","location":"Ottawa Ontario Canada","acronym":"PLDI06","sponsor":["SIGPLAN ACM Special Interest Group on Programming Languages","ACM Association for Computing Machinery","SIGSOFT ACM Special Interest Group on Software Engineering"]},"container-title":["Proceedings of the 27th ACM SIGPLAN Conference on Programming Language Design and Implementation"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1133981.1133993","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1133981.1133993","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T16:22:18Z","timestamp":1750263738000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1133981.1133993"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006,6,11]]},"references-count":30,"alternative-id":["10.1145\/1133981.1133993","10.1145\/1133981"],"URL":"https:\/\/doi.org\/10.1145\/1133981.1133993","relation":{"is-identical-to":[{"id-type":"doi","id":"10.1145\/1133255.1133993","asserted-by":"object"}]},"subject":[],"published":{"date-parts":[[2006,6,11]]},"assertion":[{"value":"2006-06-11","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}