Siddharth Gollapudi

Contact: sgollapu AT berkeley DOT edu
My CV.

I am currently a pre-doctoral researcher at Microsoft Research India, where I am fortunate to be advised by Ravishankar Krishnaswamy. Before this, I received my BA in math and computer science from UC Berkeley.

I am broadly interested in algorithms, but my primary focus at Microsoft has been in approximation algorithms for big data. Currently, I'm looking at fast algorithms for the approximate nearest neighbors problem.

Papers

Improved Approximation Algorithms for the Joint Replenishment Problem with Outliers, and with Fairness Constraints [arXiv]

Varun Suriyanarayana, Varun Sivashankar, Siddharth Gollapudi, David Shmoys
SODA 2024 (35th Annual ACM-SIAM Symposium on Discrete Algorithms)

Composable Coresets for Determinant Maximization: Greedy is Almost Optimal [arXiv]

Siddharth Gollapudi, Sepideh Mahabadi and Varun Sivashankar
NeurIPS 2023 (37th Annual Conference on Neural Information Processing Systems)

Filtered−DiskANN: Graph Algorithms for Approximate Nearest Neighbor Search with Filters [paper]

Siddharth Gollapudi, Neel Karia, Varun Sivashankar, Ravishankar Krishnaswamy, Harsha Vardhan Simhadri, Nikit Begwani, Swapnil Raz, Yiyong Lin, Yin Zhang, Neelam Mahapatro, Premkumar Srinivasan and Amit Singh
The ACM Web Conference (formerly WWW) 2023

Service

Subreviewer: SODA 2024, ESA 2022

Teaching Experience

FIRST Robotics Team #299: Valkyrie Robotics

Team Mentor