Skip to content

Author

Adithya Diddapur

We have 2 of 5 papers

We haven’t gathered this author’s papers yet. Follow them and we’ll fetch their work.

Not the right person? Other researchers publish under this name.

Preprint Oct 2026

The Communication Complexity of the Coin Problem

A $\Omega(\log\log n) bit lower bound for the constant error-rate regime, and a $\Omega(1/\delta)$ bit lower bound for arbitrarily small error rates, as well as a tight one-way protocol using $O(\log\log n + \log(1/\delta))$ bits of communication.

Adithya Diddapur, Pachara Sawettamalya · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.