1. Access to Data and Number of Iterations
2. Approximate nearest neighbors and the fast Johnson-Lindenstrauss transform
3. Noga Alon , Richard M. Karp , David Peleg , and Douglas B . West . 1995 . A Graph- Theoretic Game and Its Application to the k-Server Problem. SIAM J. Comput . (1995), 78--100. Noga Alon, Richard M. Karp, David Peleg, and Douglas B. West. 1995. A Graph- Theoretic Game and Its Application to the k-Server Problem. SIAM J. Comput. (1995), 78--100.
4. Alexandr Andoni . 2009. Nearest Neighbor Search: the Old, the New, and the Impossible. Ph. D. Dissertation . Massachusetts Institute of Technology , Cambridge, MA, USA . Alexandr Andoni. 2009. Nearest Neighbor Search: the Old, the New, and the Impossible. Ph. D. Dissertation. Massachusetts Institute of Technology, Cambridge, MA, USA.
5. Parallel algorithms for geometric graph problems