NOR network transduction procedures : "merging of gates" and "substitution of gates" for fan-in and fan-out restricted networks, NETTRA-G3-FIFO and NETTRA-PG1-FIFO /

"December 1974."--T.p.

Lower bounds on merging networks /

Bibliography: leaf 16.

A branch-and-bound algorithm for optimal AND-OR networks (the algorithm description)

Bibliography: p. 39.

Design of diagnosable MOS networks /

"UILU-ENG 79 1745"--Cover.

Design of optimal one-bit adder networks by integer linear programming /

"July 15, 1971."

Optimal networks with NOR-OR gates and Wired OR logic /

Originally presented as the author's thesis (M.S.), University of Illinois at Urbana-Champaign.

A code for designing optimal networks by implicit enumeration using the all-interconnection inequality formulation : (a programming manual for ILLODIE-AIF) /

Thesis (M.S.)--University of Illinois at Urbana-Champaign.

Reference manual of FORTRAN program ILLOD-(NOR-B) for optimal NOR networks

Mode of access: Internet.

Synthesis of optimal networks with NOR and NAND gates by integer programming /

"January 18, 1971."

Simulation of continuous networks with MODEL /

Includes bibliographical references.

A study of certain factors affecting computation times in designing optimal NOR networks by the implicit enumeration method using the feed-forward formulation /

Bibliography: p. 27-29.

Pruning and branching methods for designing optimal networks by the branch-and-bound method

Includes bibliographical references.

Design of irredundant multiple-level MOS networks for multiple-output and incompletely specified functions /

Thesis (M. S.)--University of Illinois at Urbana-Champaign.

On the synthesis by integer programming of optimal NOR gate networks for four variable switching functions /

"Supported in part by the National Science Foundation under grant no. NSF GJ-503."

NOR (NAND) network design : error-compensation procedures for fan-in and fan-out restricted networks (NETTRA-E1-FIFO and NETTRA-E2-FIFO /

Thesis (M. S.)--University of Illinois at Urbana-Champaign.