受强制性开放获取政策约束的文章 - Alexandr Andoni了解详情
无法在其他位置公开访问的文章：1 篇
L ÉCOLE hORMALE
A ANDONI, A NAOR, O NEIMAN
强制性开放获取政策： US National Science Foundation
可在其他位置公开访问的文章：19 篇
Optimal hashing-based time-space trade-offs for approximate near neighbors
A Andoni, T Laarhoven, I Razenshteyn, E Waingarten
Proceedings of the twenty-eighth annual ACM-SIAM symposium on discrete …, 2017
强制性开放获取政策： US National Science Foundation, Swiss National Science Foundation
Approximate nearest neighbor search in high dimensions
A Andoni, P Indyk, I Razenshteyn
Proceedings of the International Congress of Mathematicians: Rio de Janeiro …, 2018
强制性开放获取政策： US National Science Foundation
Parallel graph connectivity in log diameter rounds
A Andoni, Z Song, C Stein, Z Wang, P Zhong
2018 IEEE 59th Annual Symposium on Foundations of Computer Science (FOCS …, 2018
强制性开放获取政策： US National Science Foundation
On sketching quadratic forms
A Andoni, J Chen, R Krauthgamer, B Qin, DP Woodruff, Q Zhang
Proceedings of the 2016 ACM Conference on Innovations in Theoretical …, 2016
强制性开放获取政策： US National Science Foundation, Research Grants Council, Hong Kong
Parallel approximate undirected shortest paths via low hop emulators
A Andoni, C Stein, P Zhong
Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing …, 2020
强制性开放获取政策： US National Science Foundation
Lsh forest: Practical algorithms made theoretical
A Andoni, I Razenshteyn, NS Nosatzki
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete …, 2017
强制性开放获取政策： US National Science Foundation
Approximate near neighbors for general symmetric norms
A Andoni, HL Nguyen, A Nikolov, I Razenshteyn, E Waingarten
Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing …, 2017
强制性开放获取政策： US National Science Foundation
Subspace embedding and linear regression with orlicz norm
A Andoni, C Lin, Y Sheng, P Zhong, R Zhong
International Conference on Machine Learning, 224-233, 2018
强制性开放获取政策： US National Science Foundation
Data-dependent hashing via nonlinear spectral gaps
A Andoni, A Naor, A Nikolov, I Razenshteyn, E Waingarten
Proceedings of the 50th annual ACM SIGACT symposium on theory of computing …, 2018
强制性开放获取政策： US National Science Foundation, Natural Sciences and Engineering Research …
Snowflake universality of Wasserstein spaces
A Andoni, A Naor, O Neiman
Ann. Sci. Éc. Norm. Supér.(4) 51 (3), 657-700, 2018
强制性开放获取政策： US National Science Foundation
Correspondence retrieval
A Andoni, D Hsu, K Shi, X Sun
Conference on Learning Theory, 105-126, 2017
强制性开放获取政策： US National Science Foundation
Width of points in the streaming model
A Andoni, HL Nguyêݱn
ACM Transactions on Algorithms (TALG) 12 (1), 1-10, 2016
强制性开放获取政策： US National Science Foundation
Impossibility of sketching of the 3d transportation metric with quadratic cost
A Andoni, A Naor, O Neiman
43rd International Colloquium on Automata, Languages, and Programming (ICALP …, 2016
强制性开放获取政策： US National Science Foundation
Estimating the longest increasing subsequence in nearly optimal time
A Andoni, NS Nosatzki, S Sinha, C Stein
2022 IEEE 63rd Annual Symposium on Foundations of Computer Science (FOCS …, 2022
强制性开放获取政策： US National Science Foundation
Approximate nearest neighbors beyond space partitions
A Andoni, A Nikolov, I Razenshteyn, E Waingarten
Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms (SODA …, 2021
强制性开放获取政策： US National Science Foundation
Attribute-efficient learning of monomials over highly-correlated variables
A Andoni, R Dudeja, D Hsu, K Vodrahalli
Algorithmic Learning Theory, 127-161, 2019
强制性开放获取政策： US National Science Foundation, Department of Science & Technology, India
Differentially private approximate near neighbor counting in high dimensions
A Andoni, P Indyk, S Mahabadi, S Narayanan
Advances in Neural Information Processing Systems 36, 43544-43562, 2023
强制性开放获取政策： US National Science Foundation, US Department of Defense
Data structures for density estimation
A Aamand, A Andoni, JY Chen, P Indyk, S Narayanan, S Silwal
International Conference on Machine Learning, 1-18, 2023
强制性开放获取政策： US National Science Foundation, US Department of Defense, Danish Council for …
Massively parallel tree embeddings for high dimensional spaces
AM Ahanchi, A Andoni, MT Hajiaghayi, M Knittel, P Zhong
Proceedings of the 35th ACM Symposium on Parallelism in Algorithms and …, 2023
强制性开放获取政策： US National Science Foundation
出版信息和资助信息由计算机程序自动确定