{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T08:21:07Z","timestamp":1725524467519},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540959472"},{"type":"electronic","value":"9783540959489"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-540-95948-9_43","type":"book-chapter","created":{"date-parts":[[2009,1,31]],"date-time":"2009-01-31T10:58:14Z","timestamp":1233399494000},"page":"429-438","source":"Crossref","is-referenced-by-count":1,"title":["Smart Enumeration: A Systematic Approach to Exhaustive Search"],"prefix":"10.1007","author":[{"given":"Tim","family":"Todman","sequence":"first","affiliation":[]},{"given":"Haohuan","family":"Fu","sequence":"additional","affiliation":[]},{"given":"Brittle","family":"Tsoi","sequence":"additional","affiliation":[]},{"given":"Oskar","family":"Mencer","sequence":"additional","affiliation":[]},{"given":"Wayne","family":"Luk","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"43_CR1","doi-asserted-by":"crossref","unstructured":"Keutzer, K.: Dagon: Technology binding and local optimization by dag matching. In: Proc. DAC, pp. 341\u2013347 (1987)","DOI":"10.1145\/37888.37940"},{"key":"43_CR2","doi-asserted-by":"crossref","unstructured":"Francis, R., Rose, J., Vranesic, Z.: Chortle-crf: Fast technology mapping for lookup table-based FPGAs. In: Proc. DAC, pp. 227\u2013233 (1991)","DOI":"10.1145\/127601.127670"},{"key":"43_CR3","doi-asserted-by":"crossref","unstructured":"Cong, J., Ding, Y.: On area\/depth trade-off in LUT-based FPGA technology mapping. In: Proc. DAC, pp. 213\u2013218 (1993)","DOI":"10.1145\/157485.164675"},{"key":"43_CR4","doi-asserted-by":"crossref","unstructured":"Cong, J., Wu, C., Ding, Y.: Cut ranking and pruning: enabling a general and efficient FPGA mapping solution. In: Proc. FPGA, pp. 29\u201335 (1999)","DOI":"10.1145\/296399.296425"},{"key":"43_CR5","doi-asserted-by":"crossref","unstructured":"Ling, A., Singh, D., Brown, S.: FPGA technology mapping: A study of optimality. In: Proc. DAC (2005)","DOI":"10.1145\/1065579.1065693"},{"key":"43_CR6","doi-asserted-by":"crossref","unstructured":"Safarpour, S., Veneris, A., Baeckler, G., Yuan, R.: Efficient SAT-based boolean matching for FPGA technology mapping. In: Proc. DAC (2006)","DOI":"10.1145\/1146909.1147034"},{"key":"43_CR7","doi-asserted-by":"crossref","unstructured":"Cong, J., Minkovich, K.: Improved SAT-based boolean matching using implicants for lut-based fpgas. In: Proc. FPGA (2007)","DOI":"10.1145\/1216919.1216944"},{"key":"43_CR8","doi-asserted-by":"crossref","unstructured":"Kravets, V., Kudva, P.: Implicit enumeration of structural changes in circuit optimization. In: Proc. DAC, pp. 438\u2013441 (2004)","DOI":"10.1145\/996566.996691"},{"key":"43_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"18","DOI":"10.1007\/3-540-44411-4_2","volume-title":"SOFSEM 2000: Theory and Practice of Informatics","author":"J. Nievergelt","year":"2000","unstructured":"Nievergelt, J.: Exhaustive search, combinatorial optimization and enumeration: Exploring the potential of raw computing power. In: Jeffery, K., Hlav\u00e1\u010d, V., Wiedermann, J. (eds.) SOFSEM 2000. LNCS, vol.\u00a01963, pp. 18\u201335. Springer, Heidelberg (2000)"},{"key":"43_CR10","volume-title":"Synthesis and Optimization of Digital Circuits","author":"G.D. Micheli","year":"1994","unstructured":"Micheli, G.D.: Synthesis and Optimization of Digital Circuits. McGraw-Hill, New York (1994)"},{"key":"43_CR11","volume-title":"Concrete Mathematics: A Foundation for Computer Science","author":"R.L. Graham","year":"1989","unstructured":"Graham, R.L., Knuth, D.E., Patashnik, O.: Concrete Mathematics: A Foundation for Computer Science. Addison-Wesley, Reading (1989)"},{"key":"43_CR12","doi-asserted-by":"crossref","unstructured":"Mencer, O.: ASC, a stream compiler for computing with FPGAs. IEEE Trans. on CAD (2006)","DOI":"10.1109\/TCAD.2005.857377"},{"key":"43_CR13","unstructured":"RASP \u2013 LUT-Based FPGA Technology Mapping Package, release b1.1. UCLA VLSI CAD lab, http:\/\/cadlab.cs.ucla.edu\/software_release\/rasp\/htdocs\/"},{"key":"43_CR14","doi-asserted-by":"crossref","unstructured":"Plaza, S., Bertacco, V.: STACCATO: Disjoint support decompositions from bdds through symbolic kernels. In: Proc. Asia South Pacific Design Conference (2005)","DOI":"10.1145\/1120725.1120848"},{"key":"43_CR15","doi-asserted-by":"crossref","unstructured":"Chen, D., Cong, J.: DAOmap: A depth-optimal area optimization mapping algorithm for FPGA designs. In: Proc. ICCAD, pp. 752\u2013759 (November 2004)","DOI":"10.1109\/ICCAD.2004.1382677"},{"key":"43_CR16","doi-asserted-by":"crossref","unstructured":"Cong, J., Ding, Y.: FlowMap: An optimal technology mapping algorithm for delay optimization in lookup-table based FPGA designs. IEEE Trans. on CAD of ICs and Systems\u00a013(1) (January 1994)","DOI":"10.1109\/43.273754"},{"key":"43_CR17","unstructured":"Tsoi, B.: The cube project, http:\/\/www.doc.ic.ac.uk\/~khtsoi\/Welcome.html"}],"container-title":["Lecture Notes in Computer Science","Integrated Circuit and System Design. Power and Timing Modeling, Optimization and Simulation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-95948-9_43","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,17]],"date-time":"2019-05-17T14:24:13Z","timestamp":1558103053000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-95948-9_43"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783540959472","9783540959489"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-95948-9_43","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}