| 2024 | MFCS | On Fourier Analysis of Sparse Boolean Functions over Certain Abelian Groups. | Sourav Chakraborty, Swarnalipa Datta, Pranjal Dutta, Arijit Ghosh, Swagato Sanyal |
| 2024 | STACS | Randomized Query Composition and Product Distributions. | Swagato Sanyal |
| 2023 | STOC | Randomized versus Deterministic Decision Tree Size. | Arkadev Chattopadhyay, Yogesh Dahiya, Nikhil S. Mande, Jaikumar Radhakrishnan, Swagato Sanyal |
| 2022 | STACS | One-Way Communication Complexity and Non-Adaptive Decision Trees. | Nikhil S. Mande, Swagato Sanyal, Suhail Sherif |
| 2019 | ICALP | A Composition Theorem for Randomized Query Complexity via Max-Conflict Complexity. | Dmitry Gavinsky, Troy Lee, Miklos Santha, Swagato Sanyal |
| 2018 | CSR | Quadratically Tight Relations for Randomized Query Complexity. | Rahul Jain, Hartmut Klauck, Srijita Kundu, Troy Lee, Miklos Santha, Swagato Sanyal, Jevgenijs Vihrovs |
| 2015 | ICALP | Near-Optimal Upper Bound on Fourier Dimension of Boolean Functions in Terms of Fourier Sparsity. | Swagato Sanyal |
| 2010 | GECCO | Necessary and sufficient conditions for success of the metropolis algorithm for optimization. | Swagato Sanyal, Raja S, Somenath Biswas |