Mikkel Thorup
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 2 in the filters
on a stage with
never shared a talk
who talks about the same things
nobody close enough yet
| title | conference | date |
|---|---|---|
| Pseudorandom Hashing for Space-bounded Computation with Applications in Streaming | Sketching and Algorithm Design 2023 | 2023-10-09 |
Introduces HashPRG, a symmetric Nisan-style PRG that trades seed length for block-evaluation time and is provably indistinguishable to algorithms using only εB… | ||
| Deterministic Edge Connectivity in Near-Linear Time | Computational Complexity of Low-Polynomial Time Problems (Simons Institute workshop, 2015) | 2015-12-08 |
Deterministic algorithm finds global edge connectivity and a min-cut cactus for simple graphs in near‑linear time (polylog overhead), by repeatedly certifying… | ||
| nothing matches | ||