Martín Farach-Colton

21 papers A* 4A 1Misc 1Journal 12Unranked 3
YearRankTypeTitle / Venue / Authors
2026 J jnl
Bounding the Fragmentation of B-Trees Subject to Batched Insertions.
CoRR
Michael A. Bender, Aaron Bernstein, Nairen Cao, Alexander Conway, Martín Farach-Colton, Hanna Komlós, Yarin Shechter, Nicole Wein
2025 A conf
Exploring the Landscape of Distributed Graph Sketching.
ALENEX
David Tench, Evan T. West, Kenny Zhang, Michael A. Bender, Daniel DeLayo, Martín Farach-Colton, Gilvir Gill, Tyler Seip, Victor Zhang
2025 A* conf
History-Independent Concurrent Hash Tables.
STOC
Hagit Attiya, Michael A. Bender, Martín Farach-Colton, Rotem Oshman, Noa Schiller
2025 J jnl
History-Independent Concurrent Hash Tables.
CoRR
Hagit Attiya, Michael A. Bender, Martín Farach-Colton, Rotem Oshman, Noa Schiller
2025 J jnl
History-Independent Dynamic Partitioning: Operation-Order Privacy in Ordered Data Structures.
SIGMOD Rec.
Michael A. Bender, Martín Farach-Colton, Michael T. Goodrich, Hanna Komlós
2025 J jnl
Online List Labeling: Breaking the \({\log^2 n}\) Barrier.
SIAM J. Comput.
Michael A. Bender, Alexander Conway, Martín Farach-Colton, Hanna Komlós, William Kuszmaul, Nicole Wein
2025 — conf
The Case for External Graph Sketching.
ACDA
Michael A. Bender, Martín Farach-Colton, Riko Jacob, Hanna Komlós, David Tench, Evan T. West
2025 J jnl
The Case for External Graph Sketching.
CoRR
Michael A. Bender, Martín Farach-Colton, Riko Jacob, Hanna Komlós, David Tench, Evan West
2025 J jnl
Tight Bounds for Monotone Minimal Perfect Hashing.
ACM Trans. Algorithms
Sepehr Assadi, Martín Farach-Colton, William Kuszmaul
2025 J jnl
Time To Replace Your Filter: How Maplets Simplify System Design.
CoRR
Michael A. Bender, Alexander Conway, Martín Farach-Colton, Rob Johnson, Prashant Pandey
2025 J jnl
Tiny Pointers.
ACM Trans. Algorithms
Michael A. Bender, Alexander Conway, Martín Farach-Colton, William Kuszmaul, Guido Tagliavini
2024 — conf
Beyond Bloom: A Tutorial on Future Feature-Rich Filters.
SIGMOD Conference Companion
Prashant Pandey, Martín Farach-Colton, Niv Dayan, Huanchen Zhang
2024 J jnl
GraphZeppelin: How to Find Connected Components (Even When Graphs Are Dense, Dynamic, and Massive).
ACM Trans. Database Syst.
David Tench, Evan West, Victor Zhang, Michael A. Bender, Abiyaz Chowdhury, Daniel DeLayo, J. Ahmed Dellas, Martín Farach-Colton, Tyler Seip, Kenny Zhang
2024 A* conf
History-Independent Concurrent Objects.
PODC
Hagit Attiya, Michael A. Bender, Martín Farach-Colton, Rotem Oshman, Noa Schiller
2024 J jnl
History-Independent Dynamic Partitioning: Operation-Order Privacy in Ordered Data Structures.
Proc. ACM Manag. Data
Michael A. Bender, Martín Farach-Colton, Michael T. Goodrich, Hanna Komlós
2024 — conf
Modern Hashing Made Simple.
SOSA
Michael A. Bender, Martín Farach-Colton, John Kuszmaul, William Kuszmaul
2024 J jnl
Mosaic Pages: Big TLB Reach With Small Pages.
IEEE Micro
Jaehyun Han, Krishnan Gosakan, William Kuszmaul, Ibrahim N. Mubarek, Nirjhar Mukherjee, Karthik Sriram, Guido Tagliavini, Evan West, Michael A. Bender, Abhishek Bhattacharjee, Alex Conway, Martín Farach-Colton, Jayneel Gandhi, Rob Johnson, Sudarsun Kannan, Donald E. Porter
2024 A* conf
Nearly Optimal List Labeling.
FOCS
Michael A. Bender, Alex Conway, Martín Farach-Colton, Hanna Komlós, Michal Koucký, William Kuszmaul, Michael E. Saks
2024 J jnl
Nearly Optimal List Labeling.
CoRR
Michael A. Bender, Alex Conway, Martín Farach-Colton, Hanna Komlós, Michal Koucký, William Kuszmaul, Michael E. Saks
2024 A* conf
Optimal Bounds for Open Addressing Without Reordering.
FOCS
Martín Farach-Colton, Andrew Krapivin, William Kuszmaul
2024 Misc conf
Snake in Optimal Space and Time.
FUN
Philip Bille, Martín Farach-Colton, Inge Li Gørtz, Ivor van der Hoog