Manaswi Paraashar

Publication Activity (10 Years)

Years Active: 2019-2024
Publications (10 Years): 33

Top Topics

Boolean Functions

Prime Implicants

Query Complexity

Top Venues

Electron. Colloquium Comput. Complex.

Publications

Prashanth Amireddy, Amik Raj Behera, Manaswi Paraashar, Srikanth Srinivasan, Madhu Sudan
Local Correction of Linear Functions over the Boolean Cube. CoRR (2024)
Prashanth Amireddy, Amik Raj Behera, Manaswi Paraashar, Srikanth Srinivasan, Madhu Sudan
Local Correction of Linear Functions over the Boolean Cube. Electron. Colloquium Comput. Complex. (2024)
Prashanth Amireddy, Amik Raj Behera, Manaswi Paraashar, Srikanth Srinivasan, Madhu Sudan
Local Correction of Linear Functions over the Boolean Cube. STOC (2024)
Nikhil S. Mande, Manaswi Paraashar, Swagato Sanyal, Nitin Saurabh
On the communication complexity of finding a king in a tournament. CoRR (2024)
Sourav Chakraborty, Chandrima Kayal, Rajat Mittal, Manaswi Paraashar, Nitin Saurabh
Approximate Degree Composition for Recursive Functions. CoRR (2024)
Sourav Chakraborty, Chandrima Kayal, Rajat Mittal, Manaswi Paraashar, Swagato Sanyal, Nitin Saurabh
On the Composition of Randomized Query Complexity and Approximate Degree. CoRR (2023)
Nikhil S. Mande, Manaswi Paraashar, Nitin Saurabh
Randomized and Quantum Query Complexities of Finding a King in a Tournament. FSTTCS (2023)
Sourav Chakraborty, Chandrima Kayal, Rajat Mittal, Manaswi Paraashar, Swagato Sanyal, Nitin Saurabh
On the Composition of Randomized Query Complexity and Approximate Degree. Electron. Colloquium Comput. Complex. (2023)
Arijit Ghosh, Chandrima Kayal, Manaswi Paraashar, Manmatha Roy
Linear isomorphism testing of Boolean functions with small approximate spectral norm. CoRR (2023)
Anna Gál, Meena Mahajan, Rahul Santhanam, Till Tantau, Manaswi Paraashar
Computational Complexity of Discrete Problems (Dagstuhl Seminar 23111). Dagstuhl Reports 13 (3) (2023)
Sourav Chakraborty, Chandrima Kayal, Rajat Mittal, Manaswi Paraashar, Swagato Sanyal, Nitin Saurabh
On the Composition of Randomized Query Complexity and Approximate Degree. APPROX/RANDOM (2023)
Sourav Chakraborty, Chandrima Kayal, Manaswi Paraashar
Separations between Combinatorial Measures for Transitive Functions. Electron. Colloquium Comput. Complex. (2023)
Nikhil S. Mande, Manaswi Paraashar, Nitin Saurabh
Randomized and quantum query complexities of finding a king in a tournament. CoRR (2023)
Sourav Chakraborty, Chandrima Kayal, Manaswi Paraashar
Separations Between Combinatorial Measures for Transitive Functions. ICALP (2022)
Sourav Chakraborty, Arkadev Chattopadhyay, Peter Høyer, Nikhil S. Mande, Manaswi Paraashar, Ronald de Wolf
Symmetry and Quantum Query-To-Communication Simulation. STACS (2022)
Anup Bhattacharya, Sourav Chakraborty, Arijit Ghosh, Gopinath Mishra, Manaswi Paraashar
Disjointness through the Lens of Vapnik-Chervonenkis Dimension: Sparsity and Beyond. Comput. Complex. 31 (2) (2022)
Arijit Bishnu, Arijit Ghosh, Gopinath Mishra, Manaswi Paraashar
Counting and Sampling from Substructures Using Linear Algebraic Queries. FSTTCS (2022)
Srinivasan Arunachalam, Sourav Chakraborty, Troy Lee, Manaswi Paraashar, Ronald de Wolf
Two new results about quantum exact learning. Quantum 5 (2021)
Sourav Chakraborty, Nikhil S. Mande, Rajat Mittal, Tulasimohan Molli, Manaswi Paraashar, Swagato Sanyal
Tight Chang's-Lemma-Type Bounds for Boolean Functions. FSTTCS (2021)
Sourav Chakraborty, Chandrima Kayal, Manaswi Paraashar
Separations between Combinatorial Measures for Transitive Functions. CoRR (2021)
Arijit Bishnu, Arijit Ghosh, Gopinath Mishra, Manaswi Paraashar
Query Complexity of Global Minimum Cut. APPROX-RANDOM (2021)
Sourav Chakraborty, Arkadev Chattopadhyay, Peter Høyer, Nikhil S. Mande, Manaswi Paraashar, Ronald de Wolf
Symmetry and Quantum Query-to-Communication Simulation. CoRR (2020)
Arijit Bishnu, Arijit Ghosh, Gopinath Mishra, Manaswi Paraashar
Query Complexity of Global Minimum Cut. Electron. Colloquium Comput. Complex. 27 (2020)
Anup Bhattacharya, Sourav Chakraborty, Arijit Ghosh, Gopinath Mishra, Manaswi Paraashar
Disjointness through the Lens of Vapnik-Chervonenkis Dimension: Sparsity and Beyond. Electron. Colloquium Comput. Complex. 27 (2020)
Sourav Chakraborty, Arkadev Chattopadhyay, Nikhil S. Mande, Manaswi Paraashar
Quantum Query-To-Communication Simulation Needs a Logarithmic Overhead. Computational Complexity Conference (2020)
Anup Bhattacharya, Sourav Chakraborty, Arijit Ghosh, Gopinath Mishra, Manaswi Paraashar
Disjointness Through the Lens of Vapnik-Chervonenkis Dimension: Sparsity and Beyond. APPROX-RANDOM (2020)
Anup Bhattacharya, Sourav Chakraborty, Arijit Ghosh, Gopinath Mishra, Manaswi Paraashar
Disjointness through the Lens of Vapnik-Chervonenkis Dimension: Sparsity and Beyond. CoRR (2020)
Sourav Chakraborty, Nikhil S. Mande, Rajat Mittal, Tulasimohan Molli, Manaswi Paraashar, Swagato Sanyal
Tight Chang's-lemma-type bounds for Boolean functions. CoRR (2020)
Arijit Bishnu, Arijit Ghosh, Gopinath Mishra, Manaswi Paraashar
Query Complexity of Global Minimum Cut. CoRR (2020)
Srinivasan Arunachalam, Sourav Chakraborty, Troy Lee, Manaswi Paraashar, Ronald de Wolf
Two New Results About Quantum Exact Learning. ICALP (2019)
Sourav Chakraborty, Arkadev Chattopadhyay, Nikhil S. Mande, Manaswi Paraashar
Quantum Query-to-Communication Simulation Needs a Logarithmic Overhead. Electron. Colloquium Comput. Complex. 26 (2019)
Sourav Chakraborty, Arkadev Chattopadhyay, Nikhil S. Mande, Manaswi Paraashar
Quantum Query-to-Communication Simulation Needs a Logarithmic Overhead. CoRR (2019)
Arijit Bishnu, Arijit Ghosh, Gopinath Mishra, Manaswi Paraashar
Inner Product Oracle can Estimate and Sample. CoRR (2019)