Product Rules in Semidefinite Programming. - Rajat Mittal 001; Mario Szegedy (FCT, 2007)

Product Theorems Via Semidefinite Programming. - Troy Lee; Rajat Mittal 001 (ICALP (1), 2008)

Quantum Query Complexity of State Conversion. - Troy Lee; Rajat Mittal 001; Ben W. Reichardt; Robert Spalek; Mario Szegedy (FOCS, 2011)

Square root Bound on the Least Power Non-residue using a Sylvester-Vandermonde Determinant - Michael Forbes; Neeraj Kayal; Rajat Mittal 001; Chandan Saha 001 (CoRR, 2011)

Characterization of Binary Constraint System Games. - Richard Cleve; Rajat Mittal 001 (ICALP (1), 2014)

Irreducibility and r-th root finding over finite fields. - Vishwas Bhargava; Gábor Ivanyos; Rajat Mittal 001; Nitin Saxena 001 (CoRR, 2017)

Stabilizer codes from modified symplectic form. - Tejas Gandhi; Piyush Kurur; Rajat Mittal 001 (CoRR, 2017)

Irreducibility and deterministic r-th root finding over finite fields. - Vishwas Bhargava; Gábor Ivanyos; Rajat Mittal 001; Nitin Saxena 001 (Electron. Colloquium Comput. Complex., 2017)

Stabilizer codes from modified symplectic forms. - Tejas Gandhi; Piyush Kurur; Rajat Mittal 001 (ISIT, 2019)

Efficiently Factoring Polynomials Modulo p4. - Ashish Dwivedi; Rajat Mittal 001; Nitin Saxena 001 (ISSAC, 2019)

Efficiently factoring polynomials modulo p4. - Ashish Dwivedi; Rajat Mittal 001; Nitin Saxena 001 (CoRR, 2019)

Efficiently factoring polynomials modulo $p^4$. - Ashish Dwivedi; Rajat Mittal 001; Nitin Saxena 001 (Electron. Colloquium Comput. Complex., 2019)

Counting basic-irreducible factors mod $p^k$ in deterministic poly-time and $p$-adic applications. - Ashish Dwivedi; Rajat Mittal 001; Nitin Saxena 001 (Electron. Colloquium Comput. Complex., 2019)

On Algorithms to Find p-ordering. - Aditya Gulati; Sayak Chakrabarti; Rajat Mittal 001 (CALDAM, 2021)

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)

Lower bounds on quantum query complexity for symmetric functions. - Rajat Mittal 001; Sanjay S. Nair; Sunayana Patro (CoRR, 2021)

Efficiently factoring polynomials modulo p4. - Ashish Dwivedi; Rajat Mittal 001; Nitin Saxena 001 (J. Symb. Comput., 2021)

Certificate games. - Sourav Chakraborty 001; Anna Gál; Sophie Laplante; Rajat Mittal 001; Anupa Sunny (Electron. Colloquium Comput. Complex., 2022)

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)

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

On Query Complexity Measures and Their Relations for Symmetric Functions. - Rajat Mittal 001; Sanjay S. Nair; Sunayana Patro (CALDAM, 2024)

Relations between monotone complexity measures based on decision tree complexity. - Farzan Byramji; Vatsal Jha; Chandrima Kayal; Rajat Mittal 001 (Electron. Colloquium Comput. Complex., 2024)