Ashwin Padaki

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

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2026

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

Tian Zhang, Ashwin Padaki, Jiaming Liang, Zack Ives, Erik Waingarten

CoRR, February, 2026

Sparse Navigable Graphs for Nearest Neighbor Search: Algorithms and Hardness.

Sanjeev Khanna, Ashwin Padaki, Erik Waingarten

Proceedings of the 2026 Annual ACM-SIAM Symposium on Discrete Algorithms, 2026

2025

Inapproximability of Maximum Diameter Clustering for Few Clusters.

Henry L. Fleischmann, Kyrylo Karlov, Karthik C. S., Ashwin Padaki, Stepan Zharkov

Proceedings of the 2025 Annual ACM-SIAM Symposium on Discrete Algorithms, 2025

A Polynomial Space Lower Bound for Diameter Estimation in Dynamic Streams.

Sanjeev Khanna, Ashwin Padaki, Krish Singal, Erik Waingarten

Proceedings of the 66th IEEE Annual Symposium on Foundations of Computer Science, 2025

2023

Smaller Low-Depth Circuits for Kronecker Powers.

Josh Alman, Yunfeng Guan, Ashwin Padaki

Proceedings of the 2023 ACM-SIAM Symposium on Discrete Algorithms, 2023