  |
 |
 |
 |
 |
 |
 |
 |
 |
Leonard J. Schulman
 |
Professor of Computer Science B.S., Massachusetts Institute of Technology, 1988; Ph.D., 1992. Caltech, 2000- California
Institute of Technology Office
Location: 317 Annenberg |
| research group | personal page
Research
What problems
are computationally tractable? How is the answer to this question affected
by the use of randomness as a resource? Or even more importantly -- by
the fact that we live in a quantum mechanical world? What mathematics
do we need to understand and develop in order to answer such questions?
What happens when several computational agents interact -- how do they
convey information to each other, hide information from each other, or
combine their data or computational resources? In pursuing these questions,
research in Theory
of Computation at Caltech focuses on Algorithms (particularly randomized
algorithms); Communication Protocols (with a focus on resilience to channel
noise and network disruptions); Combinatorics (especially extremal combinatorics);
Discrete Probability (random processes on trees and other graphs; inequalities);
Coding and Information Theory (especially for interactive and distributed
computations); and Quantum Computation (quantum algorithms, computational
aspects of proposed physical realizations, quantum information theory).
| top |