Siddharth Gollapudi

According to our database, Siddharth Gollapudi authored at least 5 papers between 2023 and 2025.

Collaborative distances:

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

2025

Improved Approximations for Hard Graph Problems using Predictions.

Anders Aamand, Justin Y. Chen, Siddharth Gollapudi, Sandeep Silwal, Hao Wu

CoRR, May, 2025

Learning-Augmented Frequent Directions.

Anders Aamand, Justin Y. Chen, Siddharth Gollapudi, Sandeep Silwal, Hao Wu

Proceedings of the Thirteenth International Conference on Learning Representations, 2025

2024

Improved Approximation Algorithms for the Joint Replenishment Problem with Outliers, and with Fairness Constraints.

Varun Suriyanarayana, Varun Sivashankar, Siddharth Gollapudi, David B. Shmoys

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

2023

Filtered-DiskANN: Graph Algorithms for Approximate Nearest Neighbor Search with Filters.

Siddharth Gollapudi, Neel Karia, Varun Sivashankar, Ravishankar Krishnaswamy, Nikit Begwani, Swapnil Raz, Yiyong Lin, Yin Zhang, Neelam Mahapatro, Premkumar Srinivasan, Amit Singh, Harsha Vardhan Simhadri

Proceedings of the ACM Web Conference 2023, 2023

Composable Coresets for Determinant Maximization: Greedy is Almost Optimal.

Siddharth Gollapudi, Sepideh Mahabadi, Varun Sivashankar

Proceedings of the Advances in Neural Information Processing Systems 36: Annual Conference on Neural Information Processing Systems 2023, 2023