Theses most similar to A new competitive analysis of randomized caching (Law, Ching, 1975-; 1999) read it

Admission control and routing : theory and practice

Gawlick, Rainer (1995)

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

Lower bound techniques for data structures

Pǎtraşcu, Mihai (2008)

  • Advisor: Erik D. Demaine
  • 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

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

Vertex sparsification and universal rounding algorithms

Moitra, Ankur (2011)

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

Probabilistic methods for distributed information dissemination

Haeupler, Bernhard (2013)

  • Advisors: David Karger; Jonathan Kelner
  • Department of Electrical Engineering and Computer Science
Read it

Bounds on multithreaded computations by work stealing

Suksompong, Warut (2014)

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

Local computation algorithms for graphs of non-constant degrees

Yodpinyanee, Anak (2014)

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