Theses most similar to Local list decoding of homomorphisms (Grigorescu, Elen; 2006) 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

Tensor rank : some lower and upper bounds

Forbes, Michael Andrew (2011)

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

Testability of linear-invariant properties

Bhattacharyya, Arnab (2011)

  • Advisor: Ronitt Rubinfeld
  • 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

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

A study of efficient secret sharing

Vasudevan, Prashant (2015)

  • Advisor: Vinod Vaikuntanathan
  • Department of Electrical Engineering and Computer Science
Read it

Entangled protocols and non-local games for testing quantum systems.

Coudron., Matthew Ryan (2017)

  • Advisor: Peter W. Shor
  • Department of Electrical Engineering and Computer Science
Read it

SNARKs for C : verifying program executions succinctly and in zero knowledge

Virza, Madars (2014)

  • Advisors: Eli Ben-Sasson; Ronald L. Rivest
  • Department of Electrical Engineering and Computer Science
Read it