Papers (In reverse chronological order):
Saba Ahmadi, Siddharth Bhandari, Avrim Blum, Chen Dan, Prabhav Jain, Distributional Adversarial Loss. [arxiv:2406.03458 ].
Raghavendra Addanki, Siddharth Bhandari, Limits of Approximating the Median Treatment Effect. [arxiv:2403.10618 ]. To appear at the Conference on Learning Theory (COLT) 2024.
Siddharth Bhandari, Abhishek Khetan, Improved Upper Bound for the Size of a Trifferent Code. [arXiv:2402.02390]. To appear at the IEEE International Symposium on Information Theory (ISIT) 2024.
Siddharth Bhandari, Prahladh Harsha, Mrinal Kumar and Aparna Shankar, Algorithmizing the Multiplicity Schwartz-Zippel Lemma. In the Proceedings of the ACM-SIAM Symposium on Discrete Algorithms (SODA) 2023. [arXiv:2111.11072 |eccc:TR21-163]
Siddharth Bhandari, Prahladh Harsha, Ramprasad Saptharishi, and Srikanth Srinivasan, Vanishing Spaces of Random Sets and Applications to Reed-Muller Codes. In Proceedings of the 37th Computational Complexity Conference (CCC) 2022. [arXiv:2205.10749 |eccc:TR22-075]
Siddharth Bhandari, Prahladh Harsha, Mrinal Kumar and Madhu Sudan, Ideal theoretic Explanation of Capacity-achieving Decoding. In Proceedings of RANDOM'21. [arXiv:2103.07930 |eccc:TR21-036]
Siddharth Bhandari, Prahladh Harsha, Mrinal Kumar and Madhu Sudan, Decoding Multivariate Multiplicity Codes on Product Sets. In Proceedings of the 53rd Annual (ACM-SIGACT) Symposium on Theory of Computing (STOC) 2021. [arXiv:2012.01530|eccc:TR20-179]
Shubhada Agrawal, Siddharth Bhandari, Anirban Bhattacharjee, Anand Deo, Narendra M. Dixit, Prahladh Harsha, Sandeep Juneja, Poonam Kesarwani, Aditya Krishna Swamy, Preetam Patil, Nihesh Rathod, Ramprasad Saptharishi, Sharad Shriram, Piyush Srivastava, Rajesh Sundaresan, Nidhin Koshy Vaidhiyan and Sarath Yasodharan, City-Scale Agent-Based Simulators for the Study of Non-Pharmaceutical Interventions in the Context of the COVID-19 Epidemic, Journal of the Indian Institute of Science, 100:809–847, 2020. [arXiv:2008.04849]
Siddharth Bhandari and Sayantan Chakraborty, Improved Bounds for Perfect Sampling of k-Colorings in Graphs, In Proceedings of the 52nd Annual (ACM-SIGACT) Symposium on Theory of Computing (STOC) 2020. [arXiv:1909.10323|eccc:TR19-164]
Danny Lewin Best Student Paper Award at STOC-2020 for the best student paper. Invited to SICOMP special issue.
Published in: SIAM Journal on Computing (STOC20: 54-74)
Siddharth Bhandari, Prahladh Harsha, Tulasimohan Molli, and Srikanth Srinivasan, On the probabilistic degree of OR over the Reals, In Proceedings of the 38th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS), 2018. [arXiv:1812.01982}|eccc:TR18-207]
Published in: Random Structures and Algorithms, 59(1):53–67, 2021
Siddharth Bhandari and Jaikumar Radhakrishnan, Bounds on the Zero-Error List-Decoding Capacity of the q/(q-1) Channel, In Proceedings of 2018 IEEE International Symposium on Information Theory (ISIT) 2018. [arXiv:1802.08396]
Jack Keil Wolf Student Paper Award at ISIT-2018 for the best student paper.
Published in: IEEE Transactions on Information Theory (Volume: 68, Issue: 1, Jan. 2022)
Shumiao Wang, Siddharth Bhandari, Siva Chaitanya Chaduvula, Mikhail J. Atallah, Jitesh H. Panchal and Karthik Ramani, Secure Collaboration in Engineering Systems Design, Journal of Computing and Information Science in Engineering 17(4), 041010, 2017.
Surveys:
Siddharth Bhandari and Prahladh Harsha, A note on the explicit constructions of tree codes over polylogarithmic-sized alphabet. [arXiv:2002.08231|eccc:TR20-019]
Theses:
PhD thesis: Exact Sampling & List-Decoding
Winner of the ACM India 2022 Doctoral Dissertation Award.
Master's thesis: Exact Algorithms for some Graph Coloring and Covering Problems