Jakub Lacki
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 |
|---|---|---|
| AMPC | Managing Parallelism 2025 | 2025-10-20 |
Introduces AMPC = MPC + distributed hash table and claims adaptive reads let many graph tasks drop from polylog rounds to constant rounds by doing short… | ||
| Dynamic PageRank: Additive Error and Batch Recomputation | Dynamic Graphs and Algorithm Design (Simons Institute, 2023) | 2023-09-18 |
Shows a proof that maintaining a constant-factor multiplicative PageRank under n updates is provably hard: any algorithm must take at least n^(1−ε) total time… | ||
| nothing matches | ||