| ● On the composition of randomized query complexity and approximate degree with S. Chakraborty, C. Kayal, M. Paraashar, N. Saurabh and S. Sanyal |
Randoom 2023 |
arxiv / LIPICS |
| ● Certificate games; with S. Chakraborty, A. Gal, S. Laplante and A. Sunny |
ITCS 2023 |
arxiv / ECCC |
| ● Lower bounds on quantum query complexity for symmetric functions; with S. Nair and S. Patro |
CALDAM 2024 |
arxiv |
| ● Tight Chang's-lemma-type bounds for Boolean functions; with S. Chakraborty, N. Mande, T. Molli, M. Paraashar and S. Sanyal |
FSTTCS 2021 |
arxiv |
| ● On algorithms to find p-ordering; with A. Gulati and S. Chakrabarti |
CALDAM 2021 |
arxiv |
| ● Counting basic-irreducible factors mod p^k in deterministic poly-time and p-adic applications; with A. Dwivedi and N. Saxena |
CCC 2019 |
arxiv /ECCC |
| ● Efficiently factoring polynomials modulo p^4; with A. Dwivedi and N. Saxena |
ISSAC 2019 and Journal of Symbolic Computation 2020 |
arxiv /ECCC/Sciencedirect |
| ● Stabilizer codes from modified symplectic form; with T. Gandhi and P. Kurur |
ISIT 2019 |
arxiv |
| ● Irreducibility and deterministic r-th root finding over finite fields; with V. Bhargava, G. Ivanyos and N. Saxena. |
ISSAC 2017 |
arxiv /ECCC |
| ● Extended nonlocal games and monogamy-of-entanglement games; with N. Johnston, V. Russo and J. Watrous. |
Royal Society A 2016 |
arxiv |
| ● Characterization of binary constraint system games; with R. Cleve. |
ICALP 2014 and QIP 2014 |
arxiv |
| ● Quantum query complexity of state conversion; with T. Lee, B. Reichardt, R. Spalek and M. Szegedy. |
FOCS 2011 and QIP 2012 |
arxiv |
| ● Square root bound on the least power non-residues; with M. Forbes, N. Kayal and C. Saha. |
2011 |
arxiv |
| ● Product theorems via semidefinite programming; with T. Lee. |
ICALP 2008 |
arxiv |
| ● Product rules in semidefinite programming; with M. Szegedy. |
FCT 2007 |
Link |
