{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:39:47Z","timestamp":1750307987097,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":20,"publisher":"ACM","license":[{"start":{"date-parts":[[2006,6,26]],"date-time":"2006-06-26T00:00:00Z","timestamp":1151280000000},"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,26]]},"DOI":"10.1145\/1142351.1142355","type":"proceedings-article","created":{"date-parts":[[2006,7,24]],"date-time":"2006-07-24T16:53:01Z","timestamp":1153759981000},"page":"20-29","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":10,"title":["An adaptive packed-memory array"],"prefix":"10.1145","author":[{"given":"Michael A.","family":"Bender","sequence":"first","affiliation":[{"name":"State University of New York at Stony Brook, NY"}]},{"given":"Haodong","family":"Hu","sequence":"additional","affiliation":[{"name":"State University of New York at Stony Brook, NY"}]}],"member":"320","published-online":{"date-parts":[[2006,6,26]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.5555\/647912.740801"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.5555\/795666.796541"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539701389956"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.5555\/545381.545385"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jalgor.2004.04.014"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/1142351.1142385"},{"key":"e_1_3_2_1_7_1","first-page":"16","volume-title":"Proc. 3rd International Conference on Fun with Algorithms (FUN)","author":"Bender M. A.","year":"2004","unstructured":"M. A. Bender , M. Farach-Colton , and M. Mosteiro . Insertion sort is O(n log n) . In Proc. 3rd International Conference on Fun with Algorithms (FUN) , pages 16 -- 23 , 2004 . M. A. Bender, M. Farach-Colton, and M. Mosteiro. Insertion sort is O(n log n). In Proc. 3rd International Conference on Fun with Algorithms (FUN), pages 16--23, 2004."},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/1073970.1074009"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.5555\/545381.545386"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/800070.802184"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.5555\/645897.672121"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/28395.28434"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.5555\/645895.671925"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.5555\/646235.682700"},{"key":"e_1_3_2_1_15_1","volume-title":"Haifa","author":"Katriel I.","year":"2002","unstructured":"I. Katriel . Implicit data structures based on local reorganizations. Master's thesis, Technion -- Israel Inst. of Tech ., Haifa , May 2002 . I. Katriel. Implicit data structures based on local reorganizations. Master's thesis, Technion -- Israel Inst. of Tech., Haifa, May 2002."},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/303976.304009"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF00289142"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/800070.802183"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/16894.16879"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1016\/0890-5401(92)90034-D"}],"event":{"name":"SIGMOD\/PODS06: International Conference on Management of Data and Symposium on Principles Database and Systems","sponsor":["SIGMOD ACM Special Interest Group on Management of Data","SIGAI ACM Special Interest Group on Artificial Intelligence","ACM Association for Computing Machinery","SIGACT ACM Special Interest Group on Algorithms and Computation Theory"],"location":"Chicago IL USA","acronym":"SIGMOD\/PODS06"},"container-title":["Proceedings of the twenty-fifth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1142351.1142355","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1142351.1142355","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T15:06:11Z","timestamp":1750259171000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1142351.1142355"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006,6,26]]},"references-count":20,"alternative-id":["10.1145\/1142351.1142355","10.1145\/1142351"],"URL":"https:\/\/doi.org\/10.1145\/1142351.1142355","relation":{},"subject":[],"published":{"date-parts":[[2006,6,26]]},"assertion":[{"value":"2006-06-26","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}