Theses most similar to Lower bound techniques for data structures (Pǎtraşcu, Mihai; 2008) 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

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

Probabilistic methods for distributed information dissemination

Haeupler, Bernhard (2013)

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

Fast long lived renaming

Kopinsky, Justin (2014)

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

A study of efficient secret sharing

Vasudevan, Prashant (2015)

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

Solving problems in P using correlated instances

Holden, Dhiraj (2017)

  • Advisor: Shafi Goldwasser
  • Department of Electrical Engineering and Computer Science
Read it