Inner Product Oracle can Estimate and Sample. - Arijit Bishnu; Arijit Ghosh; Gopinath Mishra; Manaswi Paraashar (CoRR, 2019)

Quantum Query-to-Communication Simulation Needs a Logarithmic Overhead. - Sourav Chakraborty 001; Arkadev Chattopadhyay; Nikhil S. Mande; Manaswi Paraashar (Electron. Colloquium Comput. Complex., 2019)

Query Complexity of Global Minimum Cut. - Arijit Bishnu; Arijit Ghosh; Gopinath Mishra; Manaswi Paraashar (Electron. Colloquium Comput. Complex., 2020)

Tight Chang's-Lemma-Type Bounds for Boolean Functions. - Sourav Chakraborty 001; Nikhil S. Mande; Rajat Mittal 001; Tulasimohan Molli; Manaswi Paraashar; Swagato Sanyal (FSTTCS, 2021)

Two new results about quantum exact learning. - Srinivasan Arunachalam; Sourav Chakraborty 001; Troy Lee; Manaswi Paraashar; Ronald de Wolf (Quantum, 2021)

Counting and Sampling from Substructures Using Linear Algebraic Queries. - Arijit Bishnu; Arijit Ghosh; Gopinath Mishra; Manaswi Paraashar (FSTTCS, 2022)

Symmetry and Quantum Query-To-Communication Simulation. - Sourav Chakraborty 001; Arkadev Chattopadhyay; Peter Høyer; Nikhil S. Mande; Manaswi Paraashar; Ronald de Wolf (STACS, 2022)

Disjointness through the Lens of Vapnik-Chervonenkis Dimension: Sparsity and Beyond. - Anup Bhattacharya; Sourav Chakraborty 001; Arijit Ghosh; Gopinath Mishra; Manaswi Paraashar (Comput. Complex., 2022)

Randomized and Quantum Query Complexities of Finding a King in a Tournament. - Nikhil S. Mande; Manaswi Paraashar; Nitin Saurabh (FSTTCS, 2023)

Linear isomorphism testing of Boolean functions with small approximate spectral norm. - Arijit Ghosh; Chandrima Kayal; Manaswi Paraashar; Manmatha Roy (CoRR, 2023)

On the Composition of Randomized Query Complexity and Approximate Degree. - Sourav Chakraborty 001; Chandrima Kayal; Rajat Mittal 001; Manaswi Paraashar; Swagato Sanyal; Nitin Saurabh (Electron. Colloquium Comput. Complex., 2023)

Separations between Combinatorial Measures for Transitive Functions. - Sourav Chakraborty 001; Chandrima Kayal; Manaswi Paraashar (Electron. Colloquium Comput. Complex., 2023)

Computational Complexity of Discrete Problems (Dagstuhl Seminar 23111). - Anna Gál; Meena Mahajan; Rahul Santhanam; Till Tantau; Manaswi Paraashar (Dagstuhl Reports, 2023)

Approximate Degree Composition for Recursive Functions. - Sourav Chakraborty 001; Chandrima Kayal; Rajat Mittal 001; Manaswi Paraashar; Nitin Saurabh (APPROX/RANDOM, 2024)

On the Communication Complexity of Finding a King in a Tournament. - Nikhil S. Mande; Manaswi Paraashar; Swagato Sanyal; Nitin Saurabh (APPROX/RANDOM, 2024)

Local Correction of Linear Functions over the Boolean Cube. - Prashanth Amireddy; Amik Raj Behera; Manaswi Paraashar; Srikanth Srinivasan 001; Madhu Sudan 001 (Electron. Colloquium Comput. Complex., 2024)

Low Degree Local Correction Over the Boolean Cube. - Prashanth Amireddy; Amik Raj Behera; Manaswi Paraashar; Srikanth Srinivasan 001; Madhu Sudan 001 (Electron. Colloquium Comput. Complex., 2024)

Testing Isomorphism of Boolean Functions over Finite Abelian Groups. - Swarnalipa Datta; Arijit Ghosh; Chandrima Kayal; Manaswi Paraashar; Manmatha Roy (CoRR, 2025)