Gábor Tardos
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 |
|---|---|---|
| On the Communication Complexity of Sparse Set Disjointness | Information Theory in Complexity Theory and Combinatorics 2015 | 2015-04-24 |
Establishes tight trade-offs for k-sparse set disjointness: a simple bias-tweak of the Håstad–Wigderson-style protocol yields O(k) communication and log k… | ||
| nothing matches | ||