Alexandr Andoni

发表

Streaming Algorithms via Precision Sampling

Alexandr Andoni, Robert Krauthgamer, Krzysztof Onak, 2010, 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science.

Width of Points in the Streaming Model

Alexandr Andoni, Huy L. Nguyen, Alexandr Andoni, 2016, TALG.

Better Bounds for Frequency Moments in Random-Order Streams pdf

Alexandr Andoni, Krzysztof Onak, Andrew McGregor, 2008, ArXiv.

The Sketching Complexity of Graph Cuts pdf

David P. Woodruff, Alexandr Andoni, Robert Krauthgamer, 2014, ArXiv.

Practical and Optimal LSH for Angular Distance

Alexandr Andoni, Piotr Indyk, Ilya P. Razenshteyn, 2015, NIPS.

Interacting with Large Distributed Datasets Using Sketch

Alexandr Andoni, Mihai Budiu, Gordon D. Plotkin, 2016, EGPGV@EuroVis.

Streaming Algorithms from Precision Sampling pdf

Alexandr Andoni, Robert Krauthgamer, Krzysztof Onak, 2010, ArXiv.

LSH Forest: Practical Algorithms Made Theoretical

Alexandr Andoni, Ilya P. Razenshteyn, Negev Shekel Nosatzki, 2017, SODA.

Streaming Complexity of SVMs

David P. Woodruff, Alexandr Andoni, Yi Li, 2020, APPROX-RANDOM.

Lower bounds for embedding edit distance into normed spaces

Alexandr Andoni, Piotr Indyk, Sofya Raskhodnikova, 2003, SODA '03.

Global Alignment of Molecular Sequences via Ancestral State Reconstruction pdf

Alexandr Andoni, Avinatan Hassidim, Constantinos Daskalakis, 2009, ICS.

The Computational Hardness of Estimating Edit Distance [Extended Abstract]

Alexandr Andoni, Robert Krauthgamer, Robert Krauthgamer, 2007, 48th Annual IEEE Symposium on Foundations of Computer Science (FOCS'07).

The Smoothed Complexity of Edit Distance

Alexandr Andoni, Robert Krauthgamer, 2008, ICALP.

Hölder Homeomorphisms and Approximate Nearest Neighbors

Alexandr Andoni, Aleksandar Nikolov, Assaf Naor, 2018, 2018 IEEE 59th Annual Symposium on Foundations of Computer Science (FOCS).

Two Party Distribution Testing: Communication and Security pdf

Alexandr Andoni, Tal Malkin, Negev Shekel Nosatzki, 2018, IACR Cryptol. ePrint Arch..

On the Optimality of the Dimensionality Reduction Method

Alexandr Andoni, Piotr Indyk, Mihai Patrascu, 2006, 2006 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS'06).

Graceful service degradation (or, how to know your payment is late)

Alexandr Andoni, Jessica Staddon, 2005, EC '05.

Homomorphic fingerprints under misalignments: sketching edit and shift distances

Alexandr Andoni, Assaf Goldberger, Andrew McGregor, 2013, STOC '13.

Spectral Approaches to Nearest Neighbor Search

Alexandr Andoni, Robert Krauthgamer, Amirali Abdullah, 2014, 2014 IEEE 55th Annual Symposium on Foundations of Computer Science.

Approximate nearest neighbor problem in high dimensions

Alexandr Andoni, 2005 .

Hardness of Nearest Neighbor under L-infinity

Alexandr Andoni, Mihai Patrascu, Dorian Croitoru, 2008, 2008 49th Annual IEEE Symposium on Foundations of Computer Science.

Parallel algorithms for geometric graph problems

Alexandr Andoni, Krzysztof Onak, Aleksandar Nikolov, 2013, STOC.

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

Alexandr Andoni, Alexandr Andoni, 2009 .

Sketching and Embedding are Equivalent for Norms

Alexandr Andoni, Robert Krauthgamer, Ilya P. Razenshteyn, 2014, STOC.

Eigenvalues of a matrix in the streaming model

Alexandr Andoni, Huy L. Nguyen, Alexandr Andoni, 2013, SODA.

Edit Distance in Near-Linear Time: it's a Constant Factor

Alexandr Andoni, Negev Shekel Nosatzki, 2020, 2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS).

SKETCHING AND EMBEDDING ARE EQUIVALENT FOR

Alexandr Andoni, Robert Krauthgamer, Ilya P. Razenshteyn, 2018 .

An Evaluation of Exhaustive Testing for Data Structures

Sarfraz Khurshid, Martin Rinard, Alexandr Andoni, 2003 .

Special Issue: APPROX-RANDOM 2012: Guest Editors' Foreword

Atri Rudra, Alexandr Andoni, A. Rudra, 2013, Theory Comput..

