{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:31:37Z","timestamp":1750307497650,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":15,"publisher":"ACM","license":[{"start":{"date-parts":[[2009,8,19]],"date-time":"2009-08-19T00:00:00Z","timestamp":1250640000000},"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,8,19]]},"DOI":"10.1145\/1594233.1594333","type":"proceedings-article","created":{"date-parts":[[2009,8,24]],"date-time":"2009-08-24T14:08:35Z","timestamp":1251122915000},"page":"389-394","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":3,"title":["Low power fast and dense longest prefix match content addressable memory for IP routers"],"prefix":"10.1145","author":[{"given":"Satendra Kumar","family":"Maurya","sequence":"first","affiliation":[{"name":"Arizona State University, Tempe, AZ, USA"}]},{"given":"Lawrence T.","family":"Clark","sequence":"additional","affiliation":[{"name":"Arizona State University, Tempe, AZ, USA"}]}],"member":"320","published-online":{"date-parts":[[2009,8,19]]},"reference":[{"key":"e_1_3_2_1_1_1","unstructured":"Baker F. RFC1812\"2.2.5.2ClasslessInterDomain Routing (CIDR)\". Online: http:\/\/rfc.sunsite.dk\/rfc\/rfc1812.html."},{"key":"e_1_3_2_1_2_1","volume-title":"Technical report","author":"Sklower K.","year":"1993","unstructured":"Sklower, K., A Tree-Based Routing Table for Berkeley Unix, Technical report, University of California, Berkeley, 1993."},{"volume-title":"Proc. IEEE INFOCOM (March 1998)","author":"Gupta P.","key":"e_1_3_2_1_3_1","unstructured":"Gupta, P., Lin, S., McKeown, N., \"Routing Lookups in Hardware at Memory Access Speeds\", Proc. IEEE INFOCOM (March 1998) 1240--1247."},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.5555\/850923.851470"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1109\/65.120723"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/263109.263133"},{"key":"e_1_3_2_1_7_1","volume-title":"IEEE INFOCOM","volume":"3","author":"Huang N.","year":"1999","unstructured":"Huang, N., Zhao, S., Pan, J., Su, C., \"A fast IP routing lookup scheme for gigabit switching routers,\" Proc. IEEE INFOCOM, vol. 3 (March 1999) 1429--436."},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1109\/JSSC.2005.864128"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.1993.253403"},{"key":"e_1_3_2_1_10_1","first-page":"1576","article-title":"High-speed table lookup engine for IPv6 longest prefix match","volume":"2","author":"Hayashi T.","year":"1999","unstructured":"Hayashi, T. and Miyazaki, T., \"High-speed table lookup engine for IPv6 longest prefix match,\" in Proc. IEEE GLOBECOM vol.2 (Dec. 1999) 1576--1581.","journal-title":"Proc. IEEE GLOBECOM"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1109\/TVLSI.2006.871760"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1109\/TVLSI.2006.878476"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.5555\/822073.822370"},{"key":"e_1_3_2_1_14_1","unstructured":"Online: http:\/\/www-03.ibm.com\/technology\/foundry."},{"key":"e_1_3_2_1_15_1","unstructured":"Online: http:\/\/bgp.potaroo.net."}],"event":{"name":"ISLPED'09: International Symposium on Low Power Electronics and Design","sponsor":["ACM Association for Computing Machinery","SIGDA ACM Special Interest Group on Design Automation"],"location":"San Fancisco CA USA","acronym":"ISLPED'09"},"container-title":["Proceedings of the 2009 ACM\/IEEE international symposium on Low power electronics and design"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1594233.1594333","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1594233.1594333","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T12:17:42Z","timestamp":1750249062000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1594233.1594333"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,8,19]]},"references-count":15,"alternative-id":["10.1145\/1594233.1594333","10.1145\/1594233"],"URL":"https:\/\/doi.org\/10.1145\/1594233.1594333","relation":{},"subject":[],"published":{"date-parts":[[2009,8,19]]},"assertion":[{"value":"2009-08-19","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}