Theses most similar to Algorithms and lower bounds for sparse recovery (Price, Eric (Eric C.); 2010) 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

Efficient and private distance approximation in the communication and streaming models

Woodruff, David Paul, 1980- (2007)

  • Advisor: Piotr Indyk
  • Department of Electrical Engineering and Computer Science
Read it

On the hardness of the shortest vector problem

Micciancio, Daniele (1998)

  • Advisor: Shafi Goldwasser
  • 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

Testing k-wise independent distributions

Xie, Nin (2012)

  • Advisor: Ronitt Rubinfeld
  • Department of Electrical Engineering and Computer Science
Read it

Locally decodable source coding

Makhdoumi, Ali (Makhdoumi Kakhaki) (2013)

  • Advisors: Médard, Muriel; Yury Polyanskiy
  • Department of Electrical Engineering and Computer Science
Read it

Sparse recovery and Fourier sampling

Price, Eric C (2013)

  • Advisor: Piotr Indyk
  • 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

Learning and testing junta distributions over hypercubes

Aliakbarpour, Maryam (2015)

  • Advisor: Ronitt Rubinfeld
  • Department of Electrical Engineering and Computer Science
Read it

Deterministic network coding by matrix completion

Harvey, Nicholas James Alexander (2005)

  • Advisor: David R. Karger
  • Department of Electrical Engineering and Computer Science
Read it