Sivaramakrishnan Natarajan Ramamoorthy
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 |
|---|---|---|
| How to Compress Asymmetric Communication | Information Theory in Complexity Theory and Combinatorics 2015 | 2015-04-24 |
Provides two concrete compression schemes and one explicit bound that helps when information is lopsided: converts any protocol into a bounded‑round “guess K… | ||
| nothing matches | ||