Green, Frederic
Clark University.
Ryabko, Boris
Siberian State University.
Busygin, Stas
Efficient algorithms for hard computational problems; NP-completeness. Publications; software; resources on NP-completeness.
Dantsin, Evgeny
Roosevelt University.
Complexity People
A list of researchers, maintained by the Electronic Colloquium on Computational Complexity.
Buss, Samuel
University of California, San Diego.
Chen, Jianer
Texas A&M University.
Rogers, John
DePaul University.
Arsham, Hossein
University of Baltimore.
Vitanyi, Paul
University of Amsterdam.
Beigel, Richard
Temple University.
Kolmogorov, Aleksey
Moscow State University.
Hirsch, Edward
Steklov Institute of Mathematics at St.Petersburg.
Matiyasevich, Yuri
Steklov Institute of Mathematics.
Vereshchagin, N.K.
Moscow State University.
Bollig, Beate
University of Dortmund.
Sieling, Detlef
Dortmund University.
Sauerhoff, Martin
Dortmund University.
Merkle, Wolfgang
Ruprecht Karls Universität Heidelberg.
Wolkowicz, Henry
University of Waterloo.
Klauck, Hartmut
University of Calgary.
Hesse, William
Clarkson University.
Schuler, Rainer
Universität Ulm.
Thierauf, Thomas
Universität Ulm.
Karpinski, Marek
University of Bonn.
Sudan, Madhu
Massachusetts Institute of Technology.
Rivest, Ronald
Massachusetts Institute of Technology.
Goldwasser, Shafi
Massachusetts Institute of Technology.
Waack, Stephan
Universität Göttingen.
Mayordomo, Elvira
Instituto de investigación en Ingeniería de Aragón.
Manthey, Bodo
Institute of Theoretical Computer Science.
Bläser, Markus
Saarland University, Department of Computer Science
Niedermeier, Rolf
Universität Tübingen.
Reinhardt, Klaus
Universität Tübingen.
Balcázar, Jose
Facultat d'Informatica de Barcelona.
Zheng, Xizhong
Brandenburgische Technische Universität Cottbus.
Frisch, Alan
Artificial Intelligence, constraint satisfaction problems
Fagin, Ronald
IBM Almaden Research Center.
Jiang , Tao
McMaster University.
Yao, Chi Chin
Tsinghua University.
Case, John
University of Delaware.
Sitharam, Meera
University of Florida.
Pitassi, Toniann
University of Arizona.
Chaitin, Greg
IBM Research.
Calude, Cristian
University of Auckland.
Papadimitriou, Christos H.
Author of the very popular book on complexity theory. Home page with recent publications and links to courses.
Homer, Steve
Boston University.
Schulman, Leonard
California Institute of Technology.
Savicky, Petr
Institute of Computer Science, Academy of Sciences of the Czech Republic.
Per Bjesse
SAT-based hardware verification (using Stalmarck's algorithm)
Rudich, Steven
Carnegie Mellon University.
Grolmusz, Vince
Eötvös University.
Ben-Or, Michael
The Hebrew University.
Nisan, Noam
Hebrew University.
Lutz, Jack
Iowa State University.
Leivant, Daniel
Indiana University.
Arora, Sanjeev
Princeton University.
Barak, Boaz
Institute for Advanced Studies.
Chazelle, Bernard
Princeton University.
Vardi, Moshe Y.
Recent paper on the hardness of random formulas for SAT solver; bounded tree-width.
Hemaspaandra, Lane
University of Rochester.
Allender, Eric
Rutgers, the State University of NJ.
Kabanets, Valentine
Simon Fraser University.
Pollett, Chris
San Jose State University.
Ben-Sasson, Eli
Senior Lecturer, Technion, Haifa, Israel.
Kushilevitz, Eyal
Israel Institute of Technology.
Pitt, Francois
University of Toronto.
Levesque, Hector
Local search, random SAT, artificial intelligence.
Khuller, Samir
University of Maryland.
Zuckerman, David
University of Texas at Austin.
Gal, Anna
University of Texas at Austin.
Buss, Jonathan
University of Waterloo.
Hitchcock, John
University of Wyoming.
Beame, Paul
University of Washington.
Tompa, Martin
University of Washington.
Van Melkebeek, Dieter
University of Wisconsin-Madison.
Spielman, Daniel A.
Professor of Applied Mathematics and Computer Science at Yale.
Selman, Alan
University at Buffalo.
Furer, Martin
Pennsylvania State University.
Russell, Alexander
University of Connecticut.
Bellare, Mihir
University of California, San Diego.
Edmonds, Jeff
York University.
Chang, Richard
University of Maryland.
Jerrum, Mark
University of Edinburgh.
Moscato, Pablo
Universidade Estadual de Campinas.
Kiwi, Marcos
University of Chile.
Franco, John
Probabilistic analysis of algorithms, polynomial time solvable subclasses of satisfiability.
Vadhan, Salil
Harvard University.
Parberry, Ian
Department of Computer Science and Engineering, University of North Texas.
Meinel, Christoph
Hasso Plattner Institute for Software Systems Engineering, University of Potsdam
Luby, Michael
International Computer Science Institute.
Liskiewicz, Maciej
University of Wroclaw.
Kutrib, Martin
Universität Gießen.
Reischuk, Rüdiger
Universität zu Lübeck.
Hermann, Miki
National Center for Scientific Research (France).
Magniez, Frederic
University of Paris.
Krajicek, Jan
Mathematical Institute of the Academy of Sciences of the Czech Republic.
Pudlák, Pavel
Mathematical Institute of the Academyof Sciences of the Czech Republic.
Sgall, Jiri
Mathematical Institute, Academy of Sciences of the Czech Republic.
Wigderson, Avi
Institute for Advanced Study, Princeton.
Alon, Noga
School of Mathematical Sciences at Tel Aviv University.
Zwick, Uri
Tel Aviv Univerusity.
Grigni, Michelangelo
Emory University.
Razborov, Alexander
Steklov Mathematical Institute.
Hajiaghayi, Mohammad Taghi
Massachusetts Institute of Technology.
Veith, Helmut
Institute of Information Systems.
Håstad, Johan
Kungliga Tekniska högskolan.
Kann, Viggo
Nada.
Xu, Ke
Beijing University of Aeronautics and Astronautics.
Simon, Hans Ulrich
Ruhr-Universität Bochum.
Moore, Cris
University of New Mexico.
Shoup, Victor
Courant Institute.
Johannsen, Jan
University of München.
Chen, Hubie
Cornell University.
Jukna, Stasys
Johann Wolfgang Goethe University.
Raz, Ran
Weizmann Institute of Science.
Kutylowski, Miroslaw
University of Paderborn.
Czumaj, Artur
University of Paderborn.
Kosub, Sven
Technische Universität München.
|
Internet Tools
Feature Sites
Directories
Sponsor