Guy Blelloch
where else to find them
what they talk about
where they keep going back
no series more than once — all 3 in the filters
on a stage with
never shared a talk
who talks about the same things
nobody close enough yet
| title | conference | date |
|---|---|---|
| How to Manage High-Bandwidth Memory Automatically | Managing Memory 2025 | 2025-09-29 |
Implements a concurrent hash table that keeps each bucket as a multiword block and tries a single cache-line read via a sequence-number check, falling back to… | ||
| Parallelism in Dynamic Graph Algorithms | Dynamic Graphs and Algorithm Design (Simons Institute, 2023) | 2023-09-18 |
Shows concrete parallel algorithms and costs: a batch incremental MST that prunes and compresses the tree with an RC-tree hierarchy and runs in about k… | ||
| Big Data on Smallish Machines | Parallel and Distributed Algorithms for Inference and Optimization (Simons Institute, Oct. 21–24, 2013) | 2013-10-21 |
Argues that many “big” graphs actually fit on single shared‑memory servers: 6.6 billion edges fits on a $20k, 64‑core, 2 TB server and simple graph compression… | ||
| nothing matches | ||