Theses most similar to Approximate nearest neighbor problem in high dimensions (Andoni, Alexandr; 2005) read it
- Advisor: Charles E. Leiserson
- Department of Electrical Engineering and Computer Science
- Advisor: Michel Goemans
- Department of Mathematics
- Advisor: Frank Thomson Leighton
- Department of Electrical Engineering and Computer Science
- Advisor: Erik D. Demaine
- Department of Electrical Engineering and Computer Science
Interactive proof system variants and approximation algorithms for optical networks
Sundaram, Ravi, 1968- (1996)
- Advisor: Michael Sipser
- Department of Electrical Engineering and Computer Science
- Advisor: Alan Edelman
- 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
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: Shafi Goldwasser
- Department of Electrical Engineering and Computer Science