Ashwin Padaki

According to our database1, Ashwin Padaki authored at least 5 papers between 2023 and 2026.

Collaborative distances:

Timeline

Legend:

Book  In proceedings  Article  PhD thesis  Dataset  Other 

Links

On csauthors.net:

Bibliography

2026
Prune, Don't Rebuild: Efficiently Tuning α-Reachable Graphs for Nearest Neighbor Search.
CoRR, February, 2026

Sparse Navigable Graphs for Nearest Neighbor Search: Algorithms and Hardness.
Proceedings of the 2026 Annual ACM-SIAM Symposium on Discrete Algorithms, 2026

2025
Inapproximability of Maximum Diameter Clustering for Few Clusters.
Proceedings of the 2025 Annual ACM-SIAM Symposium on Discrete Algorithms, 2025

A Polynomial Space Lower Bound for Diameter Estimation in Dynamic Streams.
Proceedings of the 66th IEEE Annual Symposium on Foundations of Computer Science, 2025

2023
Smaller Low-Depth Circuits for Kronecker Powers.
Proceedings of the 2023 ACM-SIAM Symposium on Discrete Algorithms, 2023


  Loading...