Krzysztof Onak
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 1 in the filters
on a stage with
never shared a talk
who talks about the same things
one talk is not yet a subject
| title | conference | date |
|---|---|---|
| Superlinear Lower Bounds for Multipass Graph Processing | Information Theory in Complexity Theory and Combinatorics 2015 | 2015-04-24 |
Shows that for P passes several basic graph tasks — testing whether two fixed vertices are within distance 2P+1, deciding perfect matching, and s–t… | ||
| nothing matches | ||