Corrigendum to "efficient similarity search and classification via rank aggregation" by Ronald Fagin, Ravi Kumar and D. Sivakumar (proc. SIGMOD'03)

Alexandr Andoni, Ronald Fagin, Ravi Kumar, 2008, SIGMOD Conference.

Learning Sparse Polynomial Functions

Alexandr Andoni, Rina Panigrahy, Gregory Valiant, 2014, SODA.

Editorial

Alexandr Andoni, Debmalya Panigrahi, Marcin Pilipczuk, 2017, TALG.

Overcoming the l1 non-embeddability barrier: algorithms for product metrics

Alexandr Andoni, Robert Krauthgamer, Piotr Indyk, 2009, SODA.

Beyond Locality-Sensitive Hashing

Alexandr Andoni, Piotr Indyk, Huy L. Nguyen, 2013, SODA.

Polylogarithmic Approximation for Edit Distance and the Asymmetric Query Complexity

Alexandr Andoni, Robert Krauthgamer, Krzysztof Onak, 2010, FOCS.

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

Alexandr Andoni, Piotr Indyk, P. Indyk, 2006, 2006 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS'06).

Parallel Graph Connectivity in Log Diameter Rounds

Alexandr Andoni, Zhao Song, Clifford Stein, 2018, 2018 IEEE 59th Annual Symposium on Foundations of Computer Science (FOCS).

Approximating Edit Distance in Near-Linear Time

Alexandr Andoni, Krzysztof Onak, 2012, SIAM J. Comput..

Approximate near neighbors for general symmetric norms

Alexandr Andoni, Aleksandar Nikolov, Huy L. Nguyen, 2016, STOC.

Coding with asymmetric prior knowledge pdf

Alexandr Andoni, Dan Rubenstein, Javad Ghaderi, 2017, ArXiv.

External Sampling

Alexandr Andoni, Krzysztof Onak, Ronitt Rubinfeld, 2009, ICALP.

Attribute-efficient learning of monomials over highly-correlated variables

Alexandr Andoni, Kiran Vodrahalli, Daniel Hsu, 2019, ALT.

Tight Lower Bounds for Data-Dependent Locality-Sensitive Hashing pdf

Alexandr Andoni, Ilya P. Razenshteyn, Alexandr Andoni, 2015, SoCG.

Optimal Data-Dependent Hashing for Approximate Near Neighbors

Alexandr Andoni, Ilya P. Razenshteyn, Alexandr Andoni, 2015, STOC.

Optimal Hashing-based Time-Space Trade-offs for Approximate Near Neighbors pdf

Alexandr Andoni, Ilya P. Razenshteyn, Thijs Laarhoven, 2016, SODA.

High-Dimensional Computational Geometry

Alexandr Andoni, Alexandr Andoni, 2016, Handbook of Big Data.

Efficient algorithms for substring near neighbor problem

Alexandr Andoni, Piotr Indyk, 2006, SODA '06.

Session details: Session 12A

Alexandr Andoni, Alexandr Andoni, 2011, STOC '11.

Parallel approximate undirected shortest paths via low hop emulators

Alexandr Andoni, Clifford Stein, Peilin Zhong, 2019, STOC.

On Solving Linear Systems in Sublinear Time

Alexandr Andoni, Robert Krauthgamer, Yosef Pogrow, 2018, ITCS.

Towards (1 + ∊)-Approximate Flow Sparsifiers pdf

Alexandr Andoni, Robert Krauthgamer, Anupam Gupta, 2013, SODA.

Data-dependent hashing via nonlinear spectral gaps

Alexandr Andoni, Aleksandar Nikolov, Assaf Naor, 2018, STOC.

Sublinear Algorithms in the External Memory Model

Alexandr Andoni, Krzysztof Onak, Ronitt Rubinfeld, 2010, Property Testing.

Nearest Neighbor Search in High-Dimensional Spaces

Alexandr Andoni, 2011, MFCS.

A Differential Equations Approach to Optimizing Regret Trade-offs pdf

Alexandr Andoni, Rina Panigrahy, Alexandr Andoni, 2013, ArXiv.

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

Alexandr Andoni, Piotr Indyk, P. Indyk, 2006, 2006 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS'06).

On Sketching Quadratic Forms

David P. Woodruff, Alexandr Andoni, Robert Krauthgamer, 2015, ITCS.

Subspace Embedding and Linear Regression with Orlicz Norm pdf

Alexandr Andoni, Ying Sheng, Peilin Zhong, 2018, ICML.

Efficient Sketches for Earth-Mover Distance, with Applications

David P. Woodruff, Alexandr Andoni, Piotr Indyk, 2009, 2009 50th Annual IEEE Symposium on Foundations of Computer Science.

NN search : the old, the new, and the impossible

Alexandr Andoni, Alexandr Andoni, 2009 .

Learning Polynomials with Neural Networks

Alexandr Andoni, Rina Panigrahy, Gregory Valiant, 2014, ICML.

Batch Sparse Recovery, or How to Leverage the Average Sparsity pdf

Alexandr Andoni, Robert Krauthgamer, Lior Kamma, 2018, ArXiv.

Near Linear Lower Bound for Dimension Reduction in L1

Alexandr Andoni, Huy L. Nguyen, Moses Charikar, 2011, 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science.

Testing k-wise and almost k-wise independence

Noga Alon, Alexandr Andoni, Ronitt Rubinfeld, 2007, STOC '07.

Lower bounds for edit distance and product metrics via Poincaré-type inequalities

Alexandr Andoni, T. S. Jayram, Mihai Patrascu, 2010, SODA '10.

Lower Bounds on Time-Space Trade-Offs for Approximate Near Neighbors pdf

Alexandr Andoni, Ilya P. Razenshteyn, Thijs Laarhoven, 2016, ArXiv.

Log Diameter Rounds Algorithms for 2-Vertex and 2-Edge Connectivity pdf

Alexandr Andoni, Clifford Stein, Peilin Zhong, 2019, ICALP.

High frequency moments via max-stability

Alexandr Andoni, Alexandr Andoni, 2017, 2017 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP).

