{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:28:04Z","timestamp":1750307284885,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":34,"publisher":"ACM","license":[{"start":{"date-parts":[[2009,10,19]],"date-time":"2009-10-19T00:00:00Z","timestamp":1255910400000},"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":[[2009,10,19]]},"DOI":"10.1145\/1882486.1882519","type":"proceedings-article","created":{"date-parts":[[2010,11,12]],"date-time":"2010-11-12T14:38:38Z","timestamp":1289572718000},"page":"133-142","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":7,"title":["Divide and discriminate"],"prefix":"10.1145","author":[{"given":"Domenico","family":"Ficara","sequence":"first","affiliation":[{"name":"University of Pisa, Italy"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Stefano","family":"Giordano","sequence":"additional","affiliation":[{"name":"University of Pisa, Italy"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sailesh","family":"Kumar","sequence":"additional","affiliation":[{"name":"Huawei Technology"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bill","family":"Lynch","sequence":"additional","affiliation":[{"name":"Huawei Technology"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2009,10,19]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"HEXA: Compact Data Structures for Faster Packet Processing,\" Proc. of IEEE ICNP","author":"Kumar S.","year":"2007","unstructured":"S. Kumar , J. Turner , P. Crowley and M. Mitzenmacher , \" HEXA: Compact Data Structures for Faster Packet Processing,\" Proc. of IEEE ICNP , Beijing, China , October , 2007 . S. Kumar, J. Turner, P. Crowley and M. Mitzenmacher, \"HEXA: Compact Data Structures for Faster Packet Processing,\" Proc. of IEEE ICNP, Beijing, China, October, 2007."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/322248.322254"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/828.1884"},{"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","doi-asserted-by":"publisher","DOI":"10.1145\/195058.195122"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539795294165"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1988.21968"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.5555\/795665.796480"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/195058.195412"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/225058.225131"},{"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","author":"Broder A.","year":"2001","unstructured":"A. Broder , M. Mitzenmacher , \" Using Multiple Hash Functions to Improve IP Lookups\" , IEEE INFOCOM , 2001 , pp. 1454 -- 1463 . A. Broder, M. Mitzenmacher, \"Using Multiple Hash Functions to Improve IP Lookups\", IEEE INFOCOM, 2001, pp. 1454--1463.","journal-title":"IEEE INFOCOM"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/1185347.1185359"},{"key":"e_1_3_2_1_15_1","volume-title":"Introduction to Algorithms","author":"Cormen T. H.","year":"1990","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, August 28--31","author":"Pagh R.","year":"2001","unstructured":"R. Pagh , F. F. Rodler , Cuckoo Hashing , Proc. 9th Annual European Symposium on Algorithms, August 28--31 , 2001 , pp. 121 -- 133 . R. Pagh, F. F. Rodler, Cuckoo Hashing, Proc. 9th Annual European Symposium on Algorithms, August 28--31, 2001, pp. 121--133."},{"key":"e_1_3_2_1_19_1","first-page":"556","author":"Kumar S.","year":"2008","unstructured":"S. Kumar , J. Turner et al., \" Peacock hashing: Deterministic and updatable hashing for high performance networking,\" Proc. IEEE Infocom , 2008 , pp. 556 -- 564 . S. Kumar, J. Turner et al., \"Peacock hashing: Deterministic and updatable hashing for high performance networking,\" Proc. IEEE Infocom, 2008, pp. 556--564.","journal-title":"Proc. IEEE Infocom"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.5555\/139404.139454"},{"key":"e_1_3_2_1_21_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_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/1080091.1080114"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/1095890.1095904"},{"issue":"3","key":"e_1_3_2_1_24_1","first-page":"6","volume":"6","author":"Adiletta M.","year":"2002","unstructured":"M. Adiletta , The Next Generation of Intel IXP Network Processors ,\" Intel Technology Journal , vol. 6 , no 3 , pp. 6 -- 18 , 2002 . M. Adiletta, et al. \"The Next Generation of Intel IXP Network Processors,\" Intel Technology Journal, vol. 6, no 3, pp. 6--18, 2002.","journal-title":"Intel Technology Journal"},{"key":"e_1_3_2_1_25_1","series-title":"SIAM Journal on Computing 2 (4): 225--231.","volume-title":"An n5\/2 algorithm for maximum matchings in bipartite graphs","author":"Karp John","year":"1973","unstructured":"Hopcroft, John E.; Karp , Richard M. ( 1973 ), \" An n5\/2 algorithm for maximum matchings in bipartite graphs \", SIAM Journal on Computing 2 (4): 225--231. Hopcroft, John E.; Karp, Richard M. (1973), \"An n5\/2 algorithm for maximum matchings in bipartite graphs\", SIAM Journal on Computing 2 (4): 225--231."},{"volume-title":"An Introduction to Genetic Algorithms","year":"1996","key":"e_1_3_2_1_26_1","unstructured":"Mitchell, Melanie , An Introduction to Genetic Algorithms , 1996 , MIT Press , Cambridge, MA . Mitchell, Melanie, An Introduction to Genetic Algorithms, 1996, MIT Press, Cambridge, MA."},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"crossref","unstructured":"D. Fotakis et. al \"Space efficient hash tables with worst case constant access time \" In STACS 2003.   D. Fotakis et. al \"Space efficient hash tables with worst case constant access time \" In STACS 2003.","DOI":"10.1007\/3-540-36494-3_25"},{"key":"e_1_3_2_1_28_1","volume-title":"proc. of the First USENIX Conference on File and Storage Technologies","author":"Quinlan S.","year":"2002","unstructured":"S. Quinlan and S. Dorward . Venti: a new approach to archival storage . In proc. of the First USENIX Conference on File and Storage Technologies , Monterey, CA , 2002 . S. Quinlan and S. Dorward. Venti: a new approach to archival storage. In proc. of the First USENIX Conference on File and Storage Technologies, Monterey, CA, 2002."},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1002\/spe.v37:6"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/195058.195412"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/871656.859652"},{"key":"e_1_3_2_1_32_1","first-page":"30","volume-title":"Proc. of SODA '04)","author":"Chazelle B.","year":"2004","unstructured":"B. Chazelle , J. Kilian , R. Rubinfeld , and A. Tal . The Bloomier Filter: An efficient data structure for static support lookup tables . In Proc. of SODA '04) , pages 30 -- 39 . ACM Press , 2004 . B. Chazelle, J. Kilian, R. Rubinfeld, and A. Tal. The Bloomier Filter: An efficient data structure for static support lookup tables. In Proc. of SODA '04), pages 30--39. ACM Press, 2004."},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(92)90220-P"},{"key":"e_1_3_2_1_34_1","volume-title":"Symp. on Information Theory","author":"Lu Y.","year":"2006","unstructured":"Y. Lu , B. Prabhakar , and F. Bonomi , \" Perfect hashing for network applications,\" Proc . Symp. on Information Theory , 2006 . Y. Lu, B. Prabhakar, and F. Bonomi, \"Perfect hashing for network applications,\" Proc. Symp. on Information Theory, 2006."},{"key":"e_1_3_2_1_35_1","volume-title":"Simple and space-efficient minimal perfect hash functions,\" Springer-Verlag LNCS","author":"Botelho F. C.","year":"2007","unstructured":"F. C. Botelho , R. Pagh , and N. Ziviani , \" Simple and space-efficient minimal perfect hash functions,\" Springer-Verlag LNCS , 2007 . F. C. Botelho, R. Pagh, and N. Ziviani, \"Simple and space-efficient minimal perfect hash functions,\" Springer-Verlag LNCS, 2007."}],"event":{"name":"ANCS '09: Symposium on Architecture for Networking and Communications Systems","sponsor":["SIGCOMM ACM Special Interest Group on Data Communication","SIGARCH ACM Special Interest Group on Computer Architecture","IEEE-CS\\TCCA TC on Computer Arhitecture"],"location":"Princeton New Jersey","acronym":"ANCS '09"},"container-title":["Proceedings of the 5th ACM\/IEEE Symposium on Architectures for Networking and Communications Systems"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1882486.1882519","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1882486.1882519","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T10:59:34Z","timestamp":1750244374000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1882486.1882519"}},"subtitle":["algorithm for deterministic and fast hash lookups"],"short-title":[],"issued":{"date-parts":[[2009,10,19]]},"references-count":34,"alternative-id":["10.1145\/1882486.1882519","10.1145\/1882486"],"URL":"https:\/\/doi.org\/10.1145\/1882486.1882519","relation":{},"subject":[],"published":{"date-parts":[[2009,10,19]]},"assertion":[{"value":"2009-10-19","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}