Publications

A full list can be found on DBLP.

Use the following list for local copies:

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

Graph Pattern Polynomials. FSTTCS (2018).

PDF Publisher Version

On the Complexity of Hazard-free Circuits. STOC (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

Teaching

Current Courses:

Past Courses:

  • Computational Complexity Theory (Fall 2020)
  • Data Structures (Fall 2020)
  • Theory of Computation & Introduction to Complexity (Spring 2020)
  • Computational Complexity (Fall 2019)
  • Theory of Computation & Introduction to Complexity (Spring 2019)
  • Data Structures (Fall 2018)
  • Theory of Computation & Introduction to Complexity (Spring 2018)
  • Complexity Theory (Summer 2015 at Saarland University)

Contact