{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,27]],"date-time":"2026-02-27T03:45:17Z","timestamp":1772163917920,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":8,"publisher":"ACM","license":[{"start":{"date-parts":[[2005,2,23]],"date-time":"2005-02-23T00:00:00Z","timestamp":1109116800000},"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":[[2005,2,23]]},"DOI":"10.1145\/1047344.1047407","type":"proceedings-article","created":{"date-parts":[[2005,8,3]],"date-time":"2005-08-03T04:31:47Z","timestamp":1123043507000},"page":"162-165","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":2,"title":["Alternatives to two classic data structures"],"prefix":"10.1145","author":[{"given":"Chris","family":"Okasaki","sequence":"first","affiliation":[{"name":"United States Military Academy, West Point, NY"}]}],"member":"320","published-online":{"date-parts":[[2005,2,23]]},"reference":[{"issue":"5","key":"e_1_3_2_1_1_1","first-page":"1259","article-title":"An algorithm for the organization of information","volume":"3","author":"Adel'son-Vel'ski\u01d0 G. M.","year":"1962","unstructured":"G. M. Adel'son-Vel'ski\u01d0 and E. M. Landis . An algorithm for the organization of information . Soviet Mathematics--Doklady , 3 ( 5 ): 1259 -- 1263 , Sept. 1962 . English translation of Russian orginal appearing in Doklady Akademia Nauk SSSR, 146:263--266. G. M. Adel'son-Vel'ski\u01d0 and E. M. Landis. An algorithm for the organization of information. Soviet Mathematics--Doklady, 3(5):1259--1263, Sept. 1962. English translation of Russian orginal appearing in Doklady Akademia Nauk SSSR, 146:263--266.","journal-title":"Soviet Mathematics--Doklady"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/297096.297111"},{"key":"e_1_3_2_1_3_1","volume-title":"Introduction to algorithms","author":"Cormen T. H.","year":"2001","unstructured":"T. H. Cormen , C. E. Leiserson , R. L. Rivest , and C. Stein . Introduction to algorithms . MIT Press , 2001 . T. H. Cormen, C. E. Leiserson, R. L. Rivest, and C. Stein. Introduction to algorithms. MIT Press, 2001."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1978.3"},{"key":"e_1_3_2_1_6_1","unstructured":"D. E.\n      Knuth\n      . \n      Searching\n       and \n      Sorting volume \n  3\n   of \n  The Art of Computer Programming\n  . \n  Addison-Wesley 1973\n  .   D. E. Knuth. Searching and Sorting volume 3 of The Art of Computer Programming. Addison-Wesley 1973."},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1017\/S0956796899003494"},{"key":"e_1_3_2_1_8_1","first-page":"1","volume-title":"Fun with binary heap trees","author":"Okasaki C.","year":"2003","unstructured":"C. Okasaki . Fun with binary heap trees , pages 1 -- 16 . Palgrave MacMillan , 2003 . C. Okasaki. Fun with binary heap trees, pages 1--16. Palgrave MacMillan, 2003."},{"key":"e_1_3_2_1_9_1","volume-title":"Data Structures & Algorithm Analysis in Java","author":"Weiss M. A.","year":"1998","unstructured":"M. A. Weiss . Data Structures & Algorithm Analysis in Java . Addison-Wesley , 1998 . M. A. Weiss. Data Structures & Algorithm Analysis in Java. Addison-Wesley, 1998."}],"event":{"name":"SIGCSE05: Technical Symposium on Computer Science Education","location":"St. Louis Missouri USA","acronym":"SIGCSE05","sponsor":["ACM Association for Computing Machinery","SIGCSE ACM Special Interest Group on Computer Science Education"]},"container-title":["Proceedings of the 36th SIGCSE technical symposium on Computer science education"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1047344.1047407","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1047344.1047407","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T12:07:47Z","timestamp":1750248467000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1047344.1047407"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005,2,23]]},"references-count":8,"alternative-id":["10.1145\/1047344.1047407","10.1145\/1047344"],"URL":"https:\/\/doi.org\/10.1145\/1047344.1047407","relation":{"is-identical-to":[{"id-type":"doi","id":"10.1145\/1047124.1047407","asserted-by":"object"}]},"subject":[],"published":{"date-parts":[[2005,2,23]]},"assertion":[{"value":"2005-02-23","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}