Theses most similar to Probabilistic methods in combinatorial and stochastic optimization (Vondrák, Jan, 1974-; 2005) read it

Robustness in large-scale random networks

Kim, Minkyu, 1976- (2003)

  • Advisor: Médard, Muriel
  • Department of Electrical Engineering and Computer Science
Read it

Approximate nearest neighbor problem in high dimensions

Andoni, Alexandr (2005)

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

Interactive proof system variants and approximation algorithms for optical networks

Sundaram, Ravi, 1968- (1996)

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

Experimental study of minimum cut algorithms

Levine, Matthew S. (Matthew Steven) (1997)

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

Decoding error-correcting codes via linear programming

Feldman, Jon, 1975- (2003)

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

Approximate inference : decomposition methods with applications to networks

Jung, Kyomin (2009)

  • Advisor: Devavrat Shah
  • Department of Mathematics
Read it

Constant time algorithms in sparse graph model

Nguyen, Huy Ngo (2010)

  • Advisor: Alan Edelman
  • Department of Electrical Engineering and Computer Science
Read it

New sublinear methods in the struggle against classical problems

Onak, Krzysztof (Krzysztof Piotr) (2010)

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

From graphs to matrices, and back : new techniques for graph algorithms

Mądry, Aleksander (2011)

  • Advisors: Jonathan A. Kelner; Michel Goemans
  • Department of Electrical Engineering and Computer Science
Read it

Vertex sparsification and universal rounding algorithms

Moitra, Ankur (2011)

  • Advisor: F. Thomson Leighton
  • Department of Electrical Engineering and Computer Science
Read it