{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,8,7]],"date-time":"2024-08-07T22:40:02Z","timestamp":1723070402175},"reference-count":0,"publisher":"Wiley","issue":"1","license":[{"start":{"date-parts":[[2000,1,1]],"date-time":"2000-01-01T00:00:00Z","timestamp":946684800000},"content-version":"vor","delay-in-days":103,"URL":"http:\/\/creativecommons.org\/licenses\/by\/3.0\/"}],"content-domain":{"domain":["onlinelibrary.wiley.com"],"crossmark-restriction":true},"short-container-title":["VLSI Design"],"published-print":{"date-parts":[[2001,1]]},"abstract":"<jats:p>Transistor folding reduces the area of row\u2010based designs that employ transistors of\ndifferent size. Kim and Kang [1] have developed an <jats:italic>O<\/jats:italic>(<jats:italic>m<\/jats:italic><jats:sup>2<\/jats:sup> log <jats:italic>m<\/jats:italic>) algorithm to optimally fold <jats:italic>m<\/jats:italic> transistor pairs. In this paper we develop an <jats:italic>O<\/jats:italic>(<jats:italic>m<\/jats:italic><jats:sup>2<\/jats:sup>) algorithm for optimal transistor folding. Our experiments indicate that our algorithm runs 3 to 60 times as fast\nfor <jats:italic>m<\/jats:italic> values in the range (100, 100,000).<\/jats:p>","DOI":"10.1155\/2001\/96353","type":"journal-article","created":{"date-parts":[[2007,9,18]],"date-time":"2007-09-18T12:59:02Z","timestamp":1190120342000},"page":"53-60","update-policy":"http:\/\/dx.doi.org\/10.1002\/crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["A Fast Algorithm for Transistor Folding"],"prefix":"10.1155","volume":"12","author":[{"given":"Edward Y. C.","family":"Cheng","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sartaj","family":"Sahni","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"311","published-online":{"date-parts":[[1999,9,20]]},"container-title":["VLSI Design"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/downloads.hindawi.com\/archive\/2001\/096353.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/downloads.hindawi.com\/journals\/vlsi\/2001\/096353.xml","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1155\/2001\/96353","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,8,7]],"date-time":"2024-08-07T22:23:24Z","timestamp":1723069404000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1155\/2001\/96353"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999,9,20]]},"references-count":0,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2001,1]]}},"alternative-id":["10.1155\/2001\/96353"],"URL":"https:\/\/doi.org\/10.1155\/2001\/96353","archive":["Portico"],"relation":{},"ISSN":["1065-514X","1563-5171"],"issn-type":[{"type":"print","value":"1065-514X"},{"type":"electronic","value":"1563-5171"}],"subject":[],"published":{"date-parts":[[1999,9,20]]},"assertion":[{"value":"1999-07-13","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"1999-09-20","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}