# Ph.D. Dissertations - Umesh Vazirani

Efficient learning algorithms with limited information

Anindya De [2013]

The Computational Complexity of Randomness

Thomas Watson [2013]

Non-Local Correlations and Interactive Games

Daniel Ciprian Preda [2011]

The Complexity of Entangled Games

Thomas Vidick [2011]

Merging Techniques for Combinatorial Optimization: Spectral graph Theory and Semidefinite Programming

Alexandra Kolla [2009]

Error-detection-based quantum fault tolerance against discrete Pauli noise

Benjamin W. Reichardt [2006]

Limits on Efficient Computation in the Physical World

Scott J. Aaronson [2004]

Quantum Algorithms and the Fourier Transform

Lawrence P. H. Ip [2004]

Quantum Encodings and Applications to Locally Decodable Codes and Communication Complexity

Iordanis Kerenidis [2004]

Quantum Entanglement, Quantum Communication and the Limits of Quantum Computing

Andris Ambainis [2001]

Learning Probability Distributions

Sanjoy Dasgupta [2000]

Quantum Fourier Sampling, the Hidden Subgroup Problem, and Beyond

Sean J. Hallgren [2000]

Lower Bounds for Quantum Computation and Communication

Ashwin V. Nayak [1999]

Quantum Complexity Theory

Ethan J. Bernstein [1997]

A Coding Theorem for Distributed Computation

Sridhar Rajagopalan [1994]

Probabilistic Checking of Proofs and Hardness of Approximation Problems

Sanjeev Arora [1994]

Efficient Checking of Polynomials and Proofs and the Hardness of Approximation Problems

Madhu Sudan [1992]

Computing Efficiently Using General Weak Random Sources

David I. Zuckerman [1991]