Skip to content

Author

Ashwin Padaki

2 papers 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

A Near-Optimal Space Lower Bound for Euclidean Diameter Estimation in Dynamic Streams

We study the space complexity of diameter estimation for a set of points in Euclidean space in the dynamic (turnstile) streaming model. The seminal work of Indyk (SODA 2003) gives a $c$-approximation to the Euclidean diameter of $n$ vectors using $n^{O(1/c^2)}$ space. Our main contribution is giving an essentially matc...

Ashwin Padaki, Krish Singal, Erik Waingarten · 0 citations
Jul 2026

Learning Partition Trees for Nearest Neighbor Search

It is proved that without distributional assumptions, finding the optimal balanced halfspace is NP-hard, and an efficient improper learning algorithm is designed that outputs a balanced polynomial threshold function of degree 1 that cuts at most an $O(\sqrt{\alpha+\varepsilon})$ fraction.

Sanjeev Khanna, Ashwin Padaki, Erik Waingarten · 0 citations

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