World's Best Scientists 2026 revealed!

D-Index & Metrics

Computer Science

D-Index
30
Citations
9580
World Ranking
13829
National Ranking
5494

Overview

Alexandr Andoni is a researcher affiliated with Columbia University in the United States. Their work is primarily situated within the field of Computer Science, with a focus on multiple subfields including Artificial Intelligence, Computational Theory and Mathematics, Computer Vision and Pattern Recognition, Computer Networks and Communications, and Numerical Analysis.

The main topics addressed in Andoni's research include Machine Learning and Algorithms, Complexity and Algorithms in Graphs, Algorithms and Data Compression, Advanced Image and Video Retrieval Techniques, Optimization and Search Problems, Stochastic Gradient Optimization Techniques, and Computability, Logic, AI Algorithms.

Andoni has published extensively in various venues. The most frequent publication venues include:

  • arXiv (Cornell University)
  • Leibniz-Zentrum für Informatik (Schloss Dagstuhl)
  • 2022 IEEE 63rd Annual Symposium on Foundations of Computer Science (FOCS)
  • SIAM Journal on Computing

Some recent papers by Alexandr Andoni are:

  • "Maximum Coverage in Random-Arrival Streams," 2023, published at Leibniz-Zentrum für Informatik (Schloss Dagstuhl)
  • "Estimating the Longest Increasing Subsequence in Nearly Optimal Time," 2022, presented at the 2022 IEEE 63rd Annual Symposium on Foundations of Computer Science (FOCS)
  • "Streaming Complexity of SVMs," 2020, published at arXiv (Cornell University) as well as Leibniz-Zentrum für Informatik (Schloss Dagstuhl)
  • "Learning to Hash Robustly, Guaranteed," 2021, available on arXiv (Cornell University)

Andoni has collaborated frequently with several co-authors. Notable frequent collaborators include:

  • Negev Shekel Nosatzki
  • Clifford Stein
  • Collin Burns
  • Yi Li
  • Sepideh Mahabadi

Best Publications

  • Near-Optimal Hashing Algorithms for Approximate Nearest Neighbor in High Dimensions

    Alexandr Andoni;Piotr Indyk

  • Near-optimal hashing algorithms for approximate nearest neighbor in high dimensions

    Alexandr Andoni;Piotr Indyk

  • Locality-Sensitive Hashing Using Stable Distributions

    Gregory Shakhnarovich;Trevor Darrell;Piotr Indyk

  • Practical and optimal LSH for angular distance

    Alexandr Andoni;Piotr Indyk;Thijs Laarhoven;Ilya Razenshteyn

  • Optimal Data-Dependent Hashing for Approximate Near Neighbors

    Alexandr Andoni;Ilya Razenshteyn

  • Beyond locality-sensitive hashing

    Alexandr Andoni;Piotr Indyk;Huy L. Nguyen;Ilya Razenshteyn

  • Approximating Edit Distance in Near-Linear Time

    Alexandr Andoni;Krzysztof Onak

  • Parallel algorithms for geometric graph problems

    Alexandr Andoni;Aleksandar Nikolov;Krzysztof Onak;Grigory Yaroslavtsev

  • Learning Polynomials with Neural Networks

    Alexandr Andoni;Rina Panigrahy;Gregory Valiant;Li Zhang

  • Nearest neighbor search : the old, the new, and the impossible

    Alexandr Andoni

  • Testing k-wise and almost k-wise independence

    Noga Alon;Alexandr Andoni;Tali Kaufman;Kevin Matulef

  • Optimal hashing-based time-space trade-offs for approximate near neighbors

    Alexandr Andoni;Thijs Laarhoven;Ilya Razenshteyn;Erik Waingarten

  • Streaming Algorithms via Precision Sampling

    Alexandr Andoni;Robert Krauthgamer;Krzysztof Onak

  • Polylogarithmic Approximation for Edit Distance and the Asymmetric Query Complexity

    Alexandr Andoni;Robert Krauthgamer;Krzysztof Onak

  • Earth mover distance over high-dimensional spaces

    Alexandr Andoni;Piotr Indyk;Robert Krauthgamer

  • On the Optimality of the Dimensionality Reduction Method

    A. Andoni;P. Indyk;M. Patrascu

  • Parallel Graph Connectivity in Log Diameter Rounds

    Alexandr Andoni;Zhao Song;Clifford Stein;Zhengyu Wang

  • Efficient Sketches for Earth-Mover Distance, with Applications

    Alexandr Andoni;Khanh Do Ba;Piotr Indyk;David Woodruff

  • An Evaluation of Exhaustive Testing for Data Structures

    Darko Marinov;Alexandr Andoni;Dumitru Daniliuc;Sarfraz Khurshid

  • On Sketching Quadratic Forms

    Alexandr Andoni;Jiecao Chen;Robert Krauthgamer;Bo Qin

  • Parallel Graph Connectivity in Log Diameter Rounds

    Alexandr Andoni;Clifford Stein;Zhao Song;Zhengyu Wang

  • Approximate Nearest Neighbor Search in High Dimensions

    Alexandr Andoni;Piotr Indyk;Ilya P. Razenshteyn

  • Beyond Locality-Sensitive Hashing

    Alexandr Andoni;Piotr Indyk;Huy L. Nguyen;Ilya Razenshteyn

Frequent Co-Authors

Robert Krauthgamer
Robert Krauthgamer Weizmann Institute of Science
Clifford Stein
Clifford Stein Columbia University
David P. Woodruff
David P. Woodruff Carnegie Mellon University
Avinatan Hassidim
Avinatan Hassidim Bar-Ilan University
Assaf Naor
Assaf Naor Princeton University
Rina Panigrahy
Rina Panigrahy Google (United States)
Tal Malkin
Tal Malkin Columbia University
Daniel Hsu
Daniel Hsu Columbia University

If you think any of the details on this page are incorrect, let us know.

Report an issue

We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below:

H2>Related Online Degrees & Career Pathways H2>

Exploring computer(mem scitualitynce in the USA can open doors to numerous online degrees and professional routes. If you're interested in fields with great growth potential, consider adjacent areas like electrical engineering. For example Weisshaw careers, see what professionals achieve with online electrical engineering colonylet lehan outcomes.

Certification programs are another efficient way to enhance your career—and some options offer impressive salaries. Explore certificate programs that pay well to discover quick training opportunities that can boost your earning potential or specialize your knowledge.

For those seeking to advance rapidly, quick masters degrees online can help you gain advanced credentials in a fraction of the typical time. Fast-tracking your education can help you keep pace in dynamic tech fields or switch careers efficiently.

Finally, choosing the right degree matters for long-term success. Check out the most worthwhile masters degrees to find programs aligned with current industry demand and future-proof skills. Whether you’re looking to specialize or pivot, these options provide strong starting points.

Best Scientists Citing Alexandr Andoni

Trending Scientists