Publications

Filter by type:

. A Game Characterisation of Tree-like Q-resolution Size. JCSS, 2019.

PDF Publisher Version

. On the Complexity of Hazard-free Circuits.. J.ACM, 2019.

PDF Publisher Version

. A Fixed-Depth Size-Hierarchy Theorem for $\mathsf{AC}^0[\oplus]$ via the Coin Problem.. STOC, 2019.

PDF Publisher Version

. On the Complexity of Hazard-free Circuits.. STOC, 2018.

PDF Publisher Version

. Graph Pattern Polynomials.. FSTTCS, 2018.

PDF Publisher Version

. Small Depth Proof Systems. ToCT, 2016.

PDF Publisher Version

. Space-Efficient Approximations for Subset Sum.. ToCT, 2016.

PDF Publisher Version

. Building Above Read-Once Polynomials: Identity Testing and Hardness of Representation. Algorithmica, 2015.

PDF Publisher Version

. A Game Characterisation of Tree-like Q-resolution Size. LATA 2015, 2015.

PDF Publisher Version

. Verifying Proofs in Constant Depth. ToCT, 2013.

PDF Publisher Version

. The Complexity of Unary Subset Sum. COCOON, 2012.

PDF Publisher Version

. Counting paths in planar width 2 branching programs. CATS, 2012.

PDF Publisher version