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