Practical and Optimal LSH for Angular Distance Alexandr Andoni∗ Columbia University Piotr Indyk

Source URL: papers.nips.cc

Approximate Nearest Neighbors Search in High Dimensions and Locality-Sensitive Hashing PAPERS Piotr Indyk, Rajeev Motwani: Approximate Nearest Neighbors: Towards Removing the Curse of Dimensionality, STOC 1998.

Source URL: graphics.stanford.edu

Streaming Algorithms for Set Cover Piotr Indyk With: Sepideh Mahabadi, Ali Vakilian Set Cover

Source URL: dimacs.rutgers.edu

Introduction to Algorithms: 6.006 Massachusetts Institute of Technology Professors Erik Demaine, Piotr Indyk, and Manolis Kellis March 1st, 2011 Problem Set 3

Source URL: courses.csail.mit.edu

Introduction to Algorithms: 6.006 Massachusetts Institute of Technology Professors Erik Demaine, Piotr Indyk, and Manolis Kellis April 12, 2011 Problem Set 6

Source URL: courses.csail.mit.edu

Introduction to Algorithms: 6.006 Massachusetts Institute of Technology Professors Erik Demaine, Piotr Indyk, and Manolis Kellis February 15, 2011 Problem Set 2

Source URL: courses.csail.mit.edu

Beyond     Locality  Sensitive  Hashing   Alex  Andoni     (Microsoft  Research)   Joint  with:  Piotr  Indyk  (MIT),  Huy  L.  Nguyen  (Princeton),  Ilya   Raz

Source URL: mmds-data.org

Introduction to Algorithms: 6.006 Massachusetts Institute of Technology Professors Erik Demaine, Piotr Indyk, and Manolis Kellis March 29, 2011 Problem Set 5

Source URL: courses.csail.mit.edu

Introduction to Algorithms: 6.006 Massachusetts Institute of Technology Professors Erik Demaine, Piotr Indyk, and Manolis Kellis April 12, 2011 Problem Set 6

Source URL: courses.csail.mit.edu

Introduction to Algorithms: 6.006 Massachusetts Institute of Technology Professors Erik Demaine, Piotr Indyk, and Manolis Kellis February 1, 2011 Problem Set 1

Source URL: courses.csail.mit.edu

• Analysis of algorithms
• Computational complexity theory
• Time complexity
• Computer science
• Algorithm
• Mathematics
• Academia
• Oblivious data structure