Geometric approximation via coresets, Combinatorial and Computational Geometry, MSRI, pp.1-30, 2005. ,
Near-optimal hashing algorithms for approximate nearest neighbor in high dimensions, Commun. ACM, vol.51, issue.1, pp.117-122, 2008. ,
Similarity estimation techniques from rounding algorithms, Proceedings on 34th Annual ACM Symposium on Theory of Computing, pp.380-388, 2002. ,
Rectangular matrix multiplication revisited, J. Complex, vol.13, issue.1, pp.42-49, 1997. ,
An elementary proof of a theorem of Johnson and Lindenstrauss, Random Struct. Algorithms, vol.22, issue.1, pp.60-65, 2003. ,
Approximate greedy clustering and distance selection for graph metrics, 2015. ,
Reductions among high dimensional proximity problems, Proc. 12th Symposium on Discrete Algorithms (SODA), pp.769-778, 2001. ,
Clustering motion, Discrete & Computational Geometry, vol.31, issue.4, pp.545-565, 2004. ,
Fast construction of nets in low dimensional metrics, and their applications, Proc. 21st Annual Symp. Computational Geometry, SCG'05, pp.150-158, 2005. ,
Net and prune: A linear time algorithm for euclidean distance problems, J. ACM, vol.62, issue.6, p.44, 2015. ,
Finding correlations in subquadratic time, with applications to learning parities and juntas, 53rd Annual IEEE Symp. on Foundations of Computer Science, FOCS 2012, pp.11-20, 2012. ,
Finding correlations in subquadratic time, with applications to learning parities and the closest pair problem, J. ACM, vol.62, issue.2, p.13, 2015. ,