Miscellany ♦    Experience: 1995 - present   --   Geier Chair Professor of Computer Science, University of Cincinnati 1990 - 1995   --   Computer Science, University of Cincinnati 1984 - 1990   --   Computer Science, Indiana University 1981 - 1984   --   Computer Science, Case Western Reserve University 1969 - 1975   --   Digital Signal Processing Group, Bell Telephone Laboratories ♦    Education: 1981   --   Ph.D. Computer Science, Rutgers, the state university of New Jersey 1971   --   M.S. Electrical Engineering, Columbia University 1969   --   B.S. Electrical Engineering, City College of New York ♦    Professional Affiliations: 1976 --     Association for Computing Machinery, SIGACT 1981 --     Society for Industrial and Applied Mathematics ♦    LaSH, 16 August 2006 LaSH'06 was a one day workshop in association with FLoC'06. I gave a tutorial on "Experiences in the Research and Development of a Non-Clausal SAT Solver". • to the presentation • to the workshop proceedings ♦    LICS workshop: Typical Case Complexity and Phase Transitions This workshop was held alongside LICS in 2003. I gave a survey talk on "Probability in the analysis of CNF Satisfiability algorithms and properties". • to the presentation ♦    Workshop on Satisfiability This workshop was held in Siena, Italy, in 1996. It was the first workshop on Satisfiability and the forerunner of the series entitled International Symposium on the Theory and Applications of Satisfiability Testing. Joint with E. Speckenmeyer (Köln), G. Gallo (Pisa), H. Kleine Büning (Paderborn). Covered most aspects of propositional satisfiability including algorithms, probabilistic and empirical analysis, special subclasses. Selected papers are published in a special issue of Discrete Applied Mathematics. • to the original conference website • to the conference report ♦    Other conference and workshop invitations • Resolution tunnels at several workshops • SAT symposium 2006, Sun Yat-Sen University, Guangzhou, China • SAT symposium 2004, Sun Yat-Sen University, Guangzhou, China • 5th International Symposium on the Theory and Applications of Satisfiability Testing, Cincinnati, Ohio, USA (Spring, 2002 - co-organizer). • Workshop on Computational Complexity and Statistical Mechanics, Santa Fe, New Mexico, (Sept. 2001). • 4rd Workshop on Satisfiability, Boston, Massachusetts (Spring, 2000 - co-organizer). • 3rd Workshop on Satisfiability, Renesse, The Netherlands (Spring, 2000 - co-organizer). • Randomization Methods in Algorithm Design Workshop, Fields Institute, Toronto, Canada (Spring, 2000). • DIMACS Randomization Methods in Algorithm Design Workshop, Rutgers University, Piscataway, New Jersey, USA (Fall, 1999). • Topical Conference on NP-hardness and Phase Transitions, Abdus Salam International Centre for Theoretical Physics, Trieste, Italy (Summer, 1999). • 2nd Workshop on Satisfiability, Schloß Eringerfeld, Germany (Spring, 1998 - co-organizer). • DIMACS Randomization Methods in Algorithm Design Workshop, Princeton University, Princeton, New Jersey, USA (Spring, 1997). • DIMACS workshop on the Satisifability Problem, DIMACS, Rutgers University, New Jersey (April, 1996). • Logic and Computational Complexity, Indianapolis, Indiana, (October 1994). • 15th International Symposium on Mathematical Programming, University of Michigan, Ann Arbor (August 1994). • 3rd International Symposium on Artificial Intelligence and Mathematics, Ft. Lauderdale, Florida (January, 1994). • Workshop on New Environmental Software, Lawrence Livermore Laboratories, Lawrence, California (November, 1992). • Computer Science Logic, Dagstuhl, Germany, (July, 1992). • 7th Advanced Research Institute in Discrete Applied Mathematics (ARIDAM), New Brunswick, New Jersey, (May, 1992). • 6th Advanced Research Institute in Discrete Applied Mathematics (ARIDAM), New Brunswick, New Jersey, (May, 1991). • First IFIP-TC WG 7.6 Conference on optimization-based computer aided modelling and design, The Netherlands, (April, 1991). • 5th Advanced Research Institute in Discrete Applied Mathematics (ARIDAM), New Brunswick, New Jersey, (May, 1990). • Workshop on Boolean Functions, Propositional Logic and AI Systems, Ulm, W. Germany, (September, 1989 - co-organizer). • Workshop on Mathematical Methods in Artificial Intelligence, Ulm, W. Germany, (December, 1988). ♦    Project: heuristics for SBSAT Two undergraduate students received REUs for one year to help discover exploitable syntactic patterns in difficult instances of Satisfiability. • to the project record ♦    CS Seminar, Spring 2007 This is a presentation on creativity. • to the presentation ♦    CS Seminar, 2 February 2005 This presentation was intended to show how to use certain constructs in Scheme and C++ to achieve data driven computation, and advanced control flow via call-with-current-continuation. The Y combinator was discussed. • to the code used in the presentation ♦    Reports • SAT Algorithms Survey (from DIMACS) • SAT Probabilistic Analysis Survey (2004) • Sharp Thresholds for QHorn Properties (2004) • Pure Implicational Formulas (Fixed Parameter Tractable) ♦    Red-Black Tree Demonstration This is the result of merging Michael Conrad's C++ code that implements the red-black tree algorithm found in Berman and Paul, Sequential and Parallel Algorithms, Brooks/Cole PWS Publishing Co, 1997 (ISBN:0-534-94674-7), with John Franco's Java GUI code. The C++ code was translated to Java and integration was facilitated by a Stream class. • to the regular demo • to the maintenance demo • to the old demo ♦    A BDD Visualizer Look at the results of BDD operations on Boolean functions. • to the visualizer • to the tutorial • open visualizer in another window ♦    Some Java Experiments • to the experiments ♦    Compendium of Solutions to Problems Setting Up Linux at UC • Instructions for dialing into UC using PPP/PAP in Linux • What to do about error SOCKADDRT: Invalid argument • What XFree86 driver is needed for Elsa Gloria L Video Cards? • How to get backspace to work in Netscape and other apps ♦    Other links • Other selected Java experiments • SSH2 for Windows