Complexity People
A list of researchers, maintained by the Electronic Colloquium on Computational Complexity.
Aaronson, Scott
University of California, Berkeley.
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.
Auer, Peter
University of Leoben.
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
Radcliffe Institute for Advanced Study.
Bläser, Markus
Institute of Theoretical 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.
Results: 1 2 3 4 5 6 7 8 9 10 11 12 13 14 Next