Theses most similar to Sparse regularity and relative Szemerédi theorems (Zhao, Yufei; 2015) read it

New geometric techniques for linear programming and graph partitioning

Kelner, Jonathan, 1980- (2006)

  • Advisors: Daniel A. Spielman; Madhu Sudan
  • Department of Electrical Engineering and Computer Science
Read it

Conformal and asymptotic properties of embedded genus-g minimal surfaces with one end

Bernstein, Jaco (2009)

  • Advisor: Tobias H. Colding
  • Department of Mathematics
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

Tensor rank : some lower and upper bounds

Forbes, Michael Andrew (2011)

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

Algorithms and hardness results for the jump number problem, the joint replenishment problem, and the optimal clustering of frequency-constrained maintenance jobs

Telha Cornejo, Claudio (Claudio A.) (2012)

  • Advisor: Andreas S. Schulz
  • Operations Research Center
Read it

Testing k-wise independent distributions

Xie, Nin (2012)

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

The combinatorics of adinkras

Zhang, Ya (2013)

  • Advisor: Richard P. Stanley
  • Department of Mathematics
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

Combinatorics of acyclic orientations of graphs : algebra, geometry and probability

Iriarte Giraldo, Benjamin (2015)

  • Advisor: Richard P. Stanley
  • Department of Mathematics
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