Jaikumar Radhakrishnan
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
nobody close enough yet
| title | conference | date |
|---|---|---|
| Information Theory in Computational Complexity I | Information Theory Boot Camp 2015 | 2015-01-13 |
Defines protocols as binary trees and proves for the equality function that deterministic complexity = N by showing every 1 on the N×N matrix needs its own… | ||
| Information Theory in Computational Complexity II | Information Theory Boot Camp 2015 | 2015-01-13 |
Proves that the randomized communication complexity of Disjointness is Ω(N) by reducing the N-bit problem to a single-bit AND and lower-bounding the… | ||
| Information Theory in Computational Complexity IV | Information Theory Boot Camp 2015 | 2015-01-13 |
Shows the exact equivalence between formula depth and communication cost via the Karchmer–Wigderson game and uses that to prove a concrete lower bound: the… | ||
| nothing matches | ||