Theses most similar to those of author Rhee, Donguk

Faster fully polynomial approximation schemes for Knapsack problems (2015) read it

Probabilistic methods in combinatorial and stochastic optimization

Vondrák, Jan, 1974- (2005)

  • Advisor: Michel Goemans
  • Department of Mathematics
Read it

New bounds on optimal binary search trees

Harmon, Dion (Dion Kane) (2006)

  • Advisor: Erik Demaine
  • 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

Low rank matrix completion

Nan, Fen (2009)

  • Advisor: Pablo.A.Parrilo
  • Computation for Design and Optimization Program
Read it

Advances in sparse signal recovery methods

Berinde, Radu (2009)

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

Algorithms for discrete, non-linear and robust optimization problems with applications in scheduling and service operations

Mittal, Shash (2011)

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

Smaller steps for faster algorithms : a new approach to solving linear systems

Sidford, Aaron Daniel (2013)

  • Advisor: Jonathan Kelner
  • Department of Electrical Engineering and Computer Science
Read it

Dimensionality reduction for sparse and structured matrices

Musco, Christopher Paul (2015)

  • Advisors: Jonathan A. Kelner; Martin C. Rinard
  • Department of Electrical Engineering and Computer Science
Read it

Nearly tight oblivious subspace embeddings by trace inequalities

Cohen, Michael B. (2016)

  • Advisor: Jonathan Kelner
  • Department of Electrical Engineering and Computer Science
Read it