Sotabase

Career

· Member Of Technical Staff, Anthropic2024–
· Assistant Professor, Stanford University2024–
· Member Of Technical Staff, Anthropic2023–2024
· Assistant Professor (on Leave), Paul G. Allen School of Computer Science & Engineering2023–2024
· Advisor, Yellow2023–2025
· Research Scientist, Allen Institute for AI (AI2)2022–2023
· Assistant Professor, Paul G. Allen School of Computer Science & Engineering2021–2024
· Visiting Research Scientist, Toyota Research Institute2020–2021
· Postdoctoral Researcher, UC Berkeley Electrical Engineering & Computer Sciences (EECS)2018–2020
· Software Engineering Intern, Google2016–2017
· Software Engineering Intern, Google2013–2013
· Research Intern, Shell Oil Company2012–2012
· Software Engineering Intern (part Time), Google2011–2011
· Doctor of Philosophy (PhD), Computer Science, Massachusetts Institute of Technology2011–2017
· Master of Science (MS), Computer Science, Massachusetts Institute of Technology2011–2013
· PHD Student, MIT2011–2018
· Software Engineering Intern, Google2010–2017
· Bachelor's degree, Computer Science, University of Cambridge2008–2011

Publications (550)

Approximate Nearest Neighbor: Towards Removing the Curse of Dimensionality
Theory of Computing · 2012
4,800
cited
Similarity Search in High Dimensions via Hashing
Very Large Data Bases Conference · 1999
3,948
cited
Locality-sensitive hashing scheme based on p-stable distributions
SCG '04 · 2004
3,378
cited
Near-Optimal Hashing Algorithms for Approximate Nearest Neighbor in High Dimensions
IEEE Annual Symposium on Foundations of Computer Science · 2006
2,576
cited
Enhanced hypertext categorization using hyperlinks
ACM SIGMOD Conference · 1998
939
cited
Maintaining Stream Statistics over Sliding Windows
SIAM journal on computing (Print) · 2002
924
cited
Stable distributions, pseudorandom generators, embeddings and data stream computation
Proceedings 41st Annual Symposium on Foundations of Computer Science · 2000
740
cited
Nearest-Neighbor Methods in Learning and Vision: Theory and Practice (Neural Information Processing)
2006
584
cited
Practical and Optimal LSH for Angular Distance
Neural Information Processing Systems · 2015
526
cited
Finding interesting associations without support pruning
Proceedings / International Conference on Data Engineering · 2000
488
cited
Approximate clustering via core-sets
Symposium on the Theory of Computing · 2002
463
cited
Combining geometry and combinatorics: A unified approach to sparse signal recovery
2008 46th Annual Allerton Conference on Communication, Control, and Computing · 2008
445
cited
Edit Distance Cannot Be Computed in Strongly Subquadratic Time (unless SETH is false)
Symposium on the Theory of Computing · 2014
429
cited
Sparse Recovery Using Sparse Matrices
Proceedings of the IEEE · 2010
410
cited
Simple and practical algorithm for sparse Fourier transform
ACM-SIAM Symposium on Discrete Algorithms · 2012
372
cited
Nearly optimal sparse fourier transform
Symposium on the Theory of Computing · 2012
340
cited
Fast estimation of diameter and shortest paths (without matrix multiplication)
ACM-SIAM Symposium on Discrete Algorithms · 1996
326
cited
Nearest-Neighbor Methods in Learning and Vision
IEEE Trans. Neural Networks · 2008
326
cited
Fast, small-space algorithms for approximate histogram maintenance
Symposium on the Theory of Computing · 2002
305
cited
Algorithmic applications of low-distortion geometric embeddings
Proceedings IEEE International Conference on Cluster Computing · 2001
302
cited
Sotabase
Piotr Indyk | Researcher Profile | Sotabase | Sotabase