swagato sanyal
swagato sanyal
Assistant Professor, Dept. of CSE, IIT Kharagpur
Verified email at
Cited by
Cited by
A cops and robber game in multidimensional grids
S Bhattacharya, G Paul, S Sanyal
Discrete Applied Mathematics 158 (16), 1745-1751, 2010
Towards better separation between deterministic and randomized query complexity
S Mukhopadhyay, S Sanyal
arXiv preprint arXiv:1506.06399, 2015
A composition theorem for randomized query complexity
A Anshu, D Gavinsky, R Jain, S Kundu, T Lee, P Mukhopadhyay, ...
arXiv preprint arXiv:1706.00335, 2017
Fourier sparsity and dimension
S Sanyal
Theory of Computing 15 (1), 1-13, 2019
Near-optimal upper bound on Fourier dimension of Boolean functions in terms of Fourier sparsity
S Sanyal
International Colloquium on Automata, Languages, and Programming, 1035-1045, 2015
A composition theorem for randomized query complexity via max conflict complexity
D Gavinsky, T Lee, M Santha, S Sanyal
arXiv preprint arXiv:1811.10752, 2018
Necessary and sufficient conditions for success of the metropolis algorithm for optimization
S Sanyal, S Biswas
Proceedings of the 12th annual conference on Genetic and evolutionary …, 2010
A composition theorem via conflict complexity
S Sanyal
arXiv preprint arXiv:1801.03285, 2018
On parity decision trees for fourier-sparse boolean functions
NS Mande, S Sanyal
arXiv preprint arXiv:2008.00266, 2020
Tight Chang's-lemma-type bounds for Boolean functions
S Chakraborty, NS Mande, R Mittal, T Molli, M Paraashar, S Sanyal
arXiv preprint arXiv:2012.02335, 2020
Feature-based Individual Fairness in k-Clustering
D Kar, S Medya, D Mandal, A Silva, P Dey, S Sanyal
arXiv preprint arXiv:2109.04554, 2021
Quadratically tight relations for randomized query complexity
R Jain, H Klauck, S Kundu, T Lee, M Santha, S Sanyal, J Vihrovs
Theory of Computing Systems 64 (1), 101-119, 2020
The zero-error randomized query complexity of the pointer function
J Radhakrishnan, S Sanyal
arXiv preprint arXiv:1607.01684, 2016
A wavelength assignment algorithm for de Bruijn WDM networks
M Chatterjee, S Sanyal, M Nasipuri, U Bhattacharya
International Journal of Parallel, Emergent and Distributed Systems 26 (6 …, 2011
Channel Assignment in a High-Bandwidth de Bruijn Optical WDM Network
M Chatterjee, S Sanyal, U Bhattacharya
2008 16th International Conference on Advanced Computing and Communications …, 2008
Separation Between Deterministic and Randomized Query Complexity
S Mukhopadhyay, J Radhakrishnan, S Sanyal
SIAM Journal on Computing 47 (4), 1644-1666, 2018
One-way Communication and Non-adaptive Decision Tree.
S Sanyal
Electron. Colloquium Comput. Complex. 24, 152, 2017
Quadratically tight relations for randomized query complexity
D Gavinsky, R Jain, H Klauck, S Kundu, T Lee, M Santha, S Sanyal, ...
arXiv preprint arXiv:1708.00822, 2017
Sub-linear Upper Bounds on Fourier dimension of Boolean Functions in terms of Fourier sparsity
S Sanyal
arXiv preprint arXiv:1407.3500, 2014
Decision Tree Complexity versus Block Sensitivity and Degree
R Chugh, S Podder, S Sanyal
arXiv preprint arXiv:2209.08042, 2022
The system can't perform the operation now. Try again later.
Articles 1–20