On Necessary and Sufficient Number of Cops in the Game of Cops and Robber in Multidimensional Grids - Sayan Bhattacharya; Goutam Paul 001; Swagato Sanyal (CoRR, 2009)

Necessary and sufficient conditions for success of the metropolis algorithm for optimization. - Swagato Sanyal; Raja S 001; Somenath Biswas (GECCO, 2010)

A cops and robber game in multidimensional grids. - Sayan Bhattacharya; Goutam Paul 001; Swagato Sanyal (Discret. Appl. Math., 2010)

A wavelength assignment algorithm for de Bruijn WDM networks. - Monish Chatterjee; Swagato Sanyal; Mita Nasipuri; Uma Bhattacharya (Int. J. Parallel Emergent Distributed Syst., 2011)

Sub-linear Upper Bounds on Fourier dimension of Boolean Functions in terms of Fourier sparsity. - Swagato Sanyal (Electron. Colloquium Comput. Complex., 2014)

Near-Optimal Upper Bound on Fourier Dimension of Boolean Functions in Terms of Fourier Sparsity. - Swagato Sanyal (ICALP (1), 2015)

Towards Better Separation between Deterministic and Randomized Query Complexity. - Sagnik Mukhopadhyay; Swagato Sanyal (Electron. Colloquium Comput. Complex., 2015)

The zero-error randomized query complexity of the pointer function. - Jaikumar Radhakrishnan; Swagato Sanyal (Electron. Colloquium Comput. Complex., 2016)

A Composition Theorem for Randomized Query complexity. - Anurag Anshu; Dmitry Gavinsky; Rahul Jain 001; Srijita Kundu; Troy Lee; Priyanka Mukhopadhyay; Miklos Santha; Swagato Sanyal (Electron. Colloquium Comput. Complex., 2017)

Quadratically Tight Relations for Randomized Query Complexity. - Dmitry Gavinsky; Rahul Jain 001; Hartmut Klauck; Srijita Kundu; Troy Lee; Miklos Santha; Swagato Sanyal; Jevgenijs Vihrovs (Electron. Colloquium Comput. Complex., 2017)

One-way Communication and Non-adaptive Decision Tree. - Swagato Sanyal (Electron. Colloquium Comput. Complex., 2017)

Linear Sketching over F_2. - Sampath Kannan; Elchanan Mossel; Swagato Sanyal; Grigory Yaroslavtsev (CCC, 2018)

A Composition Theorem via Conflict Complexity. - Swagato Sanyal (Electron. Colloquium Comput. Complex., 2018)

Separation Between Deterministic and Randomized Query Complexity. - Sagnik Mukhopadhyay; Jaikumar Radhakrishnan; Swagato Sanyal (SIAM J. Comput., 2018)

A Composition Theorem for Randomized Query Complexity via Max-Conflict Complexity. - Dmitry Gavinsky; Troy Lee; Miklos Santha; Swagato Sanyal (ICALP, 2019)

Fourier Sparsity and Dimension. - Swagato Sanyal (Theory Comput., 2019)

On parity decision trees for Fourier-sparse Boolean functions. - Nikhil S. Mande; Swagato Sanyal (Electron. Colloquium Comput. Complex., 2020)

Quadratically Tight Relations for Randomized Query Complexity. - Rahul Jain 001; Hartmut Klauck; Srijita Kundu; Troy Lee; Miklos Santha; Swagato Sanyal; Jevgenijs Vihrovs (Theory Comput. Syst., 2020)

Tight Chang's-Lemma-Type Bounds for Boolean Functions. - Sourav Chakraborty 001; Nikhil S. Mande; Rajat Mittal 001; Tulasimohan Molli; Manaswi Paraashar; Swagato Sanyal (FSTTCS, 2021)

Feature-based Individual Fairness in k-Clustering. - Debajyoti Kar; Sourav Medya; Debmalya Mandal; Arlei Silva; Palash Dey; Swagato Sanyal (CoRR, 2021)

One-way communication complexity and non-adaptive decision trees. - Nikhil S. Mande; Swagato Sanyal (Electron. Colloquium Comput. Complex., 2021)

One-Way Communication Complexity and Non-Adaptive Decision Trees. - Nikhil S. Mande; Swagato Sanyal; Suhail Sherif (STACS, 2022)

Randomized versus Deterministic Decision Tree Size. - Arkadev Chattopadhyay; Yogesh Dahiya; Nikhil S. Mande; Jaikumar Radhakrishnan; Swagato Sanyal (Electron. Colloquium Comput. Complex., 2022)

Lifting to Parity Decision Trees Via Stifling. - Arkadev Chattopadhyay; Nikhil S. Mande; Swagato Sanyal; Suhail Sherif (Electron. Colloquium Comput. Complex., 2022)

Decision Tree Complexity versus Block Sensitivity and Degree. - Rahul Chugh; Supartha Podder; Swagato Sanyal (Electron. Colloquium Comput. Complex., 2022)

Sampling-Based Winner Prediction in District-Based Elections. - Debajyoti Kar; Palash Dey; Swagato Sanyal (AAMAS, 2023)

Feature-based Individual Fairness in k-clustering. - Debajyoti Kar; Mert Kosan; Debmalya Mandal; Sourav Medya; Arlei Silva; Palash Dey; Swagato Sanyal (AAMAS, 2023)

On the Composition of Randomized Query Complexity and Approximate Degree. - Sourav Chakraborty 001; Chandrima Kayal; Rajat Mittal 001; Manaswi Paraashar; Swagato Sanyal; Nitin Saurabh (Electron. Colloquium Comput. Complex., 2023)

Optimal Composition Theorem for Randomized Query Complexity. - Dmytro Gavinsky; Troy Lee; Miklos Santha; Swagato Sanyal (Theory Comput., 2023)

On the Communication Complexity of Finding a King in a Tournament. - Nikhil S. Mande; Manaswi Paraashar; Swagato Sanyal; Nitin Saurabh (APPROX/RANDOM, 2024)

On Fourier Analysis of Sparse Boolean Functions over Certain Abelian Groups. - Sourav Chakraborty 001; Swarnalipa Datta; Pranjal Dutta; Arijit Ghosh; Swagato Sanyal (MFCS, 2024)

Randomized query composition and product distributions. - Swagato Sanyal (Electron. Colloquium Comput. Complex., 2024)

Voter Participation Control in Online Polls. - Koustav De; Palash Dey; Swagato Sanyal (AAMAS, 2025)

Complexity of learning matchings and half graphs via edge queries. - Nikhil S. Mande; Swagato Sanyal; Viktor Zamaraev (CoRR, 2025)