{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,19]],"date-time":"2025-12-19T21:23:19Z","timestamp":1766179399641,"version":"3.48.0"},"reference-count":5,"publisher":"Association for Computing Machinery (ACM)","issue":"1","license":[{"start":{"date-parts":[[2025,12,19]],"date-time":"2025-12-19T00:00:00Z","timestamp":1766102400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/publication-rights-and-licensing-policy"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["Commun. ACM"],"published-print":{"date-parts":[[2026,1]]},"abstract":"<jats:p>Recent hash table development raises questions about an optimal solution.<\/jats:p>","DOI":"10.1145\/3772375","type":"journal-article","created":{"date-parts":[[2025,12,2]],"date-time":"2025-12-02T18:55:07Z","timestamp":1764701707000},"page":"11-13","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Speeding Up Hash Tables"],"prefix":"10.1145","volume":"69","author":[{"given":"Sarah","family":"Underwood","sequence":"first","affiliation":[{"name":"Teddington, Teddington, United Kingdom"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2025,12,19]]},"reference":[{"key":"e_1_3_1_2_1","doi-asserted-by":"crossref","unstructured":"Peterson W.W. Addressing for random-access storage IBM J. Research and Development 1 April 1957; https:\/\/ieeexplore.ieee.org\/document\/5392733","DOI":"10.1147\/rd.12.0130"},{"key":"e_1_3_1_3_1","doi-asserted-by":"crossref","unstructured":"Yao A.C. Uniform hashing is optimal J. of the ACM (Jan. 1985); https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3828.3836","DOI":"10.1145\/3828.3836"},{"key":"e_1_3_1_4_1","unstructured":"Bender M.A. Conway A. Farach-Colton M. et al. Iceberg hashing: Optimizing many hash-table criteria at once. J. of the ACM (Sept. 2021); https:\/\/dl.acm.org\/doi\/10.1145\/3625817"},{"key":"e_1_3_1_5_1","unstructured":"Bender M.A. Conway A. Farach-Colton M. et al. Tiny pointers. ACM Trans. on Algorithms (Nov. 2021); https:\/\/arxiv.org\/abs\/2111.12800"},{"key":"e_1_3_1_6_1","unstructured":"Farach-Colton M. Krapivin A. and Kuszmaul W. Optimal bounds for open addressing without reordering arXiv (Jan. 2025); https:\/\/arxiv.org\/abs\/2501.02305"}],"container-title":["Communications of the ACM"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3772375","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,12,19]],"date-time":"2025-12-19T21:20:26Z","timestamp":1766179226000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3772375"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,12,19]]},"references-count":5,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2026,1]]}},"alternative-id":["10.1145\/3772375"],"URL":"https:\/\/doi.org\/10.1145\/3772375","relation":{},"ISSN":["0001-0782","1557-7317"],"issn-type":[{"type":"print","value":"0001-0782"},{"type":"electronic","value":"1557-7317"}],"subject":[],"published":{"date-parts":[[2025,12,19]]},"assertion":[{"value":"2025-12-19","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}