3. SWCT 1962: Chicago, Illinois, USA

I. Minimization Techniques

• Angelo Raffaele Meo:
  On the minimal third order expression of a Boolean function. 5-24
  
• E. W. Samson, Lorenzo Calabi:
  Research and algorithms in the theory of Boolean formulas. 25-32
  
• Lorenzo Calabi, J. A. Riley:
  The algebra of Boolean formulas: Some criteria for minimality. 33-47
  
• Eugene L. Lawler:
  Minimal Boolean expressions with more than two levels of sums and products. 49-59
  

II. Sequential Circuits I

• Calvin C. Elgot, Joseph D. Rutledge:
  Machine properties preserved under state minimization. 61-70
  
• B. Hazeltine:
  A procedure for obtaining an economical asynchronous sequential circuit directly from a set of regular expressions. 71-79
  
• Franz E. Hohn:
  States of sequential machines whose logical elements involve delay. 81-89
  
• Edward J. McCluskey:
  Reduction of feedback loops in sequential circuits and carry leads in iterative networks. 91-102
  

III. Sequential Circuits II

• Roger E. Levien:
  The synthesis of cascade switching circuits. 103-121
  
• J. C. Beatty, Raymond E. Miller:
  Some theorems for incompletely specified sequential machines with applications to state minimization. 123-136
  
• Shmuel Winograd:
  Bounded-transient automata. 137-141
  
• Shimon Even:
  Generalized automata and their information losslessness. 143-147
  

IV. Combinational Problems

• Sheldon B. Akers Jr.:
  Synthesis of combinational logic using three-input majority gates. 149-157
  
• Philip M. Lewis II, C. L. Coates:
  A realization procedure for threshold gate networks. 159-168
  
• Saburo Muroga:
  Generation of self-dual threshold functions and lower bounds of the number of threshold functions and a maximum weight. 169-184
  
• Chuen K. Tung:
  On some transformation theorems in many-valued logical systems. 185-199
  

Last update Fri May 25 08:14:14 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page