| Two new results about quantum exact learning S Arunachalam, S Chakraborty, T Lee, M Paraashar, R De Wolf Quantum 5, 587, 2021 | 28 | 2021 |
| Quantum query-to-communication simulation needs a logarithmic overhead S Chakraborty, A Chattopadhyay, NS Mande, M Paraashar arXiv preprint arXiv:1909.10428, 2019 | 6 | 2019 |
| Query complexity of global minimum cut A Bishnu, A Ghosh, G Mishra, M Paraashar arXiv preprint arXiv:2007.09202, 2020 | 5 | 2020 |
| Symmetry and quantum query-to-communication simulation S Chakraborty, A Chattopadhyay, P Høyer, NS Mande, M Paraashar, ... 39th International Symposium on Theoretical Aspects of Computer Science …, 2022 | 3 | 2022 |
| 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 | 3 | 2021 |
| Efficiently sampling and estimating from substructures using linear algebraic queries A Bishnu, A Ghosh, G Mishra, M Paraashar arXiv preprint arXiv:1906.07398, 2019 | 3 | 2019 |
| Separations between combinatorial measures for transitive functions S Chakraborty, C Kayal, M Paraashar arXiv preprint arXiv:2103.12355, 2021 | 2 | 2021 |
| Disjointness through the lens of vapnik-chervonenkis dimension: Sparsity and beyond A Bhattacharya, S Chakraborty, A Ghosh, G Mishra, M Paraashar arXiv preprint arXiv:2006.13712, 2020 | 2 | 2020 |
| Inner product oracle can estimate and sample A Bishnu, A Ghosh, G Mishra, M Paraashar arXiv preprint arXiv:1906.07398, 2019 | 2 | 2019 |
| Randomized and quantum query complexities of finding a king in a tournament NS Mande, M Paraashar, N Saurabh arXiv preprint arXiv:2308.02472, 2023 | 1 | 2023 |
| On the composition of randomized query complexity and approximate degree S Chakraborty, C Kayal, M Paraashar, R Mittal, S Sanyal, N Saurabh arXiv preprint arXiv:2307.03900, 2023 | 1 | 2023 |
| Counting and sampling from substructures using linear algebraic queries A Bishnu, A Ghosh, G Mishra, M Paraashar 42nd IARCS Annual Conference on Foundations of Software Technology and …, 2022 | 1 | 2022 |
| Local Correction of Linear Functions over the Boolean Cube P Amireddy, AR Behera, M Paraashar, S Srinivasan, M Sudan arXiv preprint arXiv:2403.20305, 2024 | | 2024 |
| On the communication complexity of finding a king in a tournament NS Mande, M Paraashar, S Sanyal, N Saurabh arXiv preprint arXiv:2402.14751, 2024 | | 2024 |
| Linear isomorphism testing of Boolean functions with small approximate spectral norm A Ghosh, C Kayal, M Paraashar, M Roy arXiv preprint arXiv:2308.02662, 2023 | | 2023 |
| Computational Complexity of Discrete Problems (Dagstuhl Seminar 23111) A Gál, M Mahajan, R Santhanam, T Tantau, M Paraashar Dagstuhl Reports 13 (3), 2023 | | 2023 |
| Disjointness through the Lens of Vapnik–Chervonenkis Dimension: Sparsity and Beyond A Bhattacharya, S Chakraborty, A Ghosh, G Mishra, M Paraashar computational complexity 31 (2), 9, 2022 | | 2022 |
| Quantum query complexity through the ens of communication complexity and exact learning M Paraashar Indian Statistical Institute, Kolkata, 2022 | | 2022 |
| The Role of Symmetry in Quantum Query-to-Communication Simulation S Chakraborty, A Chattopadhyay, P Høyer, NS Mande, M Paraashar, ... arXiv preprint arXiv:2012.05233, 2020 | | 2020 |
| Two new results about exact quantum learning S Arunachalam, S Chakraborty, T Lee, M Paraashar, RD Wolf International Colloquium on Automata, Languages, and Programming, 2019 | | 2019 |
