{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,23]],"date-time":"2025-06-23T16:10:04Z","timestamp":1750695004981,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":18,"publisher":"ACM","funder":[{"name":"NSF (National Science Foundation)","award":["CCF-2312573"],"award-info":[{"award-number":["CCF-2312573"]}]},{"name":"Simons Foundation","award":["409864"],"award-info":[{"award-number":["409864"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2025,6,15]]},"DOI":"10.1145\/3717823.3718208","type":"proceedings-article","created":{"date-parts":[[2025,6,15]],"date-time":"2025-06-15T22:21:27Z","timestamp":1750026087000},"page":"245-255","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Linear Hashing Is Optimal"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0009-0003-3670-3947","authenticated-orcid":false,"given":"Michael","family":"Jaber","sequence":"first","affiliation":[{"name":"University of Texas at Austin, Austin, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0002-7309-5648","authenticated-orcid":false,"given":"Vinayak M.","family":"Kumar","sequence":"additional","affiliation":[{"name":"University of Texas at Austin, Austin, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4749-3223","authenticated-orcid":false,"given":"David","family":"Zuckerman","sequence":"additional","affiliation":[{"name":"University of Texas at Austin, Austin, 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\/258533.258639"},{"key":"e_1_3_2_1_2_1","volume-title":"Spencer","author":"Alon Noga","year":"2004","unstructured":"Noga Alon and Joel H. Spencer. 2004. The Probabilistic Method (second ed.). Wiley, New York. isbn:0471370460 9780471370468 0471722154 9780471722151 0471653985 9780471653981"},{"key":"e_1_3_2_1_3_1","unstructured":"Martin Babka. 2018. A Note On the Size of Largest Bins Using Placement With Linear Transformations. arxiv:1810.04161. arxiv:1810.04161"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-48658-5_22"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/225058.225080"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0000(79)90044-8"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1137\/120871626"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.4086\/toc.2013.v009a030"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS54457.2022.00047"},{"key":"e_1_3_2_1_10_1","volume-title":"Wegman","author":"Markowsky George","year":"1978","unstructured":"George Markowsky, Lawrence J. Carter, and Mark N. Wegman. 1978. Analysis of a universal class of hash functions. In Mathematical Foundations of Computer Science 1978, J. Winkowski (Ed.). Springer Berlin Heidelberg, Berlin, Heidelberg. 345\u2013354. isbn:978-3-540-35757-5"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF00264615"},{"key":"e_1_3_2_1_12_1","volume-title":"Rothblum","author":"Meka Raghu","year":"2014","unstructured":"Raghu Meka, Omer Reingold, Guy N. Rothblum, and Ron D. Rothblum. 2014. Fast Pseudorandomness for Independence and Load Balancing. In Automata, Languages, and Programming, Javier Esparza, Pierre Fraigniaud, Thore Husfeldt, and Elias Koutsoupias (Eds.). Springer Berlin Heidelberg, Berlin, Heidelberg. 859\u2013870. isbn:978-3-662-43948-7"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"crossref","unstructured":"M. Mitzenmacher and E. Upfal. 2005. Probability and Computing: Randomized Algorithms and Probabilistic Analysis. Cambridge University Press. isbn:9780521835404 lccn:20040540 https:\/\/books.google.com\/books?id=0bAYl6d7hvkC","DOI":"10.1017\/CBO9780511813603"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/2220357.2220361"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.5555\/646975.711521"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0000(81)90033-7"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1002\/(SICI)1098-2418(199612)9:4<403::AID-RSA4>3.0.CO;2-0"},{"key":"e_1_3_2_1_18_1","unstructured":"Mary Wootters. 2014. Any Errors in this Dissertation are Probably Fixable: Topics in Probability and Error Correcting Codes. https:\/\/deepblue.lib.umich.edu\/bitstream\/handle\/2027.42\/108995\/marykw_1.pdf"}],"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.3718208","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,23]],"date-time":"2025-06-23T15:43:42Z","timestamp":1750693422000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3717823.3718208"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,6,15]]},"references-count":18,"alternative-id":["10.1145\/3717823.3718208","10.1145\/3717823"],"URL":"https:\/\/doi.org\/10.1145\/3717823.3718208","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"}}]}}