Back to authors
Piotr Indyk
- Author ID
- 4841
- ORCID
-
-
- Links
-
(found by gpt-5.2 on feb 8th, 2026)
- Most Frequent Institution
- Massachusetts Institute of Technology
- Pagerank
- 0.13592966
- Overall Rank
- 418 | 98.03%
- Paper Count
- 14
Affiliation Timeline
Incoming Non-self Citations Over Time
Total yearly non-self incoming citations across all papers by this author.
Publications by Paper Pagerank
Showing 14 of 14 publications.
| Rank |
Title |
Year |
Venue |
Pagerank |
| 34 |
Similarity Search in High Dimensions via Hashing |
1999 |
VLDB |
0.00076637636 |
| 852 |
Dynamic Multidimensional Histograms |
2002 |
SIGMOD |
0.00015941524 |
| 1,606 |
Enhanced hypertext categorization using hyperlinks |
1998 |
SIGMOD |
0.00011174873 |
| 1,629 |
Space-optimal Heavy Hitters with Strong Error Bounds |
2009 |
PODS |
0.00011085267 |
| 2,011 |
Rapid Sampling for Visualizations with Ordering Guarantees |
2015 |
VLDB |
9.7964875e-05 |
| 2,749 |
Towards Tight Bounds for the Streaming Set Cover Problem |
2016 |
PODS |
8.1773535e-05 |
| 2,752 |
Composable Core-sets for Diversity and Coverage Maximization |
2014 |
PODS |
8.1742326e-05 |
| 2,870 |
Streaming Similarity Search over one Billion Tweets using Parallel Locality-Sensitive Hashing |
2013 |
VLDB |
7.9799783e-05 |
| 3,050 |
Comparing Data Streams Using Hamming Norms (How to Zero In) |
2002 |
VLDB |
7.6512619e-05 |
| 3,794 |
Identifying Representative Trends in Massive Time Series Data Sets Using Sketches |
2000 |
VLDB |
6.7617267e-05 |
| 6,637 |
Approximating and Testing k-Histogram Distributions in Sub-linear Time |
2012 |
PODS |
4.9816401e-05 |
| 7,145 |
Tight Trade-offs for the Maximum k-Coverage Problem in the General Streaming Model |
2019 |
PODS |
4.8179617e-05 |
| 9,060 |
Sketching via Hashing: From Heavy Hitters to Compressive Sensing to Sparse Fourier Transform |
2013 |
PODS |
4.4039656e-05 |
| 13,372 |
Erratum for: Approximating and Testing k-Histogram Distributions in Sub-linear Time |
2015 |
PODS |
- |