Author:
Naor Assaf,Pisier Gilles,Schechtman Gideon
Funder
United States-Israel Binational Science Foundation
National Science Foundation
David and Lucile Packard Foundation
Simons Foundation
Israel Science Foundation
Publisher
Springer Science and Business Media LLC
Subject
Computational Theory and Mathematics,Discrete Mathematics and Combinatorics,Geometry and Topology,Theoretical Computer Science
Reference99 articles.
1. Alon, N.: Problems and results in extremal combinatorics. I. Discrete Math. 273(1–3), 31–53 (2003)
2. Andoni, A.: Nearest neighbor search in high-dimensional spaces. In: Murlak F., Sankowski P. (eds.) Proceedings of the 36th International Symposium on Mathematical Foundations of Computer Science (MFCS 2011). Lecture Notes in Computer Science, vol. 6907, pp. 1. Springer, Berlin (2011). www.mit.edu/~andoni/papers/nns-mfcs.pptx
3. Andoni, A., Charikar, M.S., Neiman, O., Nguy$$\tilde{\hat{{\rm e}}}$$n, H.L.: Near linear lower bound for dimension reduction in $$\ell _1$$. In: 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science (FOCS 2011), pp. 315–323. IEEE Computer Society, Los Alamitos (2011)
4. Andoni, A., Naor, A., Neiman, O.: On isomorphic dimension reduction in $$\ell _1$$ (2017). Preprint
5. Andoni, A., Naor, A., Nikolov, A., Razenshteyn, I., Waingarten, E.: Data-dependent hashing via nonlinear spectral gaps. In: STOC’18—Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing, pp. 787–800. ACM, New York (2018)
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献