Impossibility of Sketching of the 3D Transportation Metric with Quadratic Cost

Alexandr Andoni, Assaf Naor, Ofer Neiman, 2016, ICALP.

Learning sparse polynomials

Alexandr Andoni, Li Zhang, Rina Panigrahy, 2014 .

Near-optimal sublinear time algorithms for Ulam distance

Alexandr Andoni, Huy L. Nguyen, 2010, SODA '10.

Shift Finding in Sub-Linear Time

Alexandr Andoni, Piotr Indyk, Dina Katabi, 2013, SODA.

Approximate Nearest Neighbor Search in High Dimensions pdf

Alexandr Andoni, Piotr Indyk, Ilya P. Razenshteyn, 2018, Proceedings of the International Congress of Mathematicians (ICM 2018).

Approximating edit distance in near-linear time pdf

Alexandr Andoni, Krzysztof Onak, Alexandr Andoni, 2009, STOC '09.

The Computational Hardness of Estimating Edit Distance [Extended Abstract]

Alexandr Andoni, Robert Krauthgamer, 2007, FOCS.

Correspondence retrieval

Alexandr Andoni, Xiaorui Sun, Kevin Shi, 2017, COLT.

The smoothed complexity of edit distance

Alexandr Andoni, Robert Krauthgamer, Robert Krauthgamer, 2008, TALG.

Approximate line nearest neighbor in high dimensions

Alexandr Andoni, Robert Krauthgamer, Piotr Indyk, 2009, SODA.

Polylogarithmic Approximation for Edit Distance and the Asymmetric Query Complexity

Alexandr Andoni, Robert Krauthgamer, Krzysztof Onak, 2010, 2010 IEEE 51st Annual Symposium on Foundations of Computer Science.

Tight Lower Bound for Linear Sketches of Moments pdf

Alexandr Andoni, Huy L. Nguyen, Yihong Wu, 2013, ICALP.

Earth mover distance over high-dimensional spaces

Alexandr Andoni, Robert Krauthgamer, Piotr Indyk, 2008, SODA '08.

Estimating the Longest Increasing Subsequence in Nearly Optimal Time pdf

Alexandr Andoni, Clifford Stein, Negev Shekel Nosatzki, 2021, ArXiv.

Special Section on the 48th Annual ACM Symposium on Theory of Computing (STOC 2016)

Alexandr Andoni, Debmalya Panigrahi, Keren Censor-Hillel, 2021, SIAM J. Comput..

Approximate Nearest Neighbors Beyond Space Partitions

Alexandr Andoni, Ilya P. Razenshteyn, Erik Waingarten, 2021, ACM-SIAM Symposium on Discrete Algorithms.

From Average Embeddings To Nearest Neighbor Search pdf

Alexandr Andoni, David Cheikhi, 2021, ArXiv.

Learning to Hash Robustly, with Guarantees pdf

Alexandr Andoni, Daniel Beaglehole, 2021, ArXiv.

New LSH-based Algorithm for Approximate Nearest Neighbor

Alexandr Andoni, Piotr Indyk, P. Indyk, 2005 .

The Computational Hardness of Estimating Edit Distance

Alexandr Andoni, Robert Krauthgamer, Robert Krauthgamer, 2010 .

Phylogenetic Reconstruction with Insertions and Deletions

Mark Braverman, Alexandr Andoni, Avinatan Hassidim, 2009 .

Explorer Interacting with Large Distributed Datasets using Sketch

Alexandr Andoni, Mihai Budiu, Derek Murray, 2016 .

Block Heavy Hitters

Alexandr Andoni, Piotr Indyk, Khanh Do Ba, 2008 .