![](https://dblp.org/img/logo.ua.320x120.png)
![](https://dblp.org/img/dropdown.dark.16x16.png)
![](https://dblp.org/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.org/img/search.dark.16x16.png)
![search dblp](https://dblp.org/img/search.dark.16x16.png)
default search action
Manaswi Paraashar
Person information
Refine list
![note](https://dblp.org/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [c11]Prashanth Amireddy
, Amik Raj Behera
, Manaswi Paraashar
, Srikanth Srinivasan
, Madhu Sudan
:
Local Correction of Linear Functions over the Boolean Cube. STOC 2024: 764-775 - [i20]Nikhil S. Mande, Manaswi Paraashar, Swagato Sanyal, Nitin Saurabh:
On the communication complexity of finding a king in a tournament. CoRR abs/2402.14751 (2024) - [i19]Prashanth Amireddy, Amik Raj Behera, Manaswi Paraashar, Srikanth Srinivasan, Madhu Sudan:
Local Correction of Linear Functions over the Boolean Cube. CoRR abs/2403.20305 (2024) - [i18]Sourav Chakraborty, Chandrima Kayal, Rajat Mittal, Manaswi Paraashar, Nitin Saurabh:
Approximate Degree Composition for Recursive Functions. CoRR abs/2407.08385 (2024) - [i17]Prashanth Amireddy, Amik Raj Behera, Manaswi Paraashar, Srikanth Srinivasan, Madhu Sudan:
Local Correction of Linear Functions over the Boolean Cube. Electron. Colloquium Comput. Complex. TR24 (2024) - 2023
- [c10]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: 63:1-63:23 - [c9]Nikhil S. Mande, Manaswi Paraashar
, Nitin Saurabh:
Randomized and Quantum Query Complexities of Finding a King in a Tournament. FSTTCS 2023: 30:1-30:19 - [i16]Sourav Chakraborty, Chandrima Kayal, Rajat Mittal, Manaswi Paraashar, Swagato Sanyal, Nitin Saurabh:
On the Composition of Randomized Query Complexity and Approximate Degree. CoRR abs/2307.03900 (2023) - [i15]Nikhil S. Mande, Manaswi Paraashar, Nitin Saurabh:
Randomized and quantum query complexities of finding a king in a tournament. CoRR abs/2308.02472 (2023) - [i14]Arijit Ghosh, Chandrima Kayal, Manaswi Paraashar, Manmatha Roy:
Linear isomorphism testing of Boolean functions with small approximate spectral norm. CoRR abs/2308.02662 (2023) - [i13]Anna Gál, Meena Mahajan, Rahul Santhanam, Till Tantau, Manaswi Paraashar:
Computational Complexity of Discrete Problems (Dagstuhl Seminar 23111). Dagstuhl Reports 13(3): 17-31 (2023) - [i12]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. TR23 (2023) - [i11]Sourav Chakraborty, Chandrima Kayal, Manaswi Paraashar:
Separations between Combinatorial Measures for Transitive Functions. Electron. Colloquium Comput. Complex. TR23 (2023) - 2022
- [j2]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): 9 (2022) - [c8]Arijit Bishnu, Arijit Ghosh, Gopinath Mishra, Manaswi Paraashar
:
Counting and Sampling from Substructures Using Linear Algebraic Queries. FSTTCS 2022: 8:1-8:20 - [c7]Sourav Chakraborty, Chandrima Kayal, Manaswi Paraashar
:
Separations Between Combinatorial Measures for Transitive Functions. ICALP 2022: 36:1-36:20 - [c6]Sourav Chakraborty, Arkadev Chattopadhyay, Peter Høyer
, Nikhil S. Mande
, Manaswi Paraashar
, Ronald de Wolf:
Symmetry and Quantum Query-To-Communication Simulation. STACS 2022: 20:1-20:23 - 2021
- [j1]Srinivasan Arunachalam, Sourav Chakraborty, Troy Lee, Manaswi Paraashar
, Ronald de Wolf:
Two new results about quantum exact learning. Quantum 5: 587 (2021) - [c5]Arijit Bishnu, Arijit Ghosh, Gopinath Mishra, Manaswi Paraashar
:
Query Complexity of Global Minimum Cut. APPROX-RANDOM 2021: 6:1-6:15 - [c4]Sourav Chakraborty, Nikhil S. Mande
, Rajat Mittal, Tulasimohan Molli, Manaswi Paraashar
, Swagato Sanyal:
Tight Chang's-Lemma-Type Bounds for Boolean Functions. FSTTCS 2021: 10:1-10:22 - [i10]Sourav Chakraborty, Chandrima Kayal, Manaswi Paraashar:
Separations between Combinatorial Measures for Transitive Functions. CoRR abs/2103.12355 (2021) - 2020
- [c3]Anup Bhattacharya, Sourav Chakraborty, Arijit Ghosh, Gopinath Mishra, Manaswi Paraashar
:
Disjointness Through the Lens of Vapnik-Chervonenkis Dimension: Sparsity and Beyond. APPROX-RANDOM 2020: 23:1-23:15 - [c2]Sourav Chakraborty, Arkadev Chattopadhyay, Nikhil S. Mande
, Manaswi Paraashar
:
Quantum Query-To-Communication Simulation Needs a Logarithmic Overhead. CCC 2020: 32:1-32:15 - [i9]Anup Bhattacharya, Sourav Chakraborty, Arijit Ghosh, Gopinath Mishra, Manaswi Paraashar:
Disjointness through the Lens of Vapnik-Chervonenkis Dimension: Sparsity and Beyond. CoRR abs/2006.13712 (2020) - [i8]Arijit Bishnu, Arijit Ghosh, Gopinath Mishra, Manaswi Paraashar:
Query Complexity of Global Minimum Cut. CoRR abs/2007.09202 (2020) - [i7]Sourav Chakraborty, Nikhil S. Mande, Rajat Mittal, Tulasimohan Molli, Manaswi Paraashar, Swagato Sanyal:
Tight Chang's-lemma-type bounds for Boolean functions. CoRR abs/2012.02335 (2020) - [i6]Sourav Chakraborty, Arkadev Chattopadhyay, Peter Høyer, Nikhil S. Mande, Manaswi Paraashar, Ronald de Wolf:
Symmetry and Quantum Query-to-Communication Simulation. CoRR abs/2012.05233 (2020) - [i5]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. TR20 (2020) - [i4]Arijit Bishnu, Arijit Ghosh, Gopinath Mishra, Manaswi Paraashar:
Query Complexity of Global Minimum Cut. Electron. Colloquium Comput. Complex. TR20 (2020)
2010 – 2019
- 2019
- [c1]Srinivasan Arunachalam, Sourav Chakraborty, Troy Lee, Manaswi Paraashar
, Ronald de Wolf:
Two New Results About Quantum Exact Learning. ICALP 2019: 16:1-16:15 - [i3]Arijit Bishnu, Arijit Ghosh, Gopinath Mishra, Manaswi Paraashar:
Inner Product Oracle can Estimate and Sample. CoRR abs/1906.07398 (2019) - [i2]Sourav Chakraborty, Arkadev Chattopadhyay, Nikhil S. Mande, Manaswi Paraashar:
Quantum Query-to-Communication Simulation Needs a Logarithmic Overhead. CoRR abs/1909.10428 (2019) - [i1]Sourav Chakraborty, Arkadev Chattopadhyay, Nikhil S. Mande, Manaswi Paraashar:
Quantum Query-to-Communication Simulation Needs a Logarithmic Overhead. Electron. Colloquium Comput. Complex. TR19 (2019)
Coauthor Index
![](https://dblp.org/img/cog.dark.24x24.png)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-16 18:33 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint