Theses most similar to those of author Sundaram, Ravi, 1968-

Interactive proof system variants and approximation algorithms for optical networks (1996) read it

Probabilistic methods in combinatorial and stochastic optimization

Vondrák, Jan, 1974- (2005)

  • Advisor: Michel Goemans
  • Department of Mathematics
Read it

Techniques for computing with low-independence randomness

Rompel, John Taylor (1990)

  • Advisor: Frank Thomson Leighton
  • 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

The value of information in shortest path optimization/

Rinehart, Michael David (2010)

  • Advisor: Munther A. Dahleh
  • Department of Electrical Engineering and Computer Science
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

Vertex sparsification and universal rounding algorithms

Moitra, Ankur (2011)

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

The complexity of optimal mechanism design

Tzamos, Christos (2013)

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

Scheduling to minimize power consumption using submodular functions

Zadimoghaddam, Morteza (2010)

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