Swagato Sanyal

Publication Activity (10 Years)

Years Active: 2009-2024
Publications (10 Years): 47

Top Topics

Query Complexity

Top Venues

Electron. Colloquium Comput. Complex.

Publications

Sourav Chakraborty, Swarnalipa Datta, Pranjal Dutta, Arijit Ghosh, Swagato Sanyal
On Fourier Analysis of Sparse Boolean Functions over Certain Abelian Groups. MFCS (2024)
Swagato Sanyal
Randomized query composition and product distributions. CoRR (2024)
Nikhil S. Mande, Manaswi Paraashar, Swagato Sanyal, Nitin Saurabh
On the communication complexity of finding a king in a tournament. CoRR (2024)
Sourav Chakraborty, Swarnalipa Datta, Pranjal Dutta, Arijit Ghosh, Swagato Sanyal
On Fourier analysis of sparse Boolean functions over certain Abelian groups. CoRR (2024)
Swagato Sanyal
Randomized Query Composition and Product Distributions. STACS (2024)
Swagato Sanyal
Randomized query composition and product distributions. Electron. Colloquium Comput. Complex. (2024)
Sourav Chakraborty, Chandrima Kayal, Rajat Mittal, Manaswi Paraashar, Swagato Sanyal, Nitin Saurabh
On the Composition of Randomized Query Complexity and Approximate Degree. CoRR (2023)
Arkadev Chattopadhyay, Yogesh Dahiya, Nikhil S. Mande, Jaikumar Radhakrishnan, Swagato Sanyal
Randomized versus Deterministic Decision Tree Size. STOC (2023)
Rahul Chugh, Supartha Podder, Swagato Sanyal
Decision Tree Complexity Versus Block Sensitivity and Degree. FSTTCS (2023)
Debajyoti Kar, Mert Kosan, Debmalya Mandal, Sourav Medya, Arlei Silva, Palash Dey, Swagato Sanyal
Feature-based Individual Fairness in k-clustering. AAMAS (2023)
Sourav Chakraborty, Chandrima Kayal, Rajat Mittal, Manaswi Paraashar, Swagato Sanyal, Nitin Saurabh
On the Composition of Randomized Query Complexity and Approximate Degree. Electron. Colloquium Comput. Complex. (2023)
Debajyoti Kar, Palash Dey, Swagato Sanyal
Sampling-Based Winner Prediction in District-Based Elections. AAMAS (2023)
Sourav Chakraborty, Chandrima Kayal, Rajat Mittal, Manaswi Paraashar, Swagato Sanyal, Nitin Saurabh
On the Composition of Randomized Query Complexity and Approximate Degree. APPROX/RANDOM (2023)
Arkadev Chattopadhyay, Nikhil S. Mande, Swagato Sanyal, Suhail Sherif
Lifting to Parity Decision Trees via Stifling. ITCS (2023)
Palash Dey, Debajyoti Kar, Swagato Sanyal
Sampling-Based Winner Prediction in District-Based Elections. CoRR (2022)
Rahul Chugh, Supartha Podder, Swagato Sanyal
Decision Tree Complexity versus Block Sensitivity and Degree. CoRR (2022)
Nikhil S. Mande, Swagato Sanyal, Suhail Sherif
One-Way Communication Complexity and Non-Adaptive Decision Trees. STACS (2022)
Arkadev Chattopadhyay, Nikhil S. Mande, Swagato Sanyal, Suhail Sherif
Lifting to Parity Decision Trees Via Stifling. CoRR (2022)
Arkadev Chattopadhyay, Nikhil S. Mande, Swagato Sanyal, Suhail Sherif
Lifting to Parity Decision Trees Via Stifling. Electron. Colloquium Comput. Complex. (2022)
Arkadev Chattopadhyay, Yogesh Dahiya, Nikhil S. Mande, Jaikumar Radhakrishnan, Swagato Sanyal
Randomized versus Deterministic Decision Tree Size. Electron. Colloquium Comput. Complex. (2022)
Rahul Chugh, Supartha Podder, Swagato Sanyal
Decision Tree Complexity versus Block Sensitivity and Degree. Electron. Colloquium Comput. Complex. (2022)
Sourav Chakraborty, Nikhil S. Mande, Rajat Mittal, Tulasimohan Molli, Manaswi Paraashar, Swagato Sanyal
Tight Chang's-Lemma-Type Bounds for Boolean Functions. FSTTCS (2021)
Nikhil S. Mande, Swagato Sanyal
One-way communication complexity and non-adaptive decision trees. CoRR (2021)
Debajyoti Kar, Sourav Medya, Debmalya Mandal, Arlei Silva, Palash Dey, Swagato Sanyal
Feature-based Individual Fairness in k-Clustering. CoRR (2021)
Nikhil S. Mande, Swagato Sanyal
One-way communication complexity and non-adaptive decision trees. Electron. Colloquium Comput. Complex. 28 (2021)
Rahul Jain, Hartmut Klauck, Srijita Kundu, Troy Lee, Miklos Santha, Swagato Sanyal, Jevgenijs Vihrovs
Quadratically Tight Relations for Randomized Query Complexity. Theory Comput. Syst. 64 (1) (2020)
Nikhil S. Mande, Swagato Sanyal
On Parity Decision Trees for Fourier-Sparse Boolean Functions. FSTTCS (2020)
Nikhil S. Mande, Swagato Sanyal
On parity decision trees for Fourier-sparse Boolean functions. Electron. Colloquium Comput. Complex. 27 (2020)
Nikhil S. Mande, Swagato Sanyal
On parity decision trees for Fourier-sparse Boolean functions. CoRR (2020)
Sourav Chakraborty, Nikhil S. Mande, Rajat Mittal, Tulasimohan Molli, Manaswi Paraashar, Swagato Sanyal
Tight Chang's-lemma-type bounds for Boolean functions. CoRR (2020)
Dmitry Gavinsky, Troy Lee, Miklos Santha, Swagato Sanyal
A Composition Theorem for Randomized Query Complexity via Max-Conflict Complexity. ICALP (2019)
Swagato Sanyal
Fourier Sparsity and Dimension. Theory Comput. 15 (2019)
Sampath Kannan, Elchanan Mossel, Swagato Sanyal, Grigory Yaroslavtsev
Linear Sketching over F_2. Computational Complexity Conference (2018)
Rahul Jain, Hartmut Klauck, Srijita Kundu, Troy Lee, Miklos Santha, Swagato Sanyal, Jevgenijs Vihrovs
Quadratically Tight Relations for Randomized Query Complexity. CSR (2018)
Swagato Sanyal
A Composition Theorem via Conflict Complexity. Electron. Colloquium Comput. Complex. 25 (2018)
Dmitry Gavinsky, Troy Lee, Miklos Santha, Swagato Sanyal
A composition theorem for randomized query complexity via max conflict complexity. CoRR (2018)
Sagnik Mukhopadhyay, Jaikumar Radhakrishnan, Swagato Sanyal
Separation Between Deterministic and Randomized Query Complexity. SIAM J. Comput. 47 (4) (2018)
Swagato Sanyal
A Composition Theorem via Conflict Complexity. CoRR (2018)
Dmitry Gavinsky, Rahul Jain, Hartmut Klauck, Srijita Kundu, Troy Lee, Miklos Santha, Swagato Sanyal, Jevgenijs Vihrovs
Quadratically Tight Relations for Randomized Query Complexity. Electron. Colloquium Comput. Complex. 24 (2017)
Swagato Sanyal
One-way Communication and Non-adaptive Decision Tree. Electron. Colloquium Comput. Complex. 24 (2017)
Anurag Anshu, Dmitry Gavinsky, Rahul Jain, Srijita Kundu, Troy Lee, Priyanka Mukhopadhyay, Miklos Santha, Swagato Sanyal
A Composition Theorem for Randomized Query Complexity. FSTTCS (2017)
Anurag Anshu, Dmitry Gavinsky, Rahul Jain, Srijita Kundu, Troy Lee, Priyanka Mukhopadhyay, Miklos Santha, Swagato Sanyal
A Composition Theorem for Randomized Query complexity. Electron. Colloquium Comput. Complex. 24 (2017)
Dmitry Gavinsky, Rahul Jain, Hartmut Klauck, Srijita Kundu, Troy Lee, Miklos Santha, Swagato Sanyal, Jevgenijs Vihrovs
Quadratically Tight Relations for Randomized Query Complexity. CoRR (2017)
Anurag Anshu, Dmitry Gavinsky, Rahul Jain, Srijita Kundu, Troy Lee, Priyanka Mukhopadhyay, Miklos Santha, Swagato Sanyal
A Composition Theorem for Randomized Query Complexity. CoRR (2017)
Jaikumar Radhakrishnan, Swagato Sanyal
The zero-error randomized query complexity of the pointer function. CoRR (2016)
Jaikumar Radhakrishnan, Swagato Sanyal
The zero-error randomized query complexity of the pointer function. Electron. Colloquium Comput. Complex. 23 (2016)
Jaikumar Radhakrishnan, Swagato Sanyal
The Zero-Error Randomized Query Complexity of the Pointer Function. FSTTCS (2016)
Sagnik Mukhopadhyay, Swagato Sanyal
Towards Better Separation between Deterministic and Randomized Query Complexity. CoRR (2015)
Sagnik Mukhopadhyay, Swagato Sanyal
Towards Better Separation between Deterministic and Randomized Query Complexity. Electron. Colloquium Comput. Complex. 22 (2015)
Swagato Sanyal
Near-Optimal Upper Bound on Fourier Dimension of Boolean Functions in Terms of Fourier Sparsity. ICALP (1) (2015)
Sagnik Mukhopadhyay, Swagato Sanyal
Towards Better Separation between Deterministic and Randomized Query Complexity. FSTTCS (2015)
Swagato Sanyal
Sub-linear Upper Bounds on Fourier dimension of Boolean Functions in terms of Fourier sparsity. CoRR (2014)
Swagato Sanyal
Sub-linear Upper Bounds on Fourier dimension of Boolean Functions in terms of Fourier sparsity. Electron. Colloquium Comput. Complex. 21 (2014)
Monish Chatterjee, Swagato Sanyal, Mita Nasipuri, Uma Bhattacharya
A wavelength assignment algorithm for de Bruijn WDM networks. Int. J. Parallel Emergent Distributed Syst. 26 (6) (2011)
Swagato Sanyal, Raja S, Somenath Biswas
Necessary and sufficient conditions for success of the metropolis algorithm for optimization. GECCO (2010)
Sayan Bhattacharya, Goutam Paul, Swagato Sanyal
A cops and robber game in multidimensional grids. Discret. Appl. Math. 158 (16) (2010)
Sayan Bhattacharya, Goutam Paul, Swagato Sanyal
On Necessary and Sufficient Number of Cops in the Game of Cops and Robber in Multidimensional Grids CoRR (2009)