| Two new results about quantum exact learning S Arunachalam, S Chakraborty, T Lee, M Paraashar, R De Wolf Quantum 5, 587, 2021 | 33 | 2021 |
| Query complexity of global minimum cut A Bishnu, A Ghosh, G Mishra, M Paraashar arXiv preprint arXiv:2007.09202, 2020 | 6 | 2020 |
| 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 |
| 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 | 5 | 2023 |
| 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 | 5 | 2022 |
| 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 | 4 | 2020 |
| Separations between combinatorial measures for transitive functions S Chakraborty, C Kayal, M Paraashar arXiv preprint arXiv:2103.12355, 2021 | 3 | 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 | 3 | 2020 |
| 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 |
| Randomized and quantum query complexities of finding a king in a tournament NS Mande, M Paraashar, N Saurabh arXiv preprint arXiv:2308.02472, 2023 | 2 | 2023 |
| Inner product oracle can estimate and sample A Bishnu, A Ghosh, G Mishra, M Paraashar CoRR, abs/1906.07398, 2019 | 2 | 2019 |
| Approximate degree composition for recursive functions S Chakraborty, C Kayal, R Mittal, M Paraashar, N Saurabh arXiv preprint arXiv:2407.08385, 2024 | 1 | 2024 |
| Local Correction of Linear Functions over the Boolean Cube P Amireddy, AR Behera, M Paraashar, S Srinivasan, M Sudan Proceedings of the 56th Annual ACM Symposium on Theory of Computing, 764-775, 2024 | 1 | 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 | 1 | 2024 |
| 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 |
| Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2020) D Aggarwal, S Guo, M Obremski, J Ribeiro, N Stephens-Davidowitz, ... Schloss Dagstuhl-Leibniz-Zentrum für Informatik GmbH, 2020 | 1 | 2020 |
| Low Degree Local Correction Over the Boolean Cube P Amireddy, AR Behera, M Paraashar, S Srinivasan, M Sudan arXiv preprint arXiv:2411.07374, 2024 | | 2024 |
| Quantum Advantage with Faulty Oracle DR Lolck, L Mančinska, M Paraashar arXiv preprint arXiv:2411.04931, 2024 | | 2024 |
| Quantum Advantage with Faulty Oracle D Rasmussen Lolck, L Mančinska, M Paraashar arXiv e-prints, arXiv: 2411.04931, 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 |
