Piotr Indyk
![Arxiv:2102.08942V1 [Cs.DB]](http://data.docslib.org/img/264x/0a5e86f7e57f1b61a7a347ac3622e5d1.webp)
Top View
- The Power of Two Min-Hashes in Similarity Search Among
- Curriculum Vitae
- SETH-Based Lower Bounds for Subset Sum and Bicriteria Path
- Approximate Nearest Neighbor Search in High Dimensions
- References for the “Algorithmic High Dimensional Geometry” Lectures at the Big Data Boot Camp, Simons Institute, Berkeley
- Model Counting Meets F0 Estimation
- Distributed PCP Theorems for Hardness of Approximation in P
- People Like Us: Mining Scholarly Data for Comparable Researchers
- Alexandr Andoni Title: Associate Professor, Dept
- Approximate Nearest Neighbor Algorithms for Hausdorff Metrics Via Embeddings
- Efficient and Private Distance Approximation in The
- SODA14 – Accepted Papers
- In Defense of Minhash Over Simhash
- On Closest Pair in Euclidean Metric: Monochromatic Is As Hard As Bichromatic
- Association for Computing Machinery 2 Penn Plaza, Suite 701, New York
- Sublinear-Time Sparse Recovery, and Its Power in the Design of Exact Algorithms
- Optimal Set Similarity Data-Structures Without False Negatives IT University of Copenhagen
- A Sketch-Based Sampling Algorithm on Sparse Data