Theses most similar to Deterministic algorithms for the Lovász Local Lemma (Haeupler, Bernhard; 2010) read it

Towards constant bandwidth overhead integrity checking of untrusted data

Clarke, Dwaine E. (Dwaine Errol), 1976- (2005)

  • Advisor: Srinivas Devadas
  • Department of Electrical Engineering and Computer Science
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

Computational learning theory : new models and algorithms

Sloan, Robert Hal (1989)

  • Advisor: Ronald L. Rivest
  • Department of Electrical Engineering and Computer Science
Read it

Incrementally verifiable computation or knowledge implies time/space efficiency

Valiant, Paul (Paul Andrew) (2007)

  • Advisor: Silvio Micali
  • Department of Electrical Engineering and Computer Science
Read it

Matchings, matroids and submodular functions

Harvey, Nicholas James Alexander (2008)

  • Advisor: Michel Goemans
  • Department of Electrical Engineering and Computer Science
Read it

Evaluation of boolean formulas with restricted inputs

Zhan, Bohua (2010)

  • Advisor: Edward Farhi
  • Department of Physics
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

The Directed Steiner Network problem is tractable for a constant number of terminals

Feldman, Jon, 1975- (2000)

  • Advisor: David R. Karger
  • 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

Solving problems in P using correlated instances

Holden, Dhiraj (2017)

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