{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,2]],"date-time":"2025-03-02T05:59:27Z","timestamp":1740895167884,"version":"3.38.0"},"reference-count":137,"publisher":"Elsevier","isbn-type":[{"type":"print","value":"9780120121328"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1991]]},"DOI":"10.1016\/s0065-2458(08)60245-4","type":"book-chapter","created":{"date-parts":[[2011,1,19]],"date-time":"2011-01-19T05:56:15Z","timestamp":1295416575000},"page":"1-103","source":"Crossref","is-referenced-by-count":4,"title":["Computer-Aided Logic Synthesis for VLSI Chips"],"prefix":"10.1016","author":[{"given":"Saburo","family":"Muroga","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"year":"1981","series-title":"A Study of NOR\/NAND Networks","author":"Alkhateeb","key":"10.1016\/S0065-2458(08)60245-4_bib1"},{"key":"10.1016\/S0065-2458(08)60245-4_bib2","unstructured":"D. Alkhateeb S. Kawasaki S. Muroga (1980). An Improvement of a Branch-and-Bound Algorithm for Designing NOR Optimal Networks. Rep. no. UIUCDCS-R-80\u20131033. Dept. of Computer Science, University of Illinois, Urbana."},{"issue":"4","key":"10.1016\/S0065-2458(08)60245-4_bib3","doi-asserted-by":"crossref","first-page":"517","DOI":"10.1287\/opre.13.4.517","article-title":"An additive Algorithm for Solving Linear Programs with Zero-One Variables","volume":"13","author":"Balas","year":"1965","journal-title":"Operations Research"},{"issue":"4","key":"10.1016\/S0065-2458(08)60245-4_bib4","first-page":"1971","article-title":"Computational Experience in All-Integer, Binary-Variable, Integer-Programming Problems Using Gomory's All-Integer Algorithm. Rep. no. 259. Dept. of Computer Science, University of Illinois, Urbana","volume":"19","author":"Baugh","year":"1968","journal-title":"Also Jour. Operations Research"},{"year":"1969","series-title":"Optimum Network Design Using NOR and NOR-AND Gates by Integer Programming","author":"Baugh","key":"10.1016\/S0065-2458(08)60245-4_bib5"},{"key":"10.1016\/S0065-2458(08)60245-4_bib6","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1109\/TC.1972.5008920","article-title":"Optimal Networks of NOR-OR Gates for Functions of Three Variables","volume":"C-21","author":"Baugh","year":"1972","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/S0065-2458(08)60245-4_bib7","first-page":"40","article-title":"Production Applications for Logic Synthesis and Optimization","author":"Bohm","year":"1988","journal-title":"VLSI System Design"},{"key":"10.1016\/S0065-2458(08)60245-4_bib8","first-page":"62","article-title":"The Boulder Optimal Logic Design System","author":"Bostick","year":"1987","journal-title":"Proc. International Conference on Computer-Aided Design"},{"key":"10.1016\/S0065-2458(08)60245-4_bib9","first-page":"225","article-title":"The YORKTOWN Silicon Compiler","author":"Brayton","year":"1985","journal-title":"Proc. International Symposium on Circuits and Systems"},{"key":"10.1016\/S0065-2458(08)60245-4_bib10","article-title":"A Microprocessor Design Using the Yorktown Silicon Compiler","author":"Brayton","year":"1985","journal-title":"Proc. International Conference on Computer Design"},{"issue":"2","key":"10.1016\/S0065-2458(08)60245-4_bib11","doi-asserted-by":"crossref","first-page":"264","DOI":"10.1109\/5.52213","article-title":"Multilevel Logic Synthesis","volume":"78","author":"Brayton","year":"1990","journal-title":"Proc. IEEE"},{"key":"10.1016\/S0065-2458(08)60245-4_bib12","first-page":"23","article-title":"Synthesis and Optimization of Multistage Logic","author":"Brayton","year":"1984","journal-title":"Proc. International Conference on Computer Design"},{"key":"10.1016\/S0065-2458(08)60245-4_bib13","first-page":"1062","article-title":"MIS: A Multiple-Level Logic Optimization","volume":"6","author":"Brayton","year":"1987","journal-title":"IEEE TCAD"},{"issue":"12","key":"10.1016\/S0065-2458(08)60245-4_bib14","doi-asserted-by":"crossref","first-page":"1708","DOI":"10.1109\/PROC.1966.5252","article-title":"General Survey of Design Automation of Digital Computers","volume":"54","author":"Breuer","year":"1966","journal-title":"Proc. IEEE"},{"issue":"2","key":"10.1016\/S0065-2458(08)60245-4_bib15","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1109\/PGEC.1965.264057","article-title":"NAND-AND Circuits","volume":"EC-14","author":"Burke","year":"1965","journal-title":"IEEE Trans. Electron. Comput."},{"key":"10.1016\/S0065-2458(08)60245-4_bib16","first-page":"552","article-title":"SYLON-DREAM: A Multi-Level Network Synthesizer","author":"Chen","year":"1989","journal-title":"Proc. International Conference on Computer-Aided Design"},{"key":"10.1016\/S0065-2458(08)60245-4_bib17","unstructured":"K.-C. Chen S. Muroga (1990). Timing Optimization for Multi-Level Combinational Networks, Proc. 27th Design Automation Conference, Florida, June 25\u201327, 339\u2013344."},{"year":"1982","series-title":"Minimal Parallel Binary Adders with AND\/OR Gates and a Scheme for a Compact Parallel Multiplier","author":"Cheng","key":"10.1016\/S0065-2458(08)60245-4_bib18"},{"issue":"6","key":"10.1016\/S0065-2458(08)60245-4_bib19","doi-asserted-by":"crossref","first-page":"547","DOI":"10.1080\/00207176708921824","article-title":"Some Studies on the Problem of Three Level NAND Network Synthesis","volume":"6","author":"Choudhury","year":"1967","journal-title":"Intl. J. Contr."},{"year":"1971","series-title":"On the Synthesis by Integer Programming of Optimal NOR Gate Networks for Four Variable Switching Functions","author":"Culliney","key":"10.1016\/S0065-2458(08)60245-4_bib20"},{"year":"1975","series-title":"Program Manual: NOR Network Transduction Based on Connectable and Disconnectable Conditions (Reference manual of NOR network transduction programs NETTRA-G1 and NETTRA-G2). UIUCDCS-R-75\u2013698","author":"Culliney","key":"10.1016\/S0065-2458(08)60245-4_bib21"},{"year":"1977","series-title":"Topics in MOSFET Network Design","author":"Culliney","key":"10.1016\/S0065-2458(08)60245-4_bib22"},{"year":"1976","series-title":"A Study of Certain Factors Affecting Computation Times in Designing Optimal NOR Networks by the Implicit Enumeration Method Using the Feed-Forward Network Formulation","author":"Culliney","key":"10.1016\/S0065-2458(08)60245-4_bib23"},{"year":"1974","series-title":"Pruning Procedures for NOR Networks Using Permissible Functions (Principles of NOR Network Transduction Programs NETTRA-PG-1, NETTRA-P1 and NETTRA-P2)","author":"Culliney","key":"10.1016\/S0065-2458(08)60245-4_bib24"},{"year":"1976","series-title":"Results of the Synthesis of Optimal Networks of AND and OR Gates for Four-Variable Switching Functions by a Branch-and-Bound Computer Program","author":"Culliney","key":"10.1016\/S0065-2458(08)60245-4_bib25"},{"key":"10.1016\/S0065-2458(08)60245-4_bib26","doi-asserted-by":"crossref","first-page":"76","DOI":"10.1109\/TC.1979.1675229","article-title":"Results of the Synthesis of Optimal Networks of AND and OR Gates for Four-Variable Switching Functions","volume":"C-27","author":"Culliney","year":"1979","journal-title":"IEEE Trans. Comput."},{"issue":"5","key":"10.1016\/S0065-2458(08)60245-4_bib27","doi-asserted-by":"crossref","first-page":"537","DOI":"10.1147\/rd.285.0537","article-title":"LSS: A System for Production Logic Synthesis","volume":"28","author":"Darringer","year":"1984","journal-title":"IBM J. Res. Develop."},{"key":"10.1016\/S0065-2458(08)60245-4_bib28","first-page":"234","article-title":"Experiments in Logic Synthesis","author":"Darringer","year":"1980","journal-title":"Proc. International Conference on Circuits and Computers"},{"issue":"4","key":"10.1016\/S0065-2458(08)60245-4_bib29","doi-asserted-by":"crossref","first-page":"272","DOI":"10.1147\/rd.254.0272","article-title":"Logic Synthesis through Local Transformations","volume":"25","author":"Darringer","year":"1981","journal-title":"IBM J. Res. Develop."},{"key":"10.1016\/S0065-2458(08)60245-4_bib30","doi-asserted-by":"crossref","first-page":"1098","DOI":"10.1109\/T-C.1969.222593","article-title":"An Algorithm for NAND Decomposition under Network Constraints","volume":"C-18","author":"Davidson","year":"1969","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/S0065-2458(08)60245-4_bib31","first-page":"78","article-title":"Logic Synthesis and Optimization Benchmarks for the 1986 Design Automation Conference","author":"de Geus","year":"1986","journal-title":"Proc. Design Automation Conference"},{"year":"1987","series-title":"\u201cDesign Systems for VLSI Circuits\u2014Logic Synthesis and Silcon Compilation\u201d","author":"De Micheli","key":"10.1016\/S0065-2458(08)60245-4_bib32"},{"key":"10.1016\/S0065-2458(08)60245-4_bib33","first-page":"116","article-title":"Technology Mapping in MIS","author":"Detjens","year":"1987","journal-title":"Proc. International Conference on Computer-Aided Design"},{"key":"10.1016\/S0065-2458(08)60245-4_bib34","first-page":"868","article-title":"A Computer Oriented Factoring Algorithm for NOR Logic Design, IEEE Trans","volume":"EC-14","author":"Dietmeyer","year":"1965","journal-title":"Electron. Comput."},{"key":"10.1016\/S0065-2458(08)60245-4_bib35","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1109\/T-C.1969.222521","article-title":"Logic Design Automation of Fan-in Limited NAND Networks","volume":"C-18","author":"Dietmeyer","year":"1969","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/S0065-2458(08)60245-4_bib36","doi-asserted-by":"crossref","first-page":"701","DOI":"10.1109\/PGEC.1965.264209","article-title":"A Synthesis of Combinational Logic with NAND or NOR Elements","volume":"EC-14","author":"Ellis","year":"1965","journal-title":"IEEE Trans. Electron. Comput."},{"key":"10.1016\/S0065-2458(08)60245-4_bib37","doi-asserted-by":"crossref","first-page":"240","DOI":"10.1109\/DAC.1978.1585180","article-title":"Logic Design Automation of MOS Combinational Networks with Fan-in, Fan-out Constraints","author":"Ziq","year":"1978","journal-title":"Proc. 15th Design Automation Conference."},{"key":"10.1016\/S0065-2458(08)60245-4_bib38","first-page":"911","article-title":"Computer-Aided Logic Design of Two-Level MOS Combinational Networks with Statistical Results","author":"Ziq","year":"1978","journal-title":"IEEE TC"},{"year":"1982","series-title":"Logic Design of MOS Networks under Complexity Restrictions","author":"Fiduccia","key":"10.1016\/S0065-2458(08)60245-4_bib39"},{"issue":"1","key":"10.1016\/S0065-2458(08)60245-4_bib40","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1287\/opre.15.1.153","article-title":"Computational Experience with the Algorithm of Balas","volume":"15","author":"Fleischman","year":"1967","journal-title":"Operations Research"},{"key":"10.1016\/S0065-2458(08)60245-4_bib41","first-page":"593","article-title":"Methods Used in an Automatic Logic Design Generator (ALERT)","volume":"C-18","author":"Friedman","year":"1969","journal-title":"IEEE TC"},{"key":"10.1016\/S0065-2458(08)60245-4_bib42","doi-asserted-by":"crossref","unstructured":"T.D. Friedman S.C. Yang (1970). Quality of Designs from Automatic Logic Generator\u2014ALERT. Proc. 7th Design Automation Workshop, 71\u201389.","DOI":"10.1145\/800160.805114"},{"year":"1979","series-title":"Carry Propagation Delay in Minimum Parallel Binary Adders with NOR Gates","author":"Fukushima","key":"10.1016\/S0065-2458(08)60245-4_bib43"},{"issue":"2","key":"10.1016\/S0065-2458(08)60245-4_bib44","first-page":"178","article-title":"Integer Programming by Implicit Enumeration and Balas' method","volume":"9","author":"Geoffrion","year":"1967","journal-title":"SUM Rev."},{"key":"10.1016\/S0065-2458(08)60245-4_bib45","doi-asserted-by":"crossref","first-page":"18","DOI":"10.1109\/PGEC.1967.264603","article-title":"The Minimization of TANT Networks","volume":"EC-16","author":"Gimpel","year":"1967","journal-title":"IEEE Trans. Electron. Comput."},{"issue":"6","key":"10.1016\/S0065-2458(08)60245-4_bib46","doi-asserted-by":"crossref","first-page":"879","DOI":"10.1287\/opre.13.6.879","article-title":"A Multiphase-Dual Algorithm for the Zero-One Integer Programming Problem","volume":"13","author":"Glover","year":"1965","journal-title":"Operations Research"},{"key":"10.1016\/S0065-2458(08)60245-4_bib47","unstructured":"R.E. Gomory (1960). \u201cAn Algorithm for the Mixed Integer Problem.\u201d P-1885. Rand Corp."},{"key":"10.1016\/S0065-2458(08)60245-4_bib48","series-title":"\u201cIndustrial Scheduling\u201d","article-title":"An All-Integer Integer Programming Algorithm","author":"Gomory","year":"1963"},{"key":"10.1016\/S0065-2458(08)60245-4_bib49","first-page":"79","article-title":"SOCRATES: A System for Automatically Synthesizing and Optimizing Combinational Logic","author":"Gregory","year":"1986","journal-title":"Proc. Design Automation Conference"},{"key":"10.1016\/S0065-2458(08)60245-4_bib50","doi-asserted-by":"crossref","first-page":"198","DOI":"10.1109\/PGEC.1963.263531","article-title":"A Catalog of Three-Variable OR-Invert and AND-Invert Logic Circuits","volume":"EC-12","author":"Hellerman","year":"1963","journal-title":"IEEE Trans. Electron. Comput."},{"year":"1975","series-title":"Network Transduction Programs Based on Connectable and Disconnectable Conditions with Fan-in and Fan-out Restrictions (A Description of NETTRA-G1-FIFO and NETTRA-G2-FIFO)","author":"Hohulin","key":"10.1016\/S0065-2458(08)60245-4_bib51"},{"year":"1975","series-title":"A Code for Solving Network Synthesis Problems by Implicit Enumeration Using the All-Interconnection Inequality Formulation","author":"Hohulin","key":"10.1016\/S0065-2458(08)60245-4_bib52"},{"year":"1977","series-title":"NOR(NAND) Network Design: Error-Compensation Procedures for Fan-in and Fan-out Restricted Networks (NETTRA-E1-FIFO and NETTRA-E2-FIFO)","author":"Hu","key":"10.1016\/S0065-2458(08)60245-4_bib53"},{"year":"1977","series-title":"Level-Restricted NOR Network Transduction Procedures","author":"Hu","key":"10.1016\/S0065-2458(08)60245-4_bib54"},{"year":"1977","series-title":"Programming Manual for the NOR Network Transduction System","author":"Hu","key":"10.1016\/S0065-2458(08)60245-4_bib55"},{"year":"1978","series-title":"Logic Design Methods for Irredundant MOS Networks","author":"Hu","key":"10.1016\/S0065-2458(08)60245-4_bib56"},{"year":"1977","series-title":"NOR(NAND) Networks Transduction System (The principle of NETTRA system)","author":"Hu","key":"10.1016\/S0065-2458(08)60245-4_bib57"},{"issue":"6","key":"10.1016\/S0065-2458(08)60245-4_bib58","first-page":"698","article-title":"Gate-Interconnection Minimization of Switching Networks Using Negative Gates","volume":"C-20","author":"Ibaraki","year":"1971","journal-title":"IEEE TC"},{"year":"1969","series-title":"Synthesis of Networks with a Minimum Number of Negative Gates","author":"Ibaraki","key":"10.1016\/S0065-2458(08)60245-4_bib59"},{"year":"1969","series-title":"Implicit Enumeration Program for Zero-One Integer Programming Dept. of Computer Science","author":"Ibaraki","key":"10.1016\/S0065-2458(08)60245-4_bib60"},{"issue":"1","key":"10.1016\/S0065-2458(08)60245-4_bib61","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1007\/BF01108520","article-title":"Implicit Enumeration Program for Zero-One Integer Programming","volume":"1","author":"Ibaraki","year":"1972","journal-title":"Intl. Jour, of Computer and Information Sciences"},{"year":"1971","series-title":"Synthesis of Optimal Networks with NOR and NAND Gates by Integer Programming","author":"Ibaraki","key":"10.1016\/S0065-2458(08)60245-4_bib62"},{"issue":"7","key":"10.1016\/S0065-2458(08)60245-4_bib63","first-page":"55","article-title":"General Theory of Complete Sets of Logical Functions","volume":"46","author":"Ibuki","year":"1963","journal-title":"Electronics and Communications in Japan (IEEE translation)"},{"year":"1968","series-title":"A Table of Four-Variable Minimal NAND Circuits","author":"Ikeno","key":"10.1016\/S0065-2458(08)60245-4_bib64"},{"year":"1976","series-title":"NOR Network Transduction Procedures Based on Connectable and Disconnectable Conditions (Principles of NOR Network Transduction Programs NETTRA-G1 and NETTRA-G2)","author":"Kambayashi","key":"10.1016\/S0065-2458(08)60245-4_bib65"},{"year":"1976","series-title":"Network Transduction Based on Permissible Functions (General Principles of NOR Network Transduction NETTRA Programs)","author":"Kambayashi","key":"10.1016\/S0065-2458(08)60245-4_bib66"},{"key":"10.1016\/S0065-2458(08)60245-4_bib67","doi-asserted-by":"crossref","first-page":"550","DOI":"10.1109\/TC.1986.5009432","article-title":"Properties of Wired Logic","volume":"C-35","author":"Kambayashi","year":"1986","journal-title":"IEEE Trans. Comput."},{"year":"1975","series-title":"NOR Network Transduction Based on Error Compensation (Principles of NOR Network Transduction Programs NETTRA-E1, NETTRA-E2, NETTRA-E3)","author":"Kambayashi","key":"10.1016\/S0065-2458(08)60245-4_bib68"},{"year":"1990","series-title":"Pattern-Oriented Transformations of NOR Networks","author":"Kambayashi","key":"10.1016\/S0065-2458(08)60245-4_bib69"},{"year":"1980","series-title":"An Improvement of a Branch-and-Bound Algorithm for Designing NOR Optimal Networks","author":"Kawasaki","key":"10.1016\/S0065-2458(08)60245-4_bib70"},{"year":"1974","series-title":"Optimal Networks with NOR-OR Gates and Wired-OR Logic","author":"Kawasaki","key":"10.1016\/S0065-2458(08)60245-4_bib71"},{"year":"1975","series-title":"Program Manual: NOR Network Transduction by Generalized Gate Merging and Substitution (Reference Manual of NOR Network Transduction Programs NETTRA-G3 and NETTRA-G4)","author":"Lai","key":"10.1016\/S0065-2458(08)60245-4_bib72"},{"year":"1979","series-title":"Design of Diagnosable MOS Networks","author":"Lai","key":"10.1016\/S0065-2458(08)60245-4_bib73"},{"year":"1974","series-title":"Program Manual: NOR Network Pruning Procedures Using Permissible Functions (Reference Manual of NOR Network Transduction Programs NETTRA-PG1, NETTRA-P1 and NETTRA-P2)","author":"Lai","key":"10.1016\/S0065-2458(08)60245-4_bib74"},{"year":"1975","series-title":"Program Manual: NOR Network Transduction Based on Error Compensation (Reference Manual of NOR Network Transduction Programs NETTRA-E1, NETTRA-E2 and NETTRA-E3)","author":"Lai","key":"10.1016\/S0065-2458(08)60245-4_bib75"},{"year":"1975","series-title":"NOR Network Transduction by Generalized Gate Merging and Substitution Procedures (Principles of NOR Network Transduction Programs NETTRA-G3 and NETTRA-G4)","author":"Lai","key":"10.1016\/S0065-2458(08)60245-4_bib76"},{"key":"10.1016\/S0065-2458(08)60245-4_bib77","doi-asserted-by":"crossref","first-page":"648","DOI":"10.1109\/TC.1979.1675433","article-title":"Minimum Parallel Binary Adders with NOR (NAND) Gates","volume":"C-28","author":"Lai","year":"1979","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/S0065-2458(08)60245-4_bib78","doi-asserted-by":"crossref","first-page":"870","DOI":"10.1109\/TC.1982.1676102","article-title":"Logic Networks of Carry-Save Adders","volume":"C-31","author":"Lai","year":"1982","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/S0065-2458(08)60245-4_bib79","first-page":"287","article-title":"Automated Logic Design of MOS Networks","volume":"9","author":"Lai","year":"1985"},{"issue":"2","key":"10.1016\/S0065-2458(08)60245-4_bib80","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1109\/TC.1987.1676878","article-title":"Logic Networks with a Minimum Number of NOR (NAND) Gates for Parity Functions of n Variables","volume":"C-36","author":"Lai","year":"1987","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/S0065-2458(08)60245-4_bib81","first-page":"339","article-title":"Design of MOS Networks in Single-Rail Input Logic for Incompletely Specified Functions","volume":"7","author":"Lai","year":"1988","journal-title":"IEEE TCAD"},{"key":"10.1016\/S0065-2458(08)60245-4_bib82","doi-asserted-by":"crossref","first-page":"251","DOI":"10.1007\/BF00977257","article-title":"Redundancy Check Technique for Designing Optimal Networks by Branch-and-Bound Method","volume":"3","author":"Lai","year":"1974","journal-title":"Intl. Jour, of Computer and Information Sciences"},{"key":"10.1016\/S0065-2458(08)60245-4_bib83","first-page":"231","article-title":"Design of Testable MOS Networks and Test Set Generation","volume":"2","author":"Lai","year":"1990"},{"key":"10.1016\/S0065-2458(08)60245-4_bib84","doi-asserted-by":"crossref","first-page":"12","DOI":"10.1109\/T-C.1972.223426","article-title":"A Transform for NAND Network Design","volume":"C-21","author":"Lee","year":"1972","journal-title":"IEEE Trans. Comput."},{"year":"1974","series-title":"The Design of NOR Networks under Fan-in and Fan-out Constraints (A Programming Manual for FIFOTRAN-G1)","author":"Legge","key":"10.1016\/S0065-2458(08)60245-4_bib85"},{"year":"1988","series-title":"Algorithms for the Design of Irredundant MOS Networks","author":"Limqueco","key":"10.1016\/S0065-2458(08)60245-4_bib86"},{"key":"10.1016\/S0065-2458(08)60245-4_bib87","unstructured":"J.C. Limqueco S. Muroga (1990). SYLON-REDUCE: A MOS Network Optimization Algorithm Using Permissible Functions. Proc. International Conference on Computer Design, Cambridge, Massachusetts, Sept, 282\u2013285."},{"year":"1988","series-title":"Design of Optimal NOR Networks by an Extension of the Branch-and-Bound Method and the Transduction Method","author":"Lin","key":"10.1016\/S0065-2458(08)60245-4_bib88"},{"year":"1988","series-title":"Reference Manual of Fortran Program ILLOD-(NOR-B)-3 for Design of Optimal NOR Networks. Memo","author":"Lin","key":"10.1016\/S0065-2458(08)60245-4_bib89"},{"key":"10.1016\/S0065-2458(08)60245-4_bib90","unstructured":"R. Lisanke (1989). Logic Synthesis and Optimization Benchmarks User Guide, Version 2.0. Tech. Rep., Microelectronics Center of North Carolina, Research Triangle Park, N.C., Dec. 16, 1988. Distributed at International Workshop on Logic Synthesis, May 1989."},{"year":"1968","series-title":"A Code for Zero-One Integer Linear Programming by Implicit Enumeration","author":"Liu","key":"10.1016\/S0065-2458(08)60245-4_bib91"},{"year":"1972","series-title":"Synthesis of Logic Networks with MOS Complex Cells","author":"Liu","key":"10.1016\/S0065-2458(08)60245-4_bib92"},{"issue":"1","key":"10.1016\/S0065-2458(08)60245-4_bib93","first-page":"72","article-title":"Synthesis Algorithms for 2-Level MOS Networks","volume":"C-24","author":"Liu","year":"1975","journal-title":"IEEE TC"},{"key":"10.1016\/S0065-2458(08)60245-4_bib94","doi-asserted-by":"crossref","first-page":"581","DOI":"10.1109\/PROC.1977.10526","article-title":"Synthesis of Multilevel Feed-Forward MOS Networks","volume":"C-26","author":"Liu","year":"1977","journal-title":"IEEE TC"},{"key":"10.1016\/S0065-2458(08)60245-4_bib95","first-page":"826","article-title":"Synthesis of Feed-Forward MOS Networks with Cells of Similar Complexities","volume":"C-26","author":"Liu","year":"1977","journal-title":"IEEE TC"},{"key":"10.1016\/S0065-2458(08)60245-4_bib96","first-page":"63","article-title":"Optimal One-Bit Full Adders with Different Types of Gates","volume":"C-22","author":"Liu","year":"1974","journal-title":"IEEE Trans. Comput."},{"year":"1963","series-title":"\u201cThe Logical Design of Transistor Digital Computers\u201d","author":"Maley","key":"10.1016\/S0065-2458(08)60245-4_bib97"},{"key":"10.1016\/S0065-2458(08)60245-4_bib98","doi-asserted-by":"crossref","unstructured":"E.J. McCluskey (1963). Logical Design Theory of NOR Gate Networks with no Complemented Inputs. Proc. 4th Annu. Symp. on Switching Theory and Logical Design, 137\u2013148.","DOI":"10.1109\/SWCT.1963.9"},{"year":"1965","series-title":"Threshold Logic. Lecture notes of EE 497 and EE 498","author":"Muroga","key":"10.1016\/S0065-2458(08)60245-4_bib99"},{"key":"10.1016\/S0065-2458(08)60245-4_bib100","first-page":"283","article-title":"Logical Design of Optimal Digital Networks by Integer Programming","volume":"3","author":"Muroga","year":"1970"},{"year":"1971","series-title":"\u201cThreshold Logic and Its Applications\u201d","author":"Muroga","key":"10.1016\/S0065-2458(08)60245-4_bib101"},{"year":"1979","series-title":"\u201cLogic Design and Switching Theory\u201d","author":"Muroga","key":"10.1016\/S0065-2458(08)60245-4_bib102"},{"year":"1982","series-title":"\u201cVLSI System Design\u201d","author":"Muroga","key":"10.1016\/S0065-2458(08)60245-4_bib103"},{"year":"1968","series-title":"Logical Design of an Optimum Network by Integer Linear Programming\u2014Part I","author":"Muroga","key":"10.1016\/S0065-2458(08)60245-4_bib104"},{"year":"1968","series-title":"Logical Design of an Optimum Network by Integer Linear Programming\u2014Part II","author":"Muroga","key":"10.1016\/S0065-2458(08)60245-4_bib105"},{"key":"10.1016\/S0065-2458(08)60245-4_bib106","doi-asserted-by":"crossref","first-page":"573","DOI":"10.1109\/TC.1972.5009010","article-title":"Design of Optimal Switching Networks by Integer Programming","volume":"C-21","author":"Muroga","year":"1972","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/S0065-2458(08)60245-4_bib107","first-page":"893","article-title":"Minimization of Logic Networks under a Generalized Cost Function","volume":"C-25","author":"Muroga","year":"1976","journal-title":"IEEE TC"},{"key":"10.1016\/S0065-2458(08)60245-4_bib108","first-page":"1404","article-title":"The Transduction Method\u2014Design of Logic Networks Based on Permissible Functions","volume":"38","author":"Muroga","year":"1989","journal-title":"IEEE TC"},{"key":"10.1016\/S0065-2458(08)60245-4_bib109","doi-asserted-by":"crossref","unstructured":"S. Muroga X.Q. Xiang J.C. Limqueco L.P. Lin K.C. Chen (1989). A Logic Network Synthesis System. SYLON Proc. International Conference Computer Design, 324\u2013328.","DOI":"10.1109\/ICCD.1989.63381"},{"year":"1971","series-title":"A Branch-and-Bound Algorithm for Optimal AND-OR Networks (The Algorithm Description)","author":"Nakagawa","key":"10.1016\/S0065-2458(08)60245-4_bib110"},{"year":"1977","series-title":"Reference Manual of FORTRAN Program ILLOD-(AND-OR-B) for Optimal AND-OR Networks","author":"Nakagawa","key":"10.1016\/S0065-2458(08)60245-4_bib111"},{"year":"1985","series-title":"Reference Manual of FORTRAN Program ILLOD-(NOR-B) for Optimal NOR Networks\u2014Revised","author":"Nakagawa","key":"10.1016\/S0065-2458(08)60245-4_bib112"},{"key":"10.1016\/S0065-2458(08)60245-4_bib113","unstructured":"T. Nakagawa S. Muroga (1969). Exposition of Davidson's Thesis, \u2018An Algorithm for NAND Decomposition of Combinational Switching Functions.\u2019 File no. UIUCDCS-F71\u2013869. Dept. of Computer Science, University of Illinois at Urbana-Champaign."},{"year":"1971","series-title":"Comparison of the Implicit Enumeration Method and the Branch-and-Bound Method for Logic Design","author":"Nakagawa","key":"10.1016\/S0065-2458(08)60245-4_bib114"},{"year":"1971","series-title":"Pruning and Branching Methods for Designing Optimal Networks by the Branch-and-Bound Method","author":"Nakagawa","key":"10.1016\/S0065-2458(08)60245-4_bib115"},{"issue":"2","key":"10.1016\/S0065-2458(08)60245-4_bib116","first-page":"1989","article-title":"Design Algorithm of Optimal NOR Networks by the Branch-and-Bound Approach. Rep. no. UIUCDCS-R-84\u20131128. Dept. of Computer Science, University of Illinois at Urbana-Champaign","volume":"1","author":"Nakagawa","year":"1984","journal-title":"Also Intl. Jour. Computer Aided VLSI Design"},{"issue":"10","key":"10.1016\/S0065-2458(08)60245-4_bib117","first-page":"768","article-title":"Synthesis of Gate Minimum Multioutput Two-Level Negative-Gate Networks","volume":"C-28","author":"Nakamura","year":"1979","journal-title":"IEEE TC"},{"issue":"1","key":"10.1016\/S0065-2458(08)60245-4_bib118","first-page":"5","article-title":"Minimal Negative-Gate Networks","volume":"C-21","author":"Nakamura","year":"1972","journal-title":"IEEE TC"},{"issue":"12","key":"10.1016\/S0065-2458(08)60245-4_bib119","doi-asserted-by":"crossref","first-page":"1099","DOI":"10.1109\/TC.1978.1675012","article-title":"An Algorithm for Optimal NAND Cascade Logic Synthesis","volume":"C-27","author":"Papachristou","year":"1978","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/S0065-2458(08)60245-4_bib120","unstructured":"B. Plangsiri (1974). NOR Network Transduction Procedures, \u2018Merging of Gates\u2019 and \u2018Substitution of Gates\u2019, for Fan-in and Fan-out Restricted Networks (NETTRA-G3-FIFO and NETTRA-PG1-FIFO). UIUCDCS-R-74\u2013688. Dept. of Computer Science, University of Illinois, Urbana."},{"year":"1977","series-title":"\u201cCombinational Algorithms: Theory and Practice\u201d","author":"Reingold","key":"10.1016\/S0065-2458(08)60245-4_bib121"},{"key":"10.1016\/S0065-2458(08)60245-4_bib122","doi-asserted-by":"crossref","first-page":"969","DOI":"10.1109\/TC.1983.1676144","article-title":"Parallel Binary Adders with a Minimum Number of Connections","volume":"C-32","author":"Sakurai","year":"1983","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/S0065-2458(08)60245-4_bib123","doi-asserted-by":"crossref","first-page":"380","DOI":"10.1109\/TCE.1961.6368603","article-title":"Logical Design by Regression","volume":"80","author":"Schubert","year":"1961","journal-title":"Trans. AIEE, Part I. Commun. and Electron."},{"year":"1972","series-title":"Computer Program for Designing Optimal Networks with MOS Gates","author":"Shinozaki","key":"10.1016\/S0065-2458(08)60245-4_bib124"},{"key":"10.1016\/S0065-2458(08)60245-4_bib125","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1109\/PGEC.1965.264064","article-title":"Minimal Three-Variable NOR and NAND Logic Circuits","volume":"EC-14","author":"Smith","year":"1965","journal-title":"IEEE Trans. Electron. Comput."},{"key":"10.1016\/S0065-2458(08)60245-4_bib126","doi-asserted-by":"crossref","first-page":"1445","DOI":"10.1109\/T-C.1971.223156","article-title":"Computer-Aided Synthesis of Multiple-Output Multi-Level NAND Networks with Fan-in and Fan-out Constraints","volume":"C-20","author":"Su","year":"1971","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/S0065-2458(08)60245-4_bib127","first-page":"166","article-title":"An Overview of Logic Synthesis Systems","author":"Trevillyan","year":"1987","journal-title":"Proc. Design Automation Conference"},{"key":"10.1016\/S0065-2458(08)60245-4_bib128","first-page":"131","article-title":"Roles of System Designers in the Gate of Custom VLSI","author":"Uchida","year":"1988","journal-title":"Jour. Inst. Elec. Inf. Comm. Eng. Japan"},{"year":"1986","series-title":"DIMN-C. Undocumented Program","author":"Xiang","key":"10.1016\/S0065-2458(08)60245-4_bib129"},{"key":"10.1016\/S0065-2458(08)60245-4_bib130","series-title":"Intl. Workshop on Logic Synthesis","article-title":"Synthesis of Multilevel Networks with Simple Gates","author":"Xiang","year":"1989"},{"year":"1976","series-title":"Design of Irredundant MOS Networks: A Program Manual for the Design Algorithm DIMN","author":"Yamamoto","key":"10.1016\/S0065-2458(08)60245-4_bib131"},{"year":"1977","series-title":"Design of Irredundant Multiple-Level MOS Networks for Multiple-Output and Incompletely Specified Funtions","author":"Yeh","key":"10.1016\/S0065-2458(08)60245-4_bib132"},{"key":"10.1016\/S0065-2458(08)60245-4_bib133","unstructured":"M.H. Young Program Manual of the Program ILLOD-(NOR-BS) for Deriving Optimal Multi-Level NOR Networks. To be published."},{"key":"10.1016\/S0065-2458(08)60245-4_bib134","doi-asserted-by":"crossref","first-page":"523","DOI":"10.1109\/TC.1985.5009404","article-title":"Symmetric Minimal Covering Problem and Minimal PLA's with Symmetric Variables","volume":"C-34","author":"Young","year":"1985","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/S0065-2458(08)60245-4_bib135","unstructured":"M.H. Young S. Muroga Utilization of Symmetric Property in Automated Design of the Optimal Multi-Level NOR Network. To be published."},{"year":"1977","series-title":"A Code for Zero-One Integer Programming ILLIP-2 (A Programming Manual for ILLIP-2)","author":"Young","key":"10.1016\/S0065-2458(08)60245-4_bib136"},{"key":"10.1016\/S0065-2458(08)60245-4_bib137","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1007\/BF00978712","article-title":"Parallel Multipliers with NOR Gates Based on G-Minimum Adders","volume":"13","author":"Yu","year":"1984","journal-title":"Intl. Jour. of Computer and Information Sciences"}],"container-title":["Advances in Computers","Advances in Computers Volume 32"],"original-title":[],"language":"en","deposited":{"date-parts":[[2025,3,1]],"date-time":"2025-03-01T22:38:19Z","timestamp":1740868699000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0065245808602454"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991]]},"ISBN":["9780120121328"],"references-count":137,"URL":"https:\/\/doi.org\/10.1016\/s0065-2458(08)60245-4","relation":{},"ISSN":["0065-2458"],"issn-type":[{"type":"print","value":"0065-2458"}],"subject":[],"published":{"date-parts":[[1991]]}}}