Theses most similar to those of author Yodpinyanee, Anak

Local computation algorithms for graphs of non-constant degrees (2014) read it

Clustering via matrix exponentiation

Zhou, Hanson M. (Hanson Mi), 1977- (2003)

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

Probabilistic methods in combinatorial and stochastic optimization

Vondrák, Jan, 1974- (2005)

  • Advisor: Michel Goemans
  • Department of Mathematics
Read it

Matchings, matroids and submodular functions

Harvey, Nicholas James Alexander (2008)

  • Advisor: Michel Goemans
  • 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

Faster generation of random spanning trees

Ma̧dry, Aleksander (2009)

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

A new competitive analysis of randomized caching

Law, Ching, 1975- (1999)

  • Advisor: Charles E. Leiserson
  • Department of Electrical Engineering and Computer Science
Read it

Sublinear-time algorithms for counting star subgraphs with applications to join selectivity estimation

Peebles, John Lee Thompson, Jr (2016)

  • Advisors: Jon Kelne; Ronitt Rubinfeld
  • Department of Electrical Engineering and Computer Science
Read it

Improved distributed algorithms for fundamental graph problems

Ghaffari, Mohsen (2017)

  • Advisor: Nancy Lynch
  • Department of Electrical Engineering and Computer Science
Read it