{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,9]],"date-time":"2026-06-09T18:57:34Z","timestamp":1781031454809,"version":"3.54.1"},"publisher-location":"New York, NY, USA","reference-count":47,"publisher":"ACM","license":[{"start":{"date-parts":[[2026,6,9]],"date-time":"2026-06-09T00:00:00Z","timestamp":1780963200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/legalcode"}],"funder":[{"DOI":"10.13039\/501100003977","name":"Israel Science Foundation","doi-asserted-by":"publisher","award":["1948\/21"],"award-info":[{"award-number":["1948\/21"]}],"id":[{"id":"10.13039\/501100003977","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2026,6,9]]},"DOI":"10.1145\/3798129.3800839","type":"proceedings-article","created":{"date-parts":[[2026,6,9]],"date-time":"2026-06-09T17:53:56Z","timestamp":1781027636000},"page":"1290-1301","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Compressing Dynamic Fully Indexable Dictionaries in Word-RAM"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0009-0003-3887-0247","authenticated-orcid":false,"given":"Gabriel Marques","family":"Domingues","sequence":"first","affiliation":[{"name":"Tel Aviv University, School of Electrical Engineering, Tel Aviv-Yafo, Israel"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2026,6,9]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0019-9958(84)80015-7"},{"key":"e_1_3_2_1_2_1","first-page":"1","article-title":"Fusion trees can be implemented with AC0 instructions only","volume":"215","author":"Andersson Arne","year":"1999","unstructured":"Arne Andersson, Peter Bro Miltersen, and Mikkel Thorup. 1999. Fusion trees can be implemented with AC0 instructions only. Theoretical Computer Science, 215, 1-2 (1999), 337\u2013344.","journal-title":"Theoretical Computer Science"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/1236457.1236460"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-015-9969-x"},{"key":"e_1_3_2_1_5_1","volume-title":"European Symposium on Algorithms. Springer Berlin Heidelberg","author":"Belazzougui Djamal","year":"2010","unstructured":"Djamal Belazzougui, Paolo Boldi, Rasmus Pagh, and Sebastiano Vigna. 2010. Fast prefix search in little space, with applications. In European Symposium on Algorithms. Springer Berlin Heidelberg, Berlin, Heidelberg. 427\u2013438."},{"key":"e_1_3_2_1_6_1","volume-title":"International Symposium on String Processing and Information Retrieval. Springer Berlin Heidelberg","author":"Belazzougui Djamal","year":"2010","unstructured":"Djamal Belazzougui, Paolo Boldi, and Sebastiano Vigna. 2010. Dynamic z-fast tries. In International Symposium on String Processing and Information Retrieval. Springer Berlin Heidelberg, Berlin, Heidelberg. 159\u2013172."},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-017-0380-7"},{"key":"e_1_3_2_1_8_1","volume-title":"Compact pat trees. Ph. D. Dissertation","author":"Clark David","unstructured":"David Clark. 1996. Compact pat trees. Ph. D. Dissertation. University of Waterloo Canada."},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.5555\/313852.314087"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ic.2014.09.005"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/356770.356776"},{"key":"e_1_3_2_1_12_1","volume-title":"Workshop on Algorithms and Data Structures. Springer Berlin Heidelberg","author":"Dietz Paul F","year":"1989","unstructured":"Paul F Dietz. 1989. Optimal algorithms for list indexing and subset rank. In Workshop on Algorithms and Data Structures. Springer Berlin Heidelberg, Berlin, Heidelberg. 39\u201346."},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/322290.322305"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/73007.73040"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/100216.100217"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0000(93)90040-4"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2007.07.041"},{"key":"e_1_3_2_1_18_1","volume-title":"European Symposium on Algorithms. Springer Berlin Heidelberg","author":"Golynski Alexander","year":"2007","unstructured":"Alexander Golynski, Roberto Grossi, Ankur Gupta, Rajeev Raman, and Satti Srinivasa Rao. 2007. On the size of succinct indices. In European Symposium on Algorithms. Springer Berlin Heidelberg, Berlin, Heidelberg. 371\u2013382."},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-013-9767-2"},{"key":"e_1_3_2_1_20_1","volume-title":"Scandinavian Workshop on Algorithm Theory. Springer Berlin Heidelberg","author":"Golynski Alexander","year":"2008","unstructured":"Alexander Golynski, Rajeev Raman, and S Srinivasa Rao. 2008. On the redundancy of succinct data structures. In Scandinavian Workshop on Algorithm Theory. Springer Berlin Heidelberg, Berlin, Heidelberg. 148\u2013159."},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/178243.178249"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.4230\/LIPIcs.STACS.2009.1847"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1006\/jagm.2001.1171"},{"key":"e_1_3_2_1_24_1","volume-title":"A new data structure for representing sorted lists. Acta informatica, 17, 2","author":"Huddleston Scott","year":"1982","unstructured":"Scott Huddleston and Kurt Mehlhorn. 1982. A new data structure for representing sorted lists. Acta informatica, 17, 2 (1982), 157\u2013184."},{"key":"e_1_3_2_1_25_1","volume-title":"Succinct static data structures. Ph. D. Dissertation","author":"Jacobson Guy Joseph","unstructured":"Guy Joseph Jacobson. 1988. Succinct static data structures. Ph. D. Dissertation. Carnegie Mellon University."},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611978971.138"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS57990.2023.00104"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS57990.2023.00112"},{"key":"e_1_3_2_1_29_1","volume-title":"52nd International Colloquium on Automata, Languages, and Programming (ICALP","author":"Liang Jingxun","year":"2025","unstructured":"Jingxun Liang and Renfei Zhou. 2025. Optimal Static Fully Indexable Dictionaries. In 52nd International Colloquium on Automata, Languages, and Programming (ICALP 2025). Schloss Dagstuhl\u2013Leibniz-Zentrum f\u00fcr Informatik, 114\u20131."},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"crossref","first-page":"30","DOI":"10.1007\/s00224-025-10229-8","article-title":"(Worst-case) Optimal Adaptive Dynamic Bitvectors","volume":"69","author":"Navarro Gonzalo","year":"2025","unstructured":"Gonzalo Navarro. 2025. (Worst-case) Optimal Adaptive Dynamic Bitvectors. Theory of Computing Systems, 69, 3 (2025), 30.","journal-title":"Theory of Computing Systems"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1137\/130908245"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/3409371"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1145\/2601073"},{"key":"e_1_3_2_1_34_1","volume-title":"Succincter. In 2008 49th Annual IEEE Symposium on Foundations of Computer Science. IEEE, 305\u2013313","author":"P\u0103tra\u015fcu Mihai","year":"2008","unstructured":"Mihai P\u0103tra\u015fcu. 2008. Succincter. In 2008 49th Annual IEEE Symposium on Foundations of Computer Science. IEEE, 305\u2013313."},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1145\/1007352.1007435"},{"key":"e_1_3_2_1_36_1","volume-title":"Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms. 4, Society for Industrial and Applied Mathematics, USA. 20\u201329","author":"P\u0103tra\u015fcu Mihai","year":"2004","unstructured":"Mihai P\u0103tra\u015fcu and Erik D Demaine. 2004. Tight bounds for the partial-sums problem. In Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms. 4, Society for Industrial and Applied Mathematics, USA. 20\u201329."},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539705447256"},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1145\/1132516.1132551"},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2014.26"},{"key":"e_1_3_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.5555\/1873601.1873612"},{"key":"e_1_3_2_1_41_1","volume-title":"28th Annual symposium on combinatorial pattern matching (CPM","author":"Pibiri Giulio Ermanno","year":"2017","unstructured":"Giulio Ermanno Pibiri and Rossano Venturini. 2017. Dynamic Elias-Fano representation. In 28th Annual symposium on combinatorial pattern matching (CPM 2017). Schloss Dagstuhl\u2013Leibniz-Zentrum f\u00fcr Informatik, 30\u20131."},{"key":"e_1_3_2_1_42_1","unstructured":"Giulio Ermanno Pibiri and Rossano Venturini. 2020. Succinct Dynamic Ordered Sets with Random Access. arxiv:2003.11835."},{"key":"e_1_3_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.1145\/1290672.1290680"},{"key":"e_1_3_2_1_44_1","volume-title":"International Colloquium on Automata, Languages, and Programming","author":"Raman Rajeev","unstructured":"Rajeev Raman and Satti Srinivasa Rao. 2003. Succinct dynamic dictionaries and trees. In International Colloquium on Automata, Languages, and Programming. Springer, 357\u2013368."},{"key":"e_1_3_2_1_45_1","doi-asserted-by":"publisher","DOI":"10.1145\/1328911.1328912"},{"key":"e_1_3_2_1_46_1","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(83)90075-3"},{"key":"e_1_3_2_1_47_1","doi-asserted-by":"publisher","DOI":"10.5555\/337729.337809"}],"event":{"name":"STOC '26: 58th Annual ACM Symposium on Theory of Computing","location":"Salt Lake City UT USA","acronym":"STOC '26","sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory"]},"container-title":["Proceedings of the 58th Annual ACM Symposium on Theory of Computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3798129.3800839","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,6,9]],"date-time":"2026-06-09T18:04:40Z","timestamp":1781028280000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3798129.3800839"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,6,9]]},"references-count":47,"alternative-id":["10.1145\/3798129.3800839","10.1145\/3798129"],"URL":"https:\/\/doi.org\/10.1145\/3798129.3800839","relation":{},"subject":[],"published":{"date-parts":[[2026,6,9]]},"assertion":[{"value":"2026-06-09","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}