| Quantum query complexity of state conversion T Lee, R Mittal, BW Reichardt, R Špalek, M Szegedy 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science, 344-353, 2011 | 161 | 2011 |
| Characterization of binary constraint system games R Cleve, R Mittal Automata, Languages, and Programming: 41st International Colloquium, ICALP …, 2014 | 92 | 2014 |
| Product rules in semidefinite programming R Mittal, M Szegedy International Symposium on Fundamentals of Computation Theory, 435-445, 2007 | 31 | 2007 |
| Extended non-local games and monogamy-of-entanglement games N Johnston, R Mittal, V Russo, J Watrous Proceedings of the Royal Society A: Mathematical, Physical and Engineering …, 2016 | 23 | 2016 |
| Efficiently factoring polynomials modulo p4 A Dwivedi, R Mittal, N Saxena Proceedings of the 2019 on International Symposium on Symbolic and Algebraic …, 2019 | 16 | 2019 |
| Counting basic-irreducible factors mod in deterministic poly-time and -adic applications A Dwivedi, R Mittal, N Saxena arXiv preprint arXiv:1902.07785, 2019 | 14 | 2019 |
| An adversary for algorithms T Lee, R Mittal, BW Reichardt, R Špalek arXiv preprint arXiv:1011.3020, 1-18, 2010 | 14 | 2010 |
| Product theorems via semidefinite programming T Lee, R Mittal International Colloquium on Automata, Languages, and Programming, 674-685, 2008 | 7 | 2008 |
| On Algorithms to Find p-ordering A Gulati, S Chakrabarti, R Mittal Algorithms and Discrete Applied Mathematics: 7th International Conference …, 2021 | 5 | 2021 |
| Tight Chang's-lemma-type bounds for Boolean functions S Chakraborty, NS Mande, R Mittal, T Molli, M Paraashar, S Sanyal arXiv preprint arXiv:2012.02335, 2020 | 3 | 2020 |
| Stabilizer codes from modified symplectic forms T Gandhi, P Kurur, R Mittal 2019 IEEE International Symposium on Information Theory (ISIT), 2903-2907, 2019 | 3 | 2019 |
| Irreducibility and deterministic r-th root finding over finite fields V Bhargava, G Ivanyos, R Mittal, N Saxena Proceedings of the 2017 ACM on International Symposium on Symbolic and …, 2017 | 3 | 2017 |
| Lower bounds on quantum query complexity for symmetric functions R Mittal, SS Nair, S Patro arXiv preprint arXiv:2110.12616, 2021 | 1 | 2021 |
| On the Composition of Randomized Query Complexity and Approximate Degree S Chakraborty, C Kayal, M Paraashar, R Mittal, S Sanyal, N Saurabh arXiv preprint arXiv:2307.03900, 2023 | | 2023 |
| Certificate games S Chakraborty, A Gál, S Laplante, R Mittal, A Sunny arXiv preprint arXiv:2211.03396, 2022 | | 2022 |
| Efficiently factoring polynomials modulo p⁴ A Dwivedi, R Mittal, N Saxena Association for Computing Machinery, 2019 | | 2019 |
| Square root Bound on the Least Power Non-residue using a Sylvester-Vandermonde Determinant M Forbes, N Kayal, R Mittal, C Saha arXiv preprint arXiv:1104.4557, 2011 | | 2011 |
| Application of SDP to product rules and quantum query complexity R Mittal Rutgers The State University of New Jersey, School of Graduate Studies, 2011 | | 2011 |
| Internship Report–NEC 2008 R Mittal | | 2008 |
| Lecture 16: Strong duality R Mittal | | |
Troy LeeUniversity of Technology SydneyVerified email at uts.edu.au
