{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:42:36Z","timestamp":1750308156514,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":10,"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.1095919","type":"proceedings-article","created":{"date-parts":[[2005,11,7]],"date-time":"2005-11-07T17:34:39Z","timestamp":1131384879000},"page":"203-210","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":4,"title":["Optimal XOR hashing for a linearly distributed address lookup in computer networks"],"prefix":"10.1145","author":[{"given":"Christopher J.","family":"Martinez","sequence":"first","affiliation":[{"name":"University of Texas at San Antonio, San Antonio, TX"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wei-Ming","family":"Lin","sequence":"additional","affiliation":[{"name":"University of Texas at San Antonio, San Antonio, TX"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Parimal","family":"Patel","sequence":"additional","affiliation":[{"name":"University of Texas at San Antonio, San Antonio, TX"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2005,10,26]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"D.E.Knuth Selected Papers on Analysis of Algorithms,\" CSLI Stanford CA","author":"Amble Ole","year":"2000","unstructured":"Ole Amble and Donald E . Knuth, \"Ordered Hash Tables . Chapter 7 in D.E.Knuth Selected Papers on Analysis of Algorithms,\" CSLI Stanford CA ,, 2000 . Ole Amble and Donald E. Knuth, \"Ordered Hash Tables. Chapter 7 in D.E.Knuth Selected Papers on Analysis of Algorithms,\" CSLI Stanford CA,, 2000."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_2_1","DOI":"10.1109\/INFCOM.2001.916641"},{"key":"e_1_3_2_1_3_1","volume-title":"International Conference on Computer Networks and Mobile Computing","author":"Chung Sang-Hun","year":"2001","unstructured":"Sang-Hun Chung , J. Sungkee , Hyunsoo Yoon , Jung-Wan Cho , \" A Fast and Updatable IP Address Lookup Scheme\" , International Conference on Computer Networks and Mobile Computing , 2001 . Sang-Hun Chung, J. Sungkee, Hyunsoo Yoon, Jung-Wan Cho, \"A Fast and Updatable IP Address Lookup Scheme\", International Conference on Computer Networks and Mobile Computing, 2001."},{"doi-asserted-by":"crossref","unstructured":"Raj Jain \"A Comparison of Hashing Schemes for Address Lookup in Computer Networks \" IEEE Transactions on Communications October 1992 p.1570--p.1573.  Raj Jain \"A Comparison of Hashing Schemes for Address Lookup in Computer Networks \" IEEE Transactions on Communications October 1992 p.1570--p.1573.","key":"e_1_3_2_1_4_1","DOI":"10.1109\/26.168785"},{"key":"e_1_3_2_1_5_1","volume-title":"Sorting and Searching","author":"Knuth Donald E.","year":"1998","unstructured":"Donald E. Knuth , \" The Art of Computer Programming ,\" Vol 3 : Sorting and Searching . 2 nd Ed., Addison-Wesley , Reading MA ,, 1998 . Donald E. Knuth, \"The Art of Computer Programming,\" Vol 3: Sorting and Searching. 2nd Ed., Addison-Wesley, Reading MA,, 1998.","edition":"2"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_6_1","DOI":"10.1109\/35.568212"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_7_1","DOI":"10.1109\/INFCOM.2002.1019300"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_8_1","DOI":"10.1109\/MILCOM.1996.569200"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_9_1","DOI":"10.1109\/GLOCOM.2000.892085"},{"key":"e_1_3_2_1_10_1","first-page":"1556","volume-title":"Global Telecommunications Conference,, Globecom '99","author":"Yu Daxiao","unstructured":"Daxiao Yu , Brandon Smith , and Belle Wei , \" Forwarding Engine for Fast Routing Lookups and Updates,\" Global Telecommunications Conference,, Globecom '99 , p. 1556 --p.1564. Daxiao Yu, Brandon Smith, and Belle Wei, \"Forwarding Engine for Fast Routing Lookups and Updates,\" Global Telecommunications Conference,, Globecom '99, p.1556--p.1564."}],"event":{"sponsor":["SIGCOMM ACM Special Interest Group on Data Communication","ACM Association for Computing Machinery","SIGARCH ACM Special Interest Group on Computer Architecture"],"acronym":"ANCS05","name":"ANCS05: Symposium on Architecture for Networking and Communications Systems 2005","location":"Princeton NJ USA"},"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.1095919","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1095890.1095919","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.1095919"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005,10,26]]},"references-count":10,"alternative-id":["10.1145\/1095890.1095919","10.1145\/1095890"],"URL":"https:\/\/doi.org\/10.1145\/1095890.1095919","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"}}]}}