Interval generalization of switching theory,

Includes bibliographical references.

A switching theory for bilateral nets of threshold elements.

Issued also as thesis, University of Illinois.

Program manual for the programs ILLOD-MINSUM-CBS, ILLOD-MINSUM-CBSA, ILLOD-MINSUM-CBG, and ILLOD-MINSUM-CBGM, to derive minimal sums or irredundant disjunctive forms for switching functions /

"UILU-ENG 78 1719."

Charge analysis predictions and measurements of storage time for a switching transistor.

Thesis (M.S.)--University of Illinois.

Exposition of Tison's method to derive all prime implicants and all irredundant disjunctive forms for a given switching function /

"October 1979."

Minimization of switching networks using negative functions

Bibliography: p. 46.

An approach to the general synthesis of a threshold element network.

Vita.

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

Bibliography: p. 39.

A method for factoring the action of asynchronous circuits /

"Presented at the AIEE fall general meeting, Chicago, Illinois, October l1, 1960. This work was supported in part by the Office of Naval Research under contract Nonr-1834 (27)."

A study of the effect of additional inequalities in integer programming for logical design.

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

Enumeration of pseudo-separable functions of five variables,

Thesis (M. Sc.)--University of Illinois.

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

Includes bibliographical references.

VIPTRAN--a programming language and its compiler for Boolean systems or process control equations.

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

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

Bibliography: p. 29.

An algorithm for the minimization of two-level multiple-output networks.

Vita.