Theses most similar to Order computations in generic groups (Sutherland, Andrew V; 2007) 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

Dispersion of mass and the complexity of geometric problems

Rademacher, Luis Alexis (2007)

  • Advisor: Santosh Vempala
  • Department of Mathematics
Read it

Combinatorics of determinantal identities

Konvalinka, Matjaž (2008)

  • Advisor: Igor Pak
  • 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

Optimization under moment, robust, and data-driven models of uncertainty

Doan, Xuan Vinh (2010)

  • Advisor: Dimitris J. Bertsimas
  • Operations Research Center
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

Polynomial identity testing of read-once oblivious algebraic branching programs

Forbes, Michael Andrew (2014)

  • Advisors: Amir Shpilka; Scott Aaronson
  • Department of Electrical Engineering and Computer Science
Read it