Theses most similar to On the hardness of the shortest vector problem (Micciancio, Daniele; 1998) read it

Contributions to the theory of Ehrhart polynomials

Liu, Fu (2006)

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

Algebraic combinatorics of graph spectra, subspace arrangements and Tutte polynomials

Athanasiadis, Christos A (1996)

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

Kac's random walk and coupon collector's process on posets

Sidenko, Sergiy (2008)

  • Advisor: Igor Pak
  • Department of Mathematics
Read it

Testing and learning Boolean functions

Matulef, Kevin Michael (2009)

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

Clustering in high dimensions

Bădoiu, Mihai, 1978- (2003)

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

Algebraic methods in pseudorandomness and circuit complexity

Remscrim, Zachary (Zachary N.) (2016)

  • Advisor: Michael Sipser
  • Department of Electrical Engineering and Computer Science
Read it

Power and limitations of convex formulations via linear and semidefinite programming lifts

Fawzi, Hamza (2016)

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