Sidhant Saraogi

According to our database, Sidhant Saraogi authored at least 7 papers between 2022 and 2026.

Collaborative distances:

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

2026

Nearly Tight Lower Bounds for Relaxed Locally Decodable Codes via Robust Daisies.

Guy Goldberg, Tom Gur, Sidhant Saraogi

Proceedings of the 58th Annual ACM Symposium on Theory of Computing, 2026

Downward self-reducibility in the total function polynomial hierarchy.

Karthik Gajulapalli, Surendra Ghentiyala, Zeyong Li, Sidhant Saraogi

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

Online Orthogonal Vectors Revisited.

Karthik Gajulapalli, Alexander Golovnev, Samuel King, Sidhant Saraogi

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

2025

Improved Lower Bounds for 3-Query Matching Vector Codes.

Divesh Aggarwal, Pranjal Dutta, Zeyong Li, Maciej Obremski, Sidhant Saraogi

Proceedings of the 16th Innovations in Theoretical Computer Science Conference, 2025

2023

On the randomized complexity of range avoidance, with applications to cryptography and metacomplexity.

Eldon Chung, Alexander Golovnev, Zeyong Li, Maciej Obremski, Sidhant Saraogi, Noah Stephens-Davidowitz

Electron. Colloquium Comput. Complex., 2023

Range Avoidance for Constant Depth Circuits: Hardness and Algorithms.

Karthik Gajulapalli, Alexander Golovnev, Satyajeet Nagargoje, Sidhant Saraogi

Proceedings of the Approximation, 2023

2022

Pulse-level noisy quantum circuits with QuTiP.

Boxi Li, Shahnawaz Ahmed, Sidhant Saraogi, Neill Lambert, Franco Nori, Alexander Pitchford, Nathan Shammah

Quantum, 2022