{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,21]],"date-time":"2026-08-21T18:39:24Z","timestamp":1787337564100,"version":"3.56.0"},"reference-count":30,"publisher":"Society for Industrial & Applied Mathematics (SIAM)","issue":"2","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["SIAM J. Comput."],"published-print":{"date-parts":[[2005,1]]},"abstract":"<jats:p>We present an algorithm for hashing $\\lfloor \\alpha n \\rfloor$ elements into a table with n separate chains that requires O(1) deterministic worst-case insert time and O(1) expected worst-case search time for constant $\\alpha$. We exploit the connection between two-way chaining and random graph theory in our techniques.<\/jats:p>","DOI":"10.1137\/s0097539704443240","type":"journal-article","created":{"date-parts":[[2005,10,17]],"date-time":"2005-10-17T21:00:17Z","timestamp":1129582817000},"page":"327-340","source":"Crossref","is-referenced-by-count":11,"title":["Two-Way Chaining with Reassignment"],"prefix":"10.1137","volume":"35","author":[{"given":"Ketan","family":"Dalal","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Luc","family":"Devroye","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Ebrahim","family":"Malalla","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Erin","family":"McLeish","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"351","published-online":{"date-parts":[[2006,7,27]]},"reference":[{"key":"R1","doi-asserted-by":"publisher","DOI":"10.1002\/0471722154"},{"key":"R2","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0000(79)90045-X"},{"key":"R3","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539795288490"},{"key":"R4","unstructured":"Petra Berenbrink, Artur Czumaj, Angelika Steger, Berthold V\u00f6cking, Balanced allocations: the heavily loaded case, ACM, New York, 2000, 745\u20137542115315"},{"key":"R5","unstructured":"A. Broder and M. Mitzenmacher,\n                      Using multiple hash functions to improve IP lookups\n                      , in Proceedings of the IEEE INFOCOM 2001 Conference (Anchorage, AK), 2001, pp. 1454\u20131463."},{"key":"R5","unstructured":"Full version available as Technical report TR\u201303\u201300, Department of Computer Science, Harvard University, Cambridge, MA, 2000."},{"key":"R5","unstructured":"Available online at http:\/\/www.eecs.harvard.edu\/\u223cmichaelm\/NEWWORK\/postscripts\/iproute.pdf"},{"key":"R6","unstructured":"J. Byers, J. Considine, and M. Mitzenmacher,\n                      Simple load balancing for distributed hash tables\n                      , in Proceedings of the 2nd International Workshop on Peer\u2010to\u2010Peer Systems, 2003, pp. 80\u201387."},{"key":"R7","doi-asserted-by":"publisher","DOI":"10.1137\/S009753979529564X"},{"key":"R8","doi-asserted-by":"publisher","DOI":"10.1002\/rsa.1011"},{"key":"R9","unstructured":"Luc Devroye, Branching processes and their applications in the analysis of tree structures and tree algorithms, Algorithms Combin., Vol. 16, Springer, Berlin, 1998, 249\u20133142000m:60099"},{"key":"R10","doi-asserted-by":"publisher","DOI":"10.1016\/S0020-0190(02)00500-8"},{"key":"R11","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539791194094"},{"key":"R12","unstructured":"Martin Dietzfelbinger, Friedhelm Meyer auf der Heide, A new universal class of hash functions and dynamic hashing in real time, Lecture Notes in Comput. Sci., Vol. 443, Springer, New York, 1990, 6\u2013191076811"},{"key":"R13","unstructured":"Martin Dietzfelbinger, Friedhelm Meyer auf der Heide, High performance universal hashing, with applications to shared memory simulations, Lecture Notes in Comput. Sci., Vol. 594, Springer, Berlin, 1992, 250\u201326994g:68027"},{"key":"R14","doi-asserted-by":"publisher","DOI":"10.1090\/S0002-9904-1947-08785-1"},{"key":"R15","first-page":"17","volume":"5","author":"Erd\u00f6s P.","year":"1960","journal-title":"Magyar Tud. Akad. Mat. Kutat\u00f3 Int. K\u00f6zl."},{"key":"R16","doi-asserted-by":"publisher","DOI":"10.1145\/828.1884"},{"key":"R17","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(86)90028-1"},{"key":"R18","doi-asserted-by":"publisher","DOI":"10.1145\/322248.322254"},{"key":"R19","doi-asserted-by":"publisher","DOI":"10.1080\/01621459.1963.10500830"},{"key":"R20","doi-asserted-by":"publisher","DOI":"10.1002\/rsa.3240040303"},{"key":"R21","doi-asserted-by":"publisher","DOI":"10.1002\/9781118032718"},{"key":"R22","doi-asserted-by":"publisher","DOI":"10.1002\/rsa.3240010106"},{"key":"R23","unstructured":"E. Malalla,\n                      Two\u2010Way Hashing with Separate Chaining and Linear Probing\n                      , Ph.D. thesis, School of Computer Science, McGill University, Montreal, Quebec, Canada, 2004."},{"key":"R24","unstructured":"Michael Mitzenmacher, Andr\u00e9a Richa, Ramesh Sitaraman, The power of two random choices: a survey of techniques and results, Comb. Optim., Vol. 9, Kluwer Acad. Publ., Dordrecht, 2001, 255\u20133122004c:68171"},{"key":"R25","unstructured":"Rasmus Pagh, On the cell probe complexity of membership and perfect hashing, ACM, New York, 2001, 425\u20134322120343"},{"key":"R26","doi-asserted-by":"publisher","DOI":"10.1016\/j.jalgor.2003.12.002"},{"key":"R27","unstructured":"Martin Raab, Angelika Steger, \u201cBalls into bins\u201d\u2014a simple and tight analysis, Lecture Notes in Comput. Sci., Vol. 1518, Springer, Berlin, 1998, 159\u20131701729169"},{"key":"R28","unstructured":"Berthold V\u00f6cking, How asymmetry helps load balancing, IEEE Computer Soc., Los Alamitos, CA, 1999, 131\u20131411917553"}],"container-title":["SIAM Journal on Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/epubs.siam.org\/doi\/pdf\/10.1137\/S0097539704443240","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,8,21]],"date-time":"2026-08-21T18:17:32Z","timestamp":1787336252000},"score":1,"resource":{"primary":{"URL":"https:\/\/epubs.siam.org\/doi\/10.1137\/S0097539704443240"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005,1]]},"references-count":30,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2005,1]]}},"alternative-id":["10.1137\/S0097539704443240"],"URL":"https:\/\/doi.org\/10.1137\/s0097539704443240","relation":{},"ISSN":["0097-5397","1095-7111"],"issn-type":[{"value":"0097-5397","type":"print"},{"value":"1095-7111","type":"electronic"}],"subject":[],"published":{"date-parts":[[2005,1]]}}}