Algorithms and Complexity Group

Faculty



Piotr Berman: Computational Molecular Biology, Approximation Algorithms, Computational Complexity, Theory of Distributed Systems.






Martin Furer: Graph Algorithms, Approximation Algorithms, Computational Molecular Biology, Computational Complexity, Graph Isomorphism Problem.







Jonathan Goldstine: Automata and Formal Languages. (Retired as of July 2008)







Sean Hallgren: Quantum Computing, Computational Complexity.







Sofya Raskhodnikova: Randomized Algorithms, Computational Complexity.







Adam Smith: Cryptography and its connections with Information Theory, Statistics, Coding theory.