Theses most similar to Complexity of union-split-find problems (Lai, Katherine Jane; 2008) 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

New bounds on optimal binary search trees

Harmon, Dion (Dion Kane) (2006)

  • Advisor: Erik Demaine
  • Department of Mathematics
Read it

Provably good race detection that runs in parallel

Fineman, Jeremy T (2005)

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

Extracting the K best solutions from a valued and-or acyclic graph

Elliott, Paul Harrison, 1979- (2007)

  • Advisors: Brian C. Williams; Howard Shrobe
  • Department of Electrical Engineering and Computer Science
Read it

Algorithms for data-race detection in multithreaded programs

Cheng, Guang-Ien, 1975- (1998)

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

Discrete element computation : algorithms and architecture

Perkins, Eric David, 1975- (2001)

  • Advisor: John R. Williams
  • Department of Civil and Environmental Engineering
Read it

Design and analysis of a nondeterministic parallel breadth-first search algorithm

Schardl, Tao Benjamin (2010)

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

Optimization problems in network connectivity

Panigrahi, Debmalya (2012)

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

Faster fully polynomial approximation schemes for Knapsack problems

Rhee, Donguk (2015)

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

Scalable algorithms for semi-automatic segmentation of electron microscopy images of the brain tissue

Zlateski, Aleksandar (2016)

  • Advisors: H. Sebastian Seung; Nir Shavit
  • Department of Electrical Engineering and Computer Science
Read it