Below is a brief description of each topic, and a list of workshops associated with that topic. We also plan a series of week-long tutorials, one in each topic, intended to introduce students, recent graduates, and professionals from other areas to the topic.

A workshop on the "Satisfiability Problem: Theory and Applications" examines the strong relationship between the theory, algorithms, and the applications of the SAT problem. he main focus of this workshop is to bring together the best theorists, algorithmists, and practitioners working on the SAT problem and on the industrial applications involving the SAT problem, enhancing the interaction between the three research groups. As an important activity of the workshop, a set of SAT problem benchmarks derived from the practical industrial engineering applications will be provided for SAT algorithm benchmarking.

- Jeremy Avigad,
*Proof Theory, Strength of Formal Systems* - Orna Bernholtz Kupferman,
*Computer Aided Verification,*(at Bell Labs) - Maria-Luisa Bonet,
*Proof Theory, Complexity of Propositional Proofs* - Kousha Etessami,
*Finite Model Theory, Descriptive Complexity* - Thomas Wilke,
*Computer-Aided Verification, Timed Automata*

- Ed Clarke, Carnegie Mellon University
- Steve Cook, University of Toronto
- Ronald Fagin, IBM Almaden
- Neil Immerman, University of Massachusetts
- Vaughn Pratt, Stanford University
- Joel Spencer, New York University
- Alexander Razborov, Steklov Mathematical Institute

- Eric Allender, Rutgers U. allender@cs.rutgers.edu
- Bob Kurshan, AT&T Bell Labs k@research.att.com
- Moshe Vardi, Rice U. vardi@cs.rice.edu

- Stephen Bloch, Adelphi U. sbloch@boethius.adelphi.edu Steve Bloch's Home Page

- Paul Beame, U. Washington beame@cs.washington.edu
- Sam Buss, U. California, San Diego sbuss@gentzen.ucsd.edu
- Gregory Cherlin, Rutgers U.
- Ed Clarke, Carnegie Mellon U. Edmund_Clarke@cs.cmu.edu
- Steve Cook, U. Toronto sacook@theory.toronto.edu
- Allen Emerson, U. Texas emerson@cs.utexas.edu
- Joan Feigenbaum, AT&T Bell Labs jf@research.att.com
- Orna Grumberg, Technion orna@cs.technion.ac.il
- Phokion Kolaitis, U. California, Santa Cruz kolaitis@cs.ucsc.edu
- Daniel Leivant, Indiana U. leivant@cs.indiana.edu
- Richard Lipton, Princeton U. rjl@cs.princeton.edu
- Amir Pnueli, Weizmann Institute amir@wisdom.weizmann.ac.il
- Peter Winkler, AT&T Bell Labs pw@research.att.com

- Hao Nham (AT&T QUEST)
- Paul Loewenstein (Sun)
- Carl Pixley (Motorola)
- Zeev Shtadler (Intel)
- Kurt Keutzer (Synopsys)

Index of Special Year on Logic and Algorithms

DIMACS Homepage

Contacting the Center

Document last modified on October 19, 1998.