| Building Strategies Into Qbf Proofs | 0 | 0.34 | 2021 |
| MaxSAT Resolution and Subcube Sums | 0 | 0.34 | 2020 |
| Hard QBFs for Merge Resolution | 0 | 0.34 | 2020 |
| Hardness Characterisations and Size-Width Lower Bounds for QBF Resolution | 0 | 0.34 | 2020 |
| Algebraic Branching Programs, Border Complexity, and Tangent Spaces | 0 | 0.34 | 2020 |
| Research in theoretical computer science | 0 | 0.34 | 2019 |
| Lower Bounds for Linear Decision Lists. | 0 | 0.34 | 2019 |
| Are Short Proofs Narrow? QBF Resolution Is Not So Simple. | 4 | 0.41 | 2018 |
| Shortest path length with bounded-alternation (min, +) formulas. | 0 | 0.34 | 2018 |
| Sums of read-once formulas: How many summands are necessary? | 0 | 0.34 | 2018 |
| Computing the Maximum using (min, +) Formulas. | 0 | 0.34 | 2018 |
| Short Proofs in QBF Expansion. | 0 | 0.34 | 2018 |
| Lower Bound Techniques for QBF Proof Systems. | 0 | 0.34 | 2018 |
| Arithmetic Circuits: An Overview (Invited Talk). | 0 | 0.34 | 2017 |
| Understanding Cutting Planes for QBFs. | 0 | 0.34 | 2017 |
| The shifted partial derivative complexity of Elementary Symmetric Polynomials. | 1 | 0.38 | 2017 |
| A Quest for Structure in Complexity. | 0 | 0.34 | 2017 |
| Sums of read-once formulas: How many summands suffice? | 1 | 0.36 | 2016 |
| Space-Efficient Approximations for Subset Sum. | 0 | 0.34 | 2016 |
| VNP=VP in the multilinear world | 0 | 0.34 | 2016 |
| Level-ordered Q-resolution and tree-like Q-resolution are incomparable. | 1 | 0.35 | 2016 |
| Some Complete and Intermediate Polynomials in Algebraic Complexity Theory. | 1 | 0.37 | 2016 |
| Relating two width measures for resolution proofs. | 0 | 0.34 | 2016 |
| Read-once polynomials: How many summands suffice? | 0 | 0.34 | 2015 |
| Feasible Interpolation for QBF Resolution Calculi. | 9 | 0.48 | 2015 |
| Monomials, multilinearity and identity testing in simple read-restricted circuits | 1 | 0.36 | 2014 |
| Building above Read-once Polynomials: Identity Testing and Hardness of Representation. | 3 | 0.38 | 2014 |
| Algebraic Complexity Classes. | 2 | 0.38 | 2013 |
| Comments on Arithmetic Complexity, Kleene Closure, and Formal Power Series | 0 | 0.34 | 2013 |
| Resource Trade-offs in Syntactically Multilinear Arithmetic Circuits | 3 | 0.40 | 2013 |
| Small Depth Proof Systems. | 0 | 0.34 | 2013 |
| Small space analogues of Valiant's classes and the limitations of skew formula. | 3 | 0.42 | 2013 |
| Identity testing, multilinearity testing, and monomials in read-once/twice formulas and branching programs | 2 | 0.37 | 2012 |
| Counting paths in planar width 2 branching programs | 2 | 0.37 | 2012 |
| Counting Paths in VPA Is Complete for #NC 1 | 1 | 0.37 | 2012 |
| Verifying Proofs In Constant Depth | 0 | 0.34 | 2012 |
| The Complexity of Unary Subset Sum. | 0 | 0.34 | 2012 |
| Verifying proofs in constant depth | 1 | 0.37 | 2011 |
| Arithmetizing Classes Around NC\textsf{NC}1 and L\textsf{L} | 0 | 0.34 | 2010 |
| Counting classes and the fine structure between NC1and L | 3 | 0.43 | 2010 |
| Counting Paths in VPA Is Complete for #NC1 | 1 | 0.37 | 2010 |
| Frontmatter, Table of Contents, Preface, Conference Organization, Author Index | 0 | 0.34 | 2010 |
| Longest paths in planar DAGs in unambiguous logspace | 6 | 0.53 | 2009 |
| Parameterizing above or below guaranteed values | 53 | 1.97 | 2009 |
| The planar k-means problem is NP-hard | 109 | 3.95 | 2009 |
| Small-space analogues of Valiant's classes | 8 | 0.56 | 2009 |
| Upper Bounds for Monotone Planar Circuit Value and Variants | 13 | 0.58 | 2009 |
| Membership Testing: Removing Extra Stacks from Multi-stack Pushdown Automata | 1 | 0.38 | 2009 |
| Rigidity of a simple extended lower triangular matrix | 1 | 0.41 | 2008 |
| Simultaneous matchings: Hardness and approximation | 9 | 0.52 | 2008 |
