Manaswi Paraashar

According to our database, Manaswi Paraashar authored at least 18 papers between 2019 and 2025.

Collaborative distances:

• Dijkstra number of three.
• Erdős number of three.

2025

Low Degree Local Correction Over the Boolean Cube.

Prashanth Amireddy, Amik Raj Behera, Manaswi Paraashar, Srikanth Srinivasan, Madhu Sudan

Proceedings of the 2025 Annual ACM-SIAM Symposium on Discrete Algorithms, 2025

Testing Isomorphism of Boolean Functions over Finite Abelian Groups.

Swarnalipa Datta, Arijit Ghosh, Chandrima Kayal, Manaswi Paraashar, Manmatha Roy

Proceedings of the Approximation, 2025

2024

Local Correction of Linear Functions over the Boolean Cube.

Prashanth Amireddy, Amik Raj Behera, Manaswi Paraashar, Srikanth Srinivasan, Madhu Sudan

Proceedings of the 56th Annual ACM Symposium on Theory of Computing, 2024

On the Communication Complexity of Finding a King in a Tournament.

Nikhil S. Mande, Manaswi Paraashar, Swagato Sanyal, Nitin Saurabh

Proceedings of the Approximation, 2024

Approximate Degree Composition for Recursive Functions.

Sourav Chakraborty, Chandrima Kayal, Rajat Mittal, Manaswi Paraashar, Nitin Saurabh

Proceedings of the Approximation, 2024

2023

Computational Complexity of Discrete Problems (Dagstuhl Seminar 23111).

Anna Gál, Meena Mahajan, Rahul Santhanam, Till Tantau, Manaswi Paraashar

Dagstuhl Reports, March, 2023

Linear isomorphism testing of Boolean functions with small approximate spectral norm.

Arijit Ghosh, Chandrima Kayal, Manaswi Paraashar, Manmatha Roy

CoRR, 2023

Randomized and Quantum Query Complexities of Finding a King in a Tournament.

Nikhil S. Mande, Manaswi Paraashar, Nitin Saurabh

Proceedings of the 43rd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2023

On the Composition of Randomized Query Complexity and Approximate Degree.

Sourav Chakraborty, Chandrima Kayal, Rajat Mittal, Manaswi Paraashar, Swagato Sanyal, Nitin Saurabh

Proceedings of the Approximation, 2023

2022

Symmetry and Quantum Query-To-Communication Simulation.

Sourav Chakraborty, Arkadev Chattopadhyay, Peter Høyer, Nikhil S. Mande, Manaswi Paraashar, Ronald de Wolf

Proceedings of the 39th International Symposium on Theoretical Aspects of Computer Science, 2022

Separations Between Combinatorial Measures for Transitive Functions.

Sourav Chakraborty, Chandrima Kayal, Manaswi Paraashar

Proceedings of the 49th International Colloquium on Automata, Languages, and Programming, 2022

Counting and Sampling from Substructures Using Linear Algebraic Queries.

Arijit Bishnu, Arijit Ghosh, Gopinath Mishra, Manaswi Paraashar

Proceedings of the 42nd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2022

2021

Tight Chang's-Lemma-Type Bounds for Boolean Functions.

Sourav Chakraborty, Nikhil S. Mande, Rajat Mittal, Tulasimohan Molli, Manaswi Paraashar, Swagato Sanyal

Proceedings of the 41st IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2021

Query Complexity of Global Minimum Cut.

Arijit Bishnu, Arijit Ghosh, Gopinath Mishra, Manaswi Paraashar

Proceedings of the Approximation, 2021

2020

Quantum Query-To-Communication Simulation Needs a Logarithmic Overhead.

Sourav Chakraborty, Arkadev Chattopadhyay, Nikhil S. Mande, Manaswi Paraashar

Proceedings of the 35th Computational Complexity Conference, 2020

Disjointness Through the Lens of Vapnik-Chervonenkis Dimension: Sparsity and Beyond.

Anup Bhattacharya, Sourav Chakraborty, Arijit Ghosh, Gopinath Mishra, Manaswi Paraashar

Proceedings of the Approximation, 2020

2019

Inner Product Oracle can Estimate and Sample.

Arijit Bishnu, Arijit Ghosh, Gopinath Mishra, Manaswi Paraashar

CoRR, 2019

Two New Results About Quantum Exact Learning.

Srinivasan Arunachalam, Sourav Chakraborty, Troy Lee, Manaswi Paraashar, Ronald de Wolf

Proceedings of the 46th International Colloquium on Automata, Languages, and Programming, 2019