{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T15:41:45Z","timestamp":1725550905242},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540441083"},{"type":"electronic","value":"9783540461173"}],"license":[{"start":{"date-parts":[[2002,1,1]],"date-time":"2002-01-01T00:00:00Z","timestamp":1009843200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-46117-5_38","type":"book-chapter","created":{"date-parts":[[2010,3,29]],"date-time":"2010-03-29T21:14:23Z","timestamp":1269897263000},"page":"360-369","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Hybrid Routing for FPGAs by Integrating Boolean Satisfiability with Geometric Search"],"prefix":"10.1007","author":[{"given":"Gi-Joon","family":"Nam","sequence":"first","affiliation":[]},{"given":"Karem","family":"Sakallah","sequence":"additional","affiliation":[]},{"given":"Rob","family":"Rutenbar","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2002,8,16]]},"reference":[{"key":"38_CR1","doi-asserted-by":"crossref","unstructured":"V. Betz and J. Rose, \u201cVPR: A New Packing, Placement and Routing Tool for FPGA Research,\u201d the Seventh Annual Workshop on Field Programmable Logic and Applications, pp.213\u2013222, 1997.","DOI":"10.1007\/3-540-63465-7_226"},{"issue":"5","key":"38_CR2","doi-asserted-by":"crossref","first-page":"620","DOI":"10.1109\/43.127623","volume":"11","author":"S. Brown","year":"1992","unstructured":"S. Brown, J. Rose, and Z. G. Vranesic, \u201cA Detailed Router for Field Programmable Gate Arrays,\u201d IEEE Transactions on CAD, pp. 620\u2013628, vol. 11, no. 5, May 1992.","journal-title":"IEEE Transactions on CAD"},{"key":"38_CR3","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4615-3572-0","volume-title":"Field Programmable Gate Arrays","author":"S. D. Brown","year":"1992","unstructured":"S. D. Brown, R.J. Francis, J. Rose, and Z.G. Vranesic, Field Programmable Gate Arrays, Boston, Kluwer Acad. Publishers, 1992."},{"key":"38_CR4","unstructured":"M. R. Garey and D. S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness, W.H.Freeman and Company, 1979."},{"key":"38_CR5","doi-asserted-by":"crossref","unstructured":"A. Hashimoto and J. Stevens, \u201cWire Routing by Optimizing Channel Assignment within Large Apertures\u201d, Proceedings of 8th Design Automation Conference, pp. 155\u2013169, 1971.","DOI":"10.1145\/800158.805069"},{"key":"38_CR6","unstructured":"G. Lemieux and S. Brown, \u201cA Detailed Router for Allocating Wire Segments in FPGAs,\u201d Proc. ACM Physical Design Workshop, California, Apr. 1993."},{"key":"38_CR7","doi-asserted-by":"crossref","unstructured":"J. P. Marques-Silva and K. A. Sakallah, \u201cGRASP: A Search Algorithm for Propositional Sat-isfiability\u201d, IEEE Transactions on Computers, vol. 48, no. 5, May 1999.","DOI":"10.1109\/12.769433"},{"key":"38_CR8","doi-asserted-by":"crossref","unstructured":"L. E. McMurchie and C. Ebeling, \u201cPathFinder: A Negotiation-Based Path-Driven Router for FPGAs,\u201d Proc. ACM\/IEEE Intl. Symposium on Field Programmable Gate Arrays, Feb. 1995.","DOI":"10.1109\/FPGA.1995.242049"},{"key":"38_CR9","unstructured":"G.-J Nam, S. Kalman, J. Anderson, R. Jayaraman, S. Nag and J. Zhuang, \u201cA Method and Apparatus for Testing Routability\u201d, U.S. patent pending."},{"key":"38_CR10","doi-asserted-by":"crossref","unstructured":"G.-J Nam, K. A. Sakallah, and R. A. Rutenbar, \u201cSatisfiability-Based Layout Revisited: Detailed Routing of Complex FPGAs Via Search-Based Boolean SAT\u201d, Intl. Sym. on FPGAs, Feb. 1999.","DOI":"10.1145\/296399.296450"},{"key":"38_CR11","doi-asserted-by":"crossref","unstructured":"G.-J Nam, F. Aloul, K. A. Sakallah and R. A. Rutenbar, \u201cA Comparative Study of Two Boolean Formulations of FPGA Detailed Routing Constraints\u201d, Intl. Symp. on Physical Design, April 2001.","DOI":"10.1145\/369691.369777"},{"key":"38_CR12","doi-asserted-by":"crossref","unstructured":"R. G. Wood and R. A. Rutenbar, \u201cFPGA Routing and Routability Estimation Via Boolean Satisfiability,\u201d IEEE Transactions on VLSI Systems, pp. 222\u2013231, June 1998.","DOI":"10.1109\/92.678873"}],"container-title":["Lecture Notes in Computer Science","Field-Programmable Logic and Applications: Reconfigurable Computing Is Going Mainstream"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-46117-5_38","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T15:00:55Z","timestamp":1558278055000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-46117-5_38"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540441083","9783540461173"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/3-540-46117-5_38","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2002]]},"assertion":[{"value":"16 August 2002","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}