Theses most similar to Bounds on multithreaded computations by work stealing (Suksompong, Warut; 2014) 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

Efficient algorithms for new computational models

Ruhl, Jan Matthias, 1973- (2003)

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

Fault-tolerant sorting networks

Ma, Yuan (1994)

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

Approximation algorithms for stochastic scheduling on unrelated machines

Scott, Jacob (Jacob Healy) (2008)

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

Scheduling adaptively parallel jobs

Song, Bin, 1970- (1998)

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

Deterministic algorithms for the Lovász Local Lemma

Haeupler, Bernhard (2010)

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

Matroid prophet inequalities and Bayesian mechanism design

Weinberg, S. Matthew (Seth Matthew) (2012)

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

Algorithms and approximation schemes for machine scheduling problems

Sengupta, Sudipta, 1974- (1999)

  • Advisor: James B. Orlin
  • 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