Theses most similar to those of author Spielman, Daniel Alan

Computationally efficient error-correcting codes and holographic proofs (1995) read it

Minimum distance of error correcting codes versus encoding complexity, symmetry, and pseudorandomness

Bazzi, Louay Mohamad Jamil, 1974- (2003)

  • Advisors: Daniel A. Spielman; Sanjoy K. Mitter
  • Department of Electrical Engineering and Computer Science
Read it

Clustering via matrix exponentiation

Zhou, Hanson M. (Hanson Mi), 1977- (2003)

  • Advisor: Santosh Vempala
  • Department of Electrical Engineering and Computer Science
Read it

Network coding

Lehman, April Rasala, 1977- (2005)

  • Advisor: Madhu Sudan
  • Department of Electrical Engineering and Computer Science
Read it

Restricted branching programs and hardware verification

Ponzio, Stephen J. (Stephen John) (1995)

  • Advisor: Maricio Karchmer
  • Department of Electrical Engineering and Computer Science
Read it

Iterative algorithms for lossy source coding

Chandar, Venkat (Venkat Bala) (2006)

  • Advisors: Emin Martinian; Gregory Wornell
  • Department of Electrical Engineering and Computer Science
Read it

Local list decoding of homomorphisms

Grigorescu, Elen (2006)

  • Advisor: Madhu Sudan
  • Department of Electrical Engineering and Computer Science
Read it

The method of multiplicities

Saraf, Shubhangi (2011)

  • Advisor: Madhu Sudan
  • Department of Electrical Engineering and Computer Science
Read it

The structure of promises in quantum speedups

Ben David, Shalev (2014)

  • Advisor: Scott Aaronson
  • Department of Electrical Engineering and Computer Science
Read it

LP/SDP hierarchy lower bounds for decoding random LDPC codes

Ghazi, Badih (2015)

  • Advisor: Madhu Sudan
  • Department of Electrical Engineering and Computer Science
Read it

Sparse regularity and relative Szemerédi theorems

Zhao, Yufei (2015)

  • Advisor: Jacob Fox
  • Department of Mathematics
Read it