Publications

Conferences

USSR is in P/poly with Samir Datta, SOSA 2024
Multiplicity Problems on Algebraic Series and Context-Free Grammars, with Lorenzo Clemente, Klara Nosan, Mahsa Shirmohammadi, and James Worrell, LICS 2023.
Identity Testing for Radical Expressions, with Klara Nosan, Mahsa Shirmohammadi, and James Worrell, LICS 2022.
Cylotomic Identity Testing and Applications, with Sylvain Perifel, Mahsa Shirmohammadi and James Worrell, ISSAC 2021.
Near-optimal complexity bounds for fragments of the Skolem Problem, with S. Akshay, Aniket Murhekar, Rohith Varma and Nikhil Vyas, STACS 2020.
On the complexity of value iteration, with Stefan Kiefer, Petr Novotný, Guillermo A. Pérez and Mahsa Shirmohammadi, ICALP 2019.
Complexity of restricted variants of Skolem and related problems, with S. Akshay and Nikhil Vyas, MFCS 2017.
Graph properties in node-query setting: effect of breaking symmetry, with Samir Datta, Raghav Kulkarni and Supartha Podder, MFCS, 2016.
Counting Euler Tours in Undirected Bounded Treewidth Graphs, with Samir Datta and Venkatesh Ganesan, FSTTCS, 2015.
Skew Circuits of Small Width, with Andreas Krebs and Nutan Limaye, COCOON 2015.
Bounded Treewidth and Space-Efficient Linear Algebra with Samir Datta, TAMC 2015.
Low-depth Uniform Threshold Circuits and the Bit-Complexity of Straight Line Programs with Eric Allender and Samir Datta, MFCS 2014.
Collapsing Exact Arithmetic Hierarchies with Samir Datta, WALCOM 2014.

On the Complexity of Algebraic Numbers and the Bit-Complexity of Straight Line Programs, with Eric Allender, Samir Datta and Rameshwar Pratap, Computability (The Journal of the Association of Computability in Europe), 2023
Terms of Lucas sequences having a large smooth divisor, with Florian Luca, Canadian Mathematical Bulletin, 2022
Skew Circuits of Small Width, With Andreas Krebs and Nutan Limaye, Theoretical Computer Science, 2020