Author

Aditi Dudeja

h-index 7 View on Semantic Scholar

We have 1 of 18 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 Aug 2026

Randomized Algorithms for Learning Partitions with Near Optimal Query Complexity in Constant Rounds

An even bigger separation is shown in this regime between randomized and deterministic algorithms: for the latter, $\Theta(\log n/\log\log n)$ rounds are necessary and sufficient to obtain near-optimal query complexity.

Deeparnab Chakrabarty, Aditi Dudeja, David Saulpic · 0 citations