default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDRajat Mittal 0001
Person information
- affiliation: IIT Kanpur, Department of Computer Science and Engineering, India
Other persons with the same name
- Rajat Mittal — disambiguation page
- Rajat Mittal 0002
![[0000-0002-8107-9499]](https://dblp.uni-trier.de/img/orcid-mark.12x12.png "0000-0002-8107-9499")
— Johns Hopkins University, Baltimore, MD, USA (and 2 more)
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c14]Sourav Chakraborty, Chandrima Kayal, Rajat Mittal, Manaswi Paraashar, Nitin Saurabh:
Approximate Degree Composition for Recursive Functions. APPROX/RANDOM 2024: 71:1-71:17- [c13]Rajat Mittal, Sanjay S. Nair, Sunayana Patro:
On Query Complexity Measures and Their Relations for Symmetric Functions. CALDAM 2024: 59-73 - [i19]Farzan Byramji, Vatsal Jha, Chandrima Kayal, Rajat Mittal:
Relations between monotone complexity measures based on decision tree complexity. CoRR abs/2406.07859 (2024) - [i18]Sourav Chakraborty, Chandrima Kayal, Rajat Mittal, Manaswi Paraashar, Nitin Saurabh:
Approximate Degree Composition for Recursive Functions. CoRR abs/2407.08385 (2024) - [i17]Farzan Byramji, Vatsal Jha, Chandrima Kayal, Rajat Mittal:
Relations between monotone complexity measures based on decision tree complexity. Electron. Colloquium Comput. Complex. TR24 (2024) - 2023
- [c12]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 - [c11]Sourav Chakraborty, Anna Gál, Sophie Laplante, Rajat Mittal, Anupa Sunny:
Certificate Games. ITCS 2023: 32:1-32:24 - [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]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) - 2022
- [i14]Sourav Chakraborty, Anna Gál, Sophie Laplante, Rajat Mittal, Anupa Sunny:
Certificate games. CoRR abs/2211.03396 (2022) - [i13]Sourav Chakraborty, Anna Gál, Sophie Laplante, Rajat Mittal, Anupa Sunny:
Certificate games. Electron. Colloquium Comput. Complex. TR22 (2022) - 2021
- [j1]Ashish Dwivedi, Rajat Mittal, Nitin Saxena:
Efficiently factoring polynomials modulo p4. J. Symb. Comput. 104: 805-823 (2021) - [c10]Aditya Gulati, Sayak Chakrabarti, Rajat Mittal:
On Algorithms to Find p-ordering. CALDAM 2021: 333-345 - [c9]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 - [i12]Rajat Mittal, Sanjay S. Nair, Sunayana Patro:
Lower bounds on quantum query complexity for symmetric functions. CoRR abs/2110.12616 (2021) - 2020
- [i11]Aditya Gulati, Sayak Chakrabarti, Rajat Mittal:
On algorithms to find p-ordering. CoRR abs/2011.10978 (2020) - [i10]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)
2010 – 2019
- 2019
- [c8]Ashish Dwivedi, Rajat Mittal, Nitin Saxena:
Counting Basic-Irreducible Factors Mod p^k in Deterministic Poly-Time and p-Adic Applications. CCC 2019: 15:1-15:29 - [c7]Tejas Gandhi, Piyush Kurur, Rajat Mittal:
Stabilizer codes from modified symplectic forms. ISIT 2019: 2903-2907 - [c6]Ashish Dwivedi, Rajat Mittal, Nitin Saxena:
Efficiently Factoring Polynomials Modulo p4. ISSAC 2019: 139-146 - [i9]Ashish Dwivedi, Rajat Mittal, Nitin Saxena:
Efficiently factoring polynomials modulo p4. CoRR abs/1901.06628 (2019) - [i8]Ashish Dwivedi, Rajat Mittal, Nitin Saxena:
Counting basic-irreducible factors mod $p^k$ in deterministic poly-time and $p$-adic applications. CoRR abs/1902.07785 (2019) - [i7]Ashish Dwivedi, Rajat Mittal, Nitin Saxena:
Efficiently factoring polynomials modulo $p^4$. Electron. Colloquium Comput. Complex. TR19 (2019) - [i6]Ashish Dwivedi, Rajat Mittal, Nitin Saxena:
Counting basic-irreducible factors mod $p^k$ in deterministic poly-time and $p$-adic applications. Electron. Colloquium Comput. Complex. TR19 (2019) - 2017
- [c5]Vishwas Bhargava, Gábor Ivanyos, Rajat Mittal, Nitin Saxena:
Irreducibility and Deterministic r-th Root Finding over Finite Fields. ISSAC 2017: 37-44 - [i5]Vishwas Bhargava, Gábor Ivanyos, Rajat Mittal, Nitin Saxena:
Irreducibility and r-th root finding over finite fields. CoRR abs/1702.00558 (2017) - [i4]Tejas Gandhi, Piyush Kurur, Rajat Mittal:
Stabilizer codes from modified symplectic form. CoRR abs/1708.00617 (2017) - [i3]Vishwas Bhargava, Gábor Ivanyos, Rajat Mittal, Nitin Saxena:
Irreducibility and deterministic r-th root finding over finite fields. Electron. Colloquium Comput. Complex. TR17 (2017) - 2014
- [c4]Richard Cleve, Rajat Mittal:
Characterization of Binary Constraint System Games. ICALP (1) 2014: 320-331 - 2011
- [c3]Troy Lee, Rajat Mittal, Ben W. Reichardt, Robert Spalek, Mario Szegedy:
Quantum Query Complexity of State Conversion. FOCS 2011: 344-353 - [i2]Michael Forbes, Neeraj Kayal, Rajat Mittal, Chandan Saha:
Square root Bound on the Least Power Non-residue using a Sylvester-Vandermonde Determinant. CoRR abs/1104.4557 (2011)
2000 – 2009
- 2008
- [c2]Troy Lee, Rajat Mittal:
Product Theorems Via Semidefinite Programming. ICALP (1) 2008: 674-685 - [i1]Troy Lee, Rajat Mittal:
Product theorems via semidefinite programming. CoRR abs/0803.4206 (2008) - 2007
- [c1]Rajat Mittal, Mario Szegedy:
Product Rules in Semidefinite Programming. FCT 2007: 435-445
Coauthor Index
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-10-07 22:24 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
