My main interest is algorithms with fast average time for the conjunctive normal form (CNF) satisfiability problem and for other constraint satisfaction problems. I am also interested in computational biology, especially in practical algorithms for NP-complete computational biology problems.

His research has included design and analysis for computing transitive closure to reason about connectivity properties in graphs, design and probabilistic analysis of efficient branch-and-bound algorithms (recursive search for solutions in combinatorially large search spaces such as that of  games of chess), design and analysis for the propositional satisfiability (SAT) problems, probabilistic analysis of fundamental data mining problems, study of parsing and compilation techniques for programming languages, and the study of efficient discovery of generators in finite groups.  Additionally, he spent time working on phylogenetic tree generation.

Research Areas

  • Theoretical Computer Science
  • Algorithms and Theoretical Computer Science
  • Bioinformatics and Computational Biology
  • Databases and Data Mining
  • Data Mining
Cognitive Science
PhD, California Institute of Technology, Physics, 1966
MS, California Institute of Technology, Physics, 1962
BS, California Institute of Technology, Physics, 1961
computer and information sciences computer engineering & hardware computer algorithms applied mathematics algorithms

SAT Contest, 6th Prize (CNF Satisfiability), Paderborn University, 1992

American Association for the Advancement of Science
Association for Computer Machinery
Sigma Xi
Society for Industrial and Applied Mathematics