Theses most similar to Solving problems in P using correlated instances (Holden, Dhiraj; 2017) read it
A fast algorithm for the string editing problem and decision graph complexity
Masek, William Joseph (1976)
- Advisor: Ronald L. Rivest
- Department of Electrical Engineering and Computer Science
- Advisor: Michel Goemans
- Department of Electrical Engineering and Computer Science
- Advisor: Erik D. Demaine
- Department of Electrical Engineering and Computer Science
- Advisor: David R. Karger
- Department of Electrical Engineering and Computer Science
New sublinear methods in the struggle against classical problems
Onak, Krzysztof (Krzysztof Piotr) (2010)
- Advisor: Ronitt Rubinfeld
- Department of Electrical Engineering and Computer Science
Algorithms and hardness results for the jump number problem, the joint replenishment problem, and the optimal clustering of frequency-constrained maintenance jobs
Telha Cornejo, Claudio (Claudio A.) (2012)
- Advisor: Andreas S. Schulz
- Operations Research Center
- Advisor: Madhu Sudan
- Department of Electrical Engineering and Computer Science
- Advisor: Ronitt Rubinfeld
- Department of Electrical Engineering and Computer Science
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
- Advisor: David R. Karger
- Department of Electrical Engineering and Computer Science