Back to authors
Piotr Indyk
- Author ID
- u4838
- ORCID
-
-
- Links
-
(found by gpt-5.6-luna on jul 24 2026)
- Most Frequent Institution
- Massachusetts Institute of Technology
- Pagerank
- 0.1306364
- Overall Rank
- 481 | 97.78%
- 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 |
| 20 |
Similarity Search in High Dimensions via Hashing |
1999 |
VLDB |
0.00057568153 |
| 742 |
Dynamic Multidimensional Histograms |
2002 |
SIGMOD |
0.0001431602 |
| 1,636 |
Space-optimal Heavy Hitters with Strong Error Bounds |
2009 |
PODS |
0.00010016656 |
| 1,661 |
Rapid Sampling for Visualizations with Ordering Guarantees |
2015 |
VLDB |
9.9535453e-05 |
| 2,362 |
Streaming Similarity Search over one Billion Tweets using Parallel Locality-Sensitive Hashing |
2013 |
VLDB |
8.5746436e-05 |
| 2,676 |
Enhanced hypertext categorization using hyperlinks |
1998 |
SIGMOD |
8.1463601e-05 |
| 2,759 |
Composable Core-sets for Diversity and Coverage Maximization |
2014 |
PODS |
8.0503817e-05 |
| 3,211 |
Comparing Data Streams Using Hamming Norms (How to Zero In) |
2002 |
VLDB |
7.536045e-05 |
| 3,702 |
Identifying Representative Trends in Massive Time Series Data Sets Using Sketches |
2000 |
VLDB |
7.0842822e-05 |
| 4,283 |
Towards Tight Bounds for the Streaming Set Cover Problem |
2016 |
PODS |
6.6890865e-05 |
| 6,639 |
Approximating and Testing k-Histogram Distributions in Sub-linear Time |
2012 |
PODS |
5.7259633e-05 |
| 7,849 |
Tight Trade-offs for the Maximum k-Coverage Problem in the General Streaming Model |
2019 |
PODS |
5.4410785e-05 |
| 9,258 |
Sketching via Hashing: From Heavy Hitters to Compressive Sensing to Sparse Fourier Transform |
2013 |
PODS |
5.2056825e-05 |
| 13,886 |
Erratum for: Approximating and Testing k-Histogram Distributions in Sub-linear Time |
2015 |
PODS |
- |