Theory of Computation and Mathematical Methods Research
The theory of computation concerns the structure of fundamental computational problems, and methods for their efficient solution. Rutgers has a number of faculty members whose interests cover a broad spectrum of theory topics, from combinatorial optimization to quantum computing. Below are pointers to individual faculty members, with summaries of their research interests; please refer to their web pages for more detailed infomation.
People
- Eric Allender: Complexity theory, including circuit complexity, Kolmogorov complexity, resource-bounded measure theory, and properties of complexity classes.
- Martin Farach-Colton: Algorithms and data Structures, matching, computational biology.
- Michael Fredman: Combinatorics, algorithms, complexity.
- Apostolos Gerasoulis: Searching in massive data sets. Currently on leave.
- Michael D. Grigoriadis: Approximation algorithms for structured optimization; network and combinatorial optimization.
- Bahman Kalantari: Mathematical programming, matrix scaling, theory and algorithms for polynomial root-finding, polynomiography.
- Joseph Kilian: Cryptography, algorithms, complexity theory and security.
- S. Muthu Muthukrishnan: Streaming algorithms and algorithms for massive data sets.
- Marvin C. Paull: Data structures and algorithms.
- Gerard Richter: Numerical methods.
- William Steiger: Combinatorial and computational geometry, probability.
- Mario Szegedy: Complexity theory, combinatorics, combinatorial geometry and quantum computing.
- Endre Szemerédi: Combinatorics, computational geometry, complexity theory.
- Rebecca Wright: Computer and communications security, particularly in the areas of privacy, cryptographic protocols, and fault-tolerant distributed computing.
- Danfeng (Daphne) Yao: Information and system security, distributed systems, trust management, wireless security, privacy and anonymity, applied cryptography.
