| A cops and robber game in multidimensional grids S Bhattacharya, G Paul, S Sanyal Discrete Applied Mathematics 158 (16), 1745-1751, 2010 | 20 | 2010 |
| 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 | 16 | 2017 |
| Towards better separation between deterministic and randomized query complexity S Mukhopadhyay, S Sanyal arXiv preprint arXiv:1506.06399, 2015 | 14 | 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 | 13 | 2018 |
| On parity decision trees for fourier-sparse boolean functions NS Mande, S Sanyal ACM Transactions on Computation Theory 16 (2), 1-26, 2024 | 9 | 2024 |
| 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 | 9 | 2015 |
| 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 | 8 | 2010 |
| Feature-based individual fairness in k-clustering D Kar, M Kosan, D Mandal, S Medya, A Silva, P Dey, S Sanyal arXiv preprint arXiv:2109.04554, 2021 | 7 | 2021 |
| Lifting to parity decision trees via stifling A Chattopadhyay, NS Mande, S Sanyal, S Sherif arXiv preprint arXiv:2211.17214, 2022 | 6 | 2022 |
| A composition theorem via conflict complexity S Sanyal arXiv preprint arXiv:1801.03285, 2018 | 6 | 2018 |
| 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 | 5 | 2020 |
| On the composition of randomized query complexity and approximate degree S Chakraborty, C Kayal, R Mittal, M Paraashar, S Sanyal, N Saurabh arXiv preprint arXiv:2307.03900, 2023 | 4 | 2023 |
| Tight chang’s-lemma-type bounds for boolean functions S Chakraborty, NS Mande, R Mittal, T Molli, M Paraashar, S Sanyal 41st IARCS Annual Conference on Foundations of Software Technology and …, 2021 | 4 | 2021 |
| Separation between deterministic and randomized query complexity S Mukhopadhyay, J Radhakrishnan, S Sanyal SIAM Journal on Computing 47 (4), 1644-1666, 2018 | 3 | 2018 |
| 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 | 3 | 2011 |
| Randomized query composition and product distributions S Sanyal arXiv preprint arXiv:2401.15352, 2024 | 2 | 2024 |
| Randomized versus deterministic decision tree size A Chattopadhyay, Y Dahiya, NS Mande, J Radhakrishnan, S Sanyal Proceedings of the 55th Annual ACM Symposium on Theory of Computing, 867-880, 2023 | 2 | 2023 |
| 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 | 2 | 2017 |
| The zero-error randomized query complexity of the pointer function J Radhakrishnan, S Sanyal arXiv preprint arXiv:1607.01684, 2016 | 2 | 2016 |
| Sub-linear Upper Bounds on Fourier dimension of Boolean Functions in terms of Fourier sparsity S Sanyal arXiv preprint arXiv:1407.3500, 2014 | 2 | 2014 |
