{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,23]],"date-time":"2025-06-23T16:10:03Z","timestamp":1750695003800,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":31,"publisher":"ACM","funder":[{"name":"Simons Foundation","award":["AWD1007164"],"award-info":[{"award-number":["AWD1007164"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2025,6,15]]},"DOI":"10.1145\/3717823.3718278","type":"proceedings-article","created":{"date-parts":[[2025,6,15]],"date-time":"2025-06-15T22:21:27Z","timestamp":1750026087000},"page":"278-289","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Optimal Static Dictionary with Worst-Case Constant Query Time"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0009-0004-3632-4506","authenticated-orcid":false,"given":"Yang","family":"Hu","sequence":"first","affiliation":[{"name":"Tsinghua University, Beijing, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0001-1000-5900","authenticated-orcid":false,"given":"Jingxun","family":"Liang","sequence":"additional","affiliation":[{"name":"Carnegie Mellon University, Pittsburgh, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1450-1896","authenticated-orcid":false,"given":"Huacheng","family":"Yu","sequence":"additional","affiliation":[{"name":"Princeton University, Princeton, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0008-7960-4005","authenticated-orcid":false,"given":"Junkai","family":"Zhang","sequence":"additional","affiliation":[{"name":"Tsinghua University, Beijing, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0095-0626","authenticated-orcid":false,"given":"Renfei","family":"Zhou","sequence":"additional","affiliation":[{"name":"Carnegie Mellon University, Pittsburgh, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2025,6,15]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/3519935.3519969"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539795294165"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539702405292"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0000(79)90044-8"},{"key":"e_1_3_2_1_5_1","volume-title":"Introduction to Algorithms","author":"Cormen Thomas H.","unstructured":"Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, and Clifford Stein. 2009. Introduction to Algorithms, 3rd Edition. MIT Press. isbn:978-0-262-03384-8 http:\/\/mitpress.mit.edu\/books\/introduction-algorithms","edition":"3"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.4230\/LIPIcs.STACS.2019.24"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/1806689.1806771"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1137\/0222001"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/146585.146591"},{"volume-title":"Proc. 4th International Workshop on Algorithms and Data Structures (WADS). 482\u2013493","author":"Faith","key":"e_1_3_2_1_10_1","unstructured":"Faith E. Fich and Peter Bro Miltersen. 1995. Tables Should Be Sorted (On Random Access Machines). In Proc. 4th International Workshop on Algorithms and Data Structures (WADS). 482\u2013493."},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/828.1884"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611973068.69"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-44693-1_28"},{"key":"e_1_3_2_1_14_1","unstructured":"Yang Hu Jingxun Liang Huacheng Yu Junkai Zhang and Renfei Zhou. 2024. Optimal Static Dictionary with Worst-Case Constant Query Time. arxiv:2412.10655. arxiv:2412.10655"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS57990.2023.00112"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","unstructured":"Mingmou Liu. 2022. Nearly tight lower bounds for succinct range minimum query. Preprint arXiv:2111.02318. https:\/\/doi.org\/10.48550\/arXiv.2111.02318 arxiv:2111.02318. 10.48550\/arXiv.2111.02318","DOI":"10.48550\/arXiv.2111.02318"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/3357713.3384260"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.5555\/646250.685517"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1006\/jcss.1998.1577"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(91)90157-D"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539700369909"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/380752.380836"},{"key":"e_1_3_2_1_23_1","volume-title":"Succincter. In Proc. 49th IEEE Symposium on Foundations of Computer Science (FOCS). 305\u2013313","author":"P\u01cetra\u015fcu Mihai","year":"2008","unstructured":"Mihai P\u01cetra\u015fcu. 2008. Succincter. In Proc. 49th IEEE Symposium on Foundations of Computer Science (FOCS). 305\u2013313."},{"key":"e_1_3_2_1_24_1","volume-title":"Proc. 21st ACM-SIAM Symposium on Discrete Algorithms (SODA). 117\u2013122","author":"P\u01cetra\u015fcu Mihai","year":"2010","unstructured":"Mihai P\u01cetra\u015fcu and Emanuele Viola. 2010. Cell-probe lower bounds for succinct partial sums. In Proc. 21st ACM-SIAM Symposium on Discrete Algorithms (SODA). 117\u2013122."},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1137\/0219054"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.46298\/hrj.1992.124"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/359168.359175"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1137\/090766619"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.4230\/LIPIcs.CCC.2023.26"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/322261.322274"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/3357713.3384274"}],"event":{"name":"STOC '25: 57th Annual ACM Symposium on Theory of Computing","sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory"],"location":"Prague Czechia","acronym":"STOC '25"},"container-title":["Proceedings of the 57th Annual ACM Symposium on Theory of Computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3717823.3718278","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,23]],"date-time":"2025-06-23T15:47:56Z","timestamp":1750693676000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3717823.3718278"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,6,15]]},"references-count":31,"alternative-id":["10.1145\/3717823.3718278","10.1145\/3717823"],"URL":"https:\/\/doi.org\/10.1145\/3717823.3718278","relation":{},"subject":[],"published":{"date-parts":[[2025,6,15]]},"assertion":[{"value":"2025-06-15","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}