Back to authors
Martín Farach-Colton
- Author ID
- 4569
- ORCID
-
0000-0003-3616-7788
- Links
-
(found by gpt-5.2 on feb 8th, 2026)
- Most Frequent Institution
- Rutgers University
- Pagerank
- 0.10384909
- Overall Rank
- 573 | 97.30%
- 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 |
| 1,117 |
Cache-Oblivious String B-trees |
2006 |
PODS |
0.00013882205 |
| 1,248 |
Don't Thrash: How to Cache Your Hash on Flash |
2012 |
VLDB |
0.00013046661 |
| 4,945 |
SplinterDB and Maplets: Improving the Tradeoffs in Key-Value Store Compaction Policy |
2023 |
SIGMOD |
5.8157107e-05 |
| 5,516 |
Vector Quotient Filters: Overcoming the Time/Space Trade-Off in Filter Design |
2021 |
SIGMOD |
5.4628856e-05 |
| 7,769 |
GraphZeppelin: Storage-Friendly Sketching for Connected Components on Dynamic Graph Streams |
2022 |
SIGMOD |
4.6562896e-05 |
| 7,792 |
IcebergHT: High Performance Hash Tables Through Stability and Low Associativity |
2023 |
SIGMOD |
4.6494835e-05 |
| 8,957 |
Adaptive Quotient Filters |
2024 |
SIGMOD |
4.4211093e-05 |
| 10,145 |
Breadcrumb Filters: Fast Fully Featured Filters |
2026 |
SIGMOD |
4.1945683e-05 |
| 10,913 |
Layered List Labeling |
2024 |
PODS |
4.1945683e-05 |
| 10,916 |
History-Independent Dynamic Partitioning: Achieving Operation-Order Privacy in Ordered Data Structures |
2024 |
PODS |
4.1945683e-05 |
| 11,166 |
Optimal Uncoordinated Unique IDs |
2023 |
PODS |
4.1945683e-05 |
| 11,562 |
Timely Reporting of Heavy Hitters using External Memory |
2020 |
SIGMOD |
4.1945683e-05 |
| 11,764 |
Write-Optimized Skip Lists |
2017 |
PODS |
4.1945683e-05 |
| 11,966 |
Cost-Oblivious Storage Reallocation |
2014 |
PODS |
4.1945683e-05 |
Frequent Co-authors
Co-authored at least 5 papers.