{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,11]],"date-time":"2025-06-11T09:47:38Z","timestamp":1749635258174,"version":"3.28.0"},"reference-count":20,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010,3]]},"DOI":"10.1109\/date.2010.5456921","type":"proceedings-article","created":{"date-parts":[[2013,2,19]],"date-time":"2013-02-19T18:16:33Z","timestamp":1361297793000},"page":"926-931","source":"Crossref","is-referenced-by-count":3,"title":["A memory- and time-efficient on-chip TCAM minimizer for IP lookup"],"prefix":"10.1109","author":[{"family":"Heeyeol Yu","sequence":"first","affiliation":[]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/DAC.2003.1219019"},{"key":"ref11","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4613-2821-6","article-title":"Logic Minimization Algorithms for VLSI Synthesis","author":"brayton","year":"1984"},{"key":"ref12","first-page":"521","article-title":"The Problem of Simplifying Truth Tables","volume":"59","author":"quine","year":"1952"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1002\/j.1538-7305.1956.tb03835.x"},{"journal-title":"Internet Groth Summary","year":"0","author":"gray","key":"ref14"},{"journal-title":"BGP Routing Tables Analysis Report","year":"0","key":"ref15"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2005.855944"},{"article-title":"Introduction to Algorithms","year":"1990","author":"cormen","key":"ref17"},{"journal-title":"Computer Architecture A Quantitative Approach","year":"1990","author":"patterson","key":"ref18"},{"key":"ref19","article-title":"Analyzing the Internet's BGP routing table","volume":"4","author":"huston","year":"2001","journal-title":"Internet Protocol Journal"},{"key":"ref4","article-title":"Chisel: A Storage-Efficient, Collision-free Hash-based Network Processing Architecture","author":"hasan","year":"0","journal-title":"ISCA'06 Proceeding of the 33rd International Symposium on Computer Architecture"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1145\/1080091.1080114"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TC.2005.78"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/MM.2004.1289292"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/40.988690"},{"journal-title":"Linleygroup","article-title":"A Guide to Search Engines and Networking Memory","year":"2006","key":"ref7"},{"key":"ref2","article-title":"Fast Incremental Updates for Pipelined Forwarding Engines","volume":"13","author":"bataillon","year":"2005","journal-title":"IEEE\/ACM Trans Netw"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1145\/997150.997160"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TVLSI.2007.902202"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/ISPASS.2006.1620796"}],"event":{"name":"2010 Design, Automation & Test in Europe Conference & Exhibition (DATE 2010)","start":{"date-parts":[[2010,3,8]]},"location":"Dresden","end":{"date-parts":[[2010,3,12]]}},"container-title":["2010 Design, Automation & Test in Europe Conference & Exhibition (DATE 2010)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/5450668\/5456897\/05456921.pdf?arnumber=5456921","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,21]],"date-time":"2017-06-21T07:48:24Z","timestamp":1498031304000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/5456921\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,3]]},"references-count":20,"URL":"https:\/\/doi.org\/10.1109\/date.2010.5456921","relation":{},"subject":[],"published":{"date-parts":[[2010,3]]}}}