Theses most similar to Faster generation of random spanning trees (Ma̧dry, Aleksander; 2009) read it
- Advisor: Erik Demaine
- Department of Mathematics
- Advisor: Mauricio Karchmer
- Department of Electrical Engineering and Computer Science
- Advisor: Santosh Vempala
- Department of Electrical Engineering and Computer Science
- Advisor: Shafi Goldwasser
- Department of Electrical Engineering and Computer Science
- Advisor: Devavrat Shah
- Department of Mathematics
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
Smaller steps for faster algorithms : a new approach to solving linear systems
Sidford, Aaron Daniel (2013)
- Advisor: Jonathan Kelner
- 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