-
Rutgers, the State University of NJ.
-
School of Mathematical Sciences at Tel Aviv University.
-
Princeton University.
-
University of Baltimore.
-
Facultat d'Informatica de Barcelona.
-
Institute for Advanced Studies.
-
University of Washington.
-
Temple University.
-
University of California, San Diego.
-
The Hebrew University.
-
Senior Lecturer, Technion, Haifa, Israel.
-
Saarland University, Department of Computer Science
-
University of Dortmund.
-
University of Waterloo.
-
University of California, San Diego.
-
Efficient algorithms for hard computational problems; NP-completeness. Publications; software; resources on NP-completeness.
-
University of Auckland.
-
University of Delaware.
-
IBM Research - Algorithmic information theory.
-
University of Maryland.
-
Princeton University.
-
Texas A&M University.
-
Cornell University.
-
A list of researchers, maintained by the Electronic Colloquium on Computational Complexity.
-
University of Paderborn.
-
Roosevelt University.
-
York University.
-
IBM Almaden Research Center.
-
Probabilistic analysis of algorithms, polynomial time solvable subclasses of satisfiability.
-
Artificial Intelligence, constraint satisfaction problems
-
Pennsylvania State University.
-
University of Texas at Austin.
-
RSA Professor at MIT, and also employed at Weizmann Institute of Science in Israel. Site contains selected publications of her ranging from Cryptography to Complexity Theory.
-
Clark University.
-
Emory University.
-
Eötvös University.
-
Massachusetts Institute of Technology.
-
University of Rochester.
-
National Center for Scientific Research (France).
-
Clarkson University.
-
Steklov Institute of Mathematics at St.Petersburg.
-
University of Wyoming.
-
Boston University.
-
Kungliga Tekniska högskolan.
-
University of Edinburgh - Probabilistic computation, the complexity of combinatorial enumeration, information- and complexity-theoretic aspects of machine learning, and combinatorial optimisation.
-
McMaster University.
-
University of München.
-
Johann Wolfgang Goethe University.
-
Simon Fraser University.
-
Nada.
-
University of Bonn.
-
University of Maryland.
-
University of Chile.
-
University of Calgary.
-
Moscow State University.
-
Technische Universität München.
-
Mathematical Institute of the Academy of Sciences of the Czech Republic.
-
Israel Institute of Technology.
-
Universität Gießen.
-
University of Paderborn.
-
Indiana University - Computational complexity.
-
University of Toronto - Knowledge representation.
-
University of Wroclaw.
-
International Computer Science Institute.
-
Iowa State University.
-
University of Paris.
-
Institute of Theoretical Computer Science.
-
Steklov Institute of Mathematics.
-
Instituto de investigación en Ingeniería de Aragón.
-
Hasso Plattner Institute for Software Systems Engineering, University of Potsdam
-
Ruprecht Karls Universität Heidelberg.
-
University of New Mexico.
-
Universidade Estadual de Campinas.
-
Universität Tübingen.
-
Hebrew University.
-
Author of the very popular book on complexity theory. Home page with recent publications and links to courses.
-
Department of Computer Science and Engineering, University of North Texas.
-
SAT-based hardware verification (using Stalmarck's algorithm)
-
University of Arizona.
-
University of Toronto.
-
San Jose State University - Logic, bounded arithemtic, computational complexity and quantum computation.
-
Mathematical Institute of the Academyof Sciences of the Czech Republic.
-
Weizmann Institute of Science.
-
Steklov Mathematical Institute.
-
Universität Tübingen.
-
Universität zu Lübeck.
-
DePaul University.
-
Andrew and Erna Viterbi Professor of Electrical Engineering and Computer Science in MIT's EECS Dept and member of Theory of Computation Group at CSAIL.
-
Carnegie Mellon University.
-
University of Connecticut.
-
Siberian State University.
-
Dortmund University.
-
Institute of Computer Science, Academy of Sciences of the Czech Republic.
-
Universität Ulm.
-
California Institute of Technology.
-
University at Buffalo.
-
Mathematical Institute, Academy of Sciences of the Czech Republic.
-
Professor at NYU. Research papers and contact information.
-
Dortmund University.
-
Ruhr-Universität Bochum.
-
University of Florida.
-
Professor of Applied Mathematics and Computer Science at Yale.
-
Massachusetts Institute of Technology.
-
Universität Ulm.
-
University of Washington.
-
Harvard University.
-
University of Wisconsin-Madison.
-
Recent paper on the hardness of random formulas for SAT solver; bounded tree-width.
-
Institute of Information Systems.
-
Moscow State University - Theory of computation, Intuitionistic logic
-
University of Amsterdam.
-
Universität Göttingen.
-
Institute for Advanced Study, Princeton.
-
University of Waterloo.
-
Beijing University of Aeronautics and Astronautics.
-
Tsinghua University.
-
Brandenburgische Technische Universität Cottbus.
-
University of Texas at Austin.
-
Tel Aviv Univerusity.
|
|
