{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,26]],"date-time":"2026-02-26T15:30:57Z","timestamp":1772119857260,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":31,"publisher":"ACM","license":[{"start":{"date-parts":[[2005,10,26]],"date-time":"2005-10-26T00:00:00Z","timestamp":1130284800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2005,10,26]]},"DOI":"10.1145\/1095890.1095904","type":"proceedings-article","created":{"date-parts":[[2005,11,7]],"date-time":"2005-11-07T17:34:39Z","timestamp":1131384879000},"page":"91-103","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":43,"title":["Segmented hash"],"prefix":"10.1145","author":[{"given":"Sailesh","family":"Kumar","sequence":"first","affiliation":[{"name":"Washington University, St. Louis, MO"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Patrick","family":"Crowley","sequence":"additional","affiliation":[{"name":"Washington University, St. Louis, MO"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2005,10,26]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/195058.195412"},{"key":"e_1_3_2_1_2_1","unstructured":"M. Mitzenmacher The Power of Two Choices in Randomized Load Balancing Ph.D. thesis University of California Berkeley 1996.]]   M. Mitzenmacher The Power of Two Choices in Randomized Load Balancing Ph.D. thesis University of California Berkeley 1996.]]"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/195058.195412"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/225058.225131"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/322248.322254"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/828.1884"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0000(79)90044-8"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/195058.195122"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539795294165"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/1080091.1080114"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.5555\/795665.796480"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/263105.263136"},{"key":"e_1_3_2_1_13_1","first-page":"1454","article-title":"Using Multiple Hash Functions to Improve IP Lookups","author":"Broder A.","year":"2001","journal-title":"IEEE INFOCOM"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.5555\/61764.61776"},{"key":"e_1_3_2_1_15_1","unstructured":"T. H. Cormen C. E. Leiserson R. L. Rivest Introduction to Algorithms The MIT Press 1990.]]   T. H. Cormen C. E. Leiserson R. L. Rivest Introduction to Algorithms The MIT Press 1990.]]"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/42404.42410"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/380752.380844"},{"key":"e_1_3_2_1_18_1","first-page":"121","volume-title":"Proc. 9th Annual European Symposium on Algorithms","author":"Pagh R.","year":"2001"},{"key":"e_1_3_2_1_19_1","unstructured":"D. E. Knuth The Art of Computer Programming volume 3 Addison-Wesley Publishing Co second edition 1998.]]   D. E. Knuth The Art of Computer Programming volume 3 Addison-Wesley Publishing Co second edition 1998.]]"},{"key":"e_1_3_2_1_20_1","first-page":"217","volume-title":"Proc. 3rd ACM-SIAM Symp. on Discrete Algorithms","author":"Hui L. C. K.","year":"1992"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"crossref","unstructured":"Information Processing Letters 1977 6 1 Parallel hashing algorithms","DOI":"10.1016\/0020-0190(77)90004-7"},{"issue":"9","key":"e_1_3_2_1_22_1","first-page":"851","article-title":"Evaluation of associative memory using parallel chained hashing","volume":"33","year":"1984","journal-title":"IEEE Tran. on Software Engineering"},{"key":"e_1_3_2_1_23_1","unstructured":"A. Broder and A. Karlin \"Multilevel adaptive hashing \" ACM-SIAM Symposium on Discrete Algorithm 1990.]]   A. Broder and A. Karlin \"Multilevel adaptive hashing \" ACM-SIAM Symposium on Discrete Algorithm 1990.]]"},{"key":"e_1_3_2_1_24_1","unstructured":"G. R. Wright W.R. Stevens TCP\/IP Illustrated volume 2 Addison-Wesley Publishing Co. 1995.]]  G. R. Wright W.R. Stevens TCP\/IP Illustrated volume 2 Addison-Wesley Publishing Co. 1995.]]"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/362686.362692"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1109\/90.851975"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1016\/S1389-1286(99)00112-7"},{"key":"e_1_3_2_1_28_1","volume-title":"IEEE Hot Interconnects","author":"Schuehler David V.","year":"2003"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01202791"},{"key":"e_1_3_2_1_30_1","unstructured":"Cu-11 standard cell\/gate array ASIC IBM.]]  Cu-11 standard cell\/gate array ASIC IBM.]]"},{"key":"e_1_3_2_1_31_1","unstructured":"Virtex-4 FPGA Xilinx.]]  Virtex-4 FPGA Xilinx.]]"}],"event":{"name":"ANCS05: Symposium on Architecture for Networking and Communications Systems 2005","location":"Princeton NJ USA","acronym":"ANCS05","sponsor":["SIGCOMM ACM Special Interest Group on Data Communication","ACM Association for Computing Machinery","SIGARCH ACM Special Interest Group on Computer Architecture"]},"container-title":["Proceedings of the 2005 ACM symposium on Architecture for networking and communications systems"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1095890.1095904","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1095890.1095904","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T16:18:54Z","timestamp":1750263534000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1095890.1095904"}},"subtitle":["an efficient hash table implementation for high performance networking subsystems"],"short-title":[],"issued":{"date-parts":[[2005,10,26]]},"references-count":31,"alternative-id":["10.1145\/1095890.1095904","10.1145\/1095890"],"URL":"https:\/\/doi.org\/10.1145\/1095890.1095904","relation":{},"subject":[],"published":{"date-parts":[[2005,10,26]]},"assertion":[{"value":"2005-10-26","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}