Theses most similar to Polynomial identity testing of read-once oblivious algebraic branching programs (Forbes, Michael Andrew; 2014) read it

Robust PCPs of proximity and shorter PCPs

Harsha, Prahladh, 1976- (2004)

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

Order computations in generic groups

Sutherland, Andrew V (2007)

  • Advisor: Michael F. Sipser
  • Department of Mathematics
Read it

The Gowers norm in the testing of Boolean functions

Chen, Victor Yen-Wen (2009)

  • Advisor: Madhu Sudan
  • Department of Mathematics
Read it

A q-analogue of spanning trees : nilpotent transformations over finite fields

Yin, Jingbin (2009)

  • Advisor: Richard P. Stanley
  • Department of Mathematics
Read it

Advances in sparse signal recovery methods

Berinde, Radu (2009)

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

Large-deviation analysis and applications Of learning tree-structured graphical models

Tan, Vincent Yan Fu (2011)

  • Advisor: Alan S. Willsky
  • Department of Electrical Engineering and Computer Science
Read it

Sketching and streaming high-dimensional vectors

Nelson, Jelani (Jelani Osei) (2011)

  • Advisors: Erik D. Demaine; Piotr Indyk
  • Department of Electrical Engineering and Computer Science
Read it

Algebraic relaxations and hardness results in polynomial optimization and Lyapunov analysis

Ahmadi, Amir Ali (2011)

  • Advisor: Dimitris Bertsimas Pablo A. Parrilo
  • Department of Electrical Engineering and Computer Science
Read it

New error correcting codes from lifting

Guo, Alan Xinyu (2015)

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

Structure vs. hardness through the obfuscation lens

Degwekar, Akshay (Akshay Dhananjai) (2016)

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