Theses most similar to New bounds on optimal binary search trees (Harmon, Dion (Dion Kane); 2006) read it

Efficient algorithms for new computational models

Ruhl, Jan Matthias, 1973- (2003)

  • Advisor: David R. Karger
  • Department of Electrical Engineering and Computer Science
Read it

The bidimensionality theory and its algorithmic applications

Hajiaghayi, MohammadTaghi (2005)

  • Advisor: Erik D. Demaine
  • Department of Mathematics
Read it

Robust network computation

Pritchard, David (David Alexander Griffith) (2005)

  • Advisor: Santosh Vempala
  • Department of Electrical Engineering and Computer Science
Read it

Cutting plane algorithms for variational inference in graphical models

Sontag, David Alexander (2007)

  • Advisor: Jaakkola, Tommi S. (Tommi Sakari)
  • Department of Electrical Engineering and Computer Science
Read it

Matchings, matroids and submodular functions

Harvey, Nicholas James Alexander (2008)

  • Advisor: Michel Goemans
  • Department of Electrical Engineering and Computer Science
Read it

Complexity of union-split-find problems

Lai, Katherine Jane (2008)

  • Advisor: Erik D. Demaine
  • Department of Electrical Engineering and Computer Science
Read it

Faster generation of random spanning trees

Ma̧dry, Aleksander (2009)

  • Advisor: Jonathan A. Kelner
  • 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

Faster fully polynomial approximation schemes for Knapsack problems

Rhee, Donguk (2015)

  • Advisor: James B. Orlin
  • Operations Research Center
Read it

Contraction maps and applications to the analysis of iterative algorithms

Zampetakis, Emmanouil (2017)

  • Advisor: Constantinos Daskalakis
  • Department of Electrical Engineering and Computer Science
Read it