Martin Farach-Colton
where else to find them
no profile links on file
what they talk about
where they keep going back
no series more than once — all 4 in the filters
on a stage with
all 15 in the filters
who talks about the same things
nobody close enough yet
| title | conference | date |
|---|---|---|
| How do to do research with Systems Researchers | Algorithmic Foundations for Emerging Computing Technologies Boot Camp 2025 | 2025-09-08 |
Covers concrete claims and artifacts: replacing B-trees with write‑optimized structures (a B-epsilon tree) yields up to a 200x speedup on random inserts… | ||
| What Does Dynamic Optimality Mean in External Memory? | ITCS 2022 | 2022-01-31 |
Defines external-memory dynamic optimality for update-heavy workloads, builds a new Jello tree and proves it is statically optimal and competitive against any… | ||
| SplinterDB: Closing the Bandwidth Gap for NVMe Key-Value Stores | USENIX ATC '20 | 2020-07-15 |
SplinterDB implements a new data structure, the STBε-tree, plus a flush-and-compact execution model and a small-cache design, and it runs on an Intel Optane… | ||
| How to Copy Files | FAST '20 | 2020-02-24 |
A concrete implementation in BetrFS 0.5 converts Bε-trees into a Bε-DAG and delivers logical clones by delaying physical copies until many writes accumulate, a… | ||
| nothing matches | ||