Theses most similar to those of author Saraf, Shubhangi

Kakeya sets and the method of multiplicities (2009) read it

Techniques for computing with low-independence randomness

Rompel, John Taylor (1990)

  • Advisor: Frank Thomson Leighton
  • 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

Subspace polynomials and list decoding of Reed-Solomon codes

Kopparty, Swastik (2006)

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

Locally Decodable Codes and Private Information Retrieval Schemes

Yekhanin, Sergey (2007)

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

Learning noisy characters, multiplication codes, and cryptographic hardcore predicates

Akavia, Adi (2008)

  • Advisor: Shafi Goldwasser
  • Department of Electrical Engineering and Computer Science
Read it

Uses of randomness in algorithms and protocols

Kilian, Joe (1989)

  • Advisors: David Shmoys; Shafi Goldwasser
  • Department of Mathematics
Read it

The method of multiplicities

Saraf, Shubhangi (2011)

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

Trading isolation for certifiable randomness expansion

Coudron, Matthew Ryan (2013)

  • Advisor: Peter W. Shor
  • 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

A no-go theorem for derandomized parallel repetition

Ramnarayan, Govind (2016)

  • Advisor: Dana Moshkovitz
  • Department of Electrical Engineering and Computer Science
Read it

The method of multiplicities (2011) read it

Techniques for computing with low-independence randomness

Rompel, John Taylor (1990)

  • Advisor: Frank Thomson Leighton
  • 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

Computationally efficient error-correcting codes and holographic proofs

Spielman, Daniel Alan (1995)

  • Advisor: Michael Sipser
  • Department of Mathematics
Read it

Locally Decodable Codes and Private Information Retrieval Schemes

Yekhanin, Sergey (2007)

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

Learning noisy characters, multiplication codes, and cryptographic hardcore predicates

Akavia, Adi (2008)

  • Advisor: Shafi Goldwasser
  • Department of Electrical Engineering and Computer Science
Read it

Kakeya sets and the method of multiplicities

Saraf, Shubhangi (2009)

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

Algorithms and lower bounds for sparse recovery

Price, Eric (Eric C.) (2010)

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

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