Author

Adithya Diddapur

1 paper indexed here

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 Sep 2026

Deterministic Streaming Lower Bounds for Approximate Maximum Clique and Maximum Independent Set

Any deterministic algorithm for either problem must use $\Omega\left(\frac{n^2}{\beta\cdot\log n}\right)$ bits of space, and this deterministic gap is resolved with an (almost) tight lower bound.

Adithya Diddapur · 0 citations