3. FOCS 1962

• Angelo Raffaele Meo: On the minimal third order expression of a Boolean function. 5-24 BibTeX
• E. W. Samson, Lorenzo Calabi: Research and algorithms in the theory of Boolean formulas. 25-32 BibTeX
• Lorenzo Calabi, J. A. Riley: The algebra of Boolean formulas: Some criteria for minimality. 33-47 BibTeX
• Eugene L. Lawler: Minimal Boolean expressions with more than two levels of sums and products. 49-59 BibTeX
• Calvin C. Elgot, Joseph D. Rutledge: Machine properties preserved under state minimization. 61-70 BibTeX
• B. Hazeltine: A procedure for obtaining an economical asynchronous sequential circuit directly from a set of regular expressions. 71-79 BibTeX
• Franz E. Hohn: States of sequential machines whose logical elements involve delay. 81-89 BibTeX
• Edward J. McCluskey: Reduction of feedback loops in sequential circuits and carry leads in iterative networks. 91-102 BibTeX
• Roger E. Levien: The synthesis of cascade switching circuits. 103-121 BibTeX
• J. C. Beatty, Raymond E. Miller: Some theorems for incompletely specified sequential machines with applications to state minimization. 123-136 BibTeX
• Shmuel Winograd: Bounded-transient automata. 137-141 BibTeX
• Shimon Even: Generalized automata and their information losslessness. 143-147 BibTeX
• Sheldon B. Akers Jr.: Synthesis of combinational logic using three-input majority gates. 149-157 BibTeX
• Philip M. Lewis II, C. L. Coates: A realization procedure for threshold gate networks. 159-168 BibTeX
• Saburo Muroga: Generation of self-dual threshold functions and lower bounds of the number of threshold functions and a maximum weight. 169-184 BibTeX
• Chuen K. Tung: On some transformation theorems in many-valued logical systems. 185-199 BibTeX