| Publication | Date of Publication | Type |
|---|
| Symmetric formulas for products of permutations | 2024-09-25 | Paper |
| Tree-Depth and the Formula Complexity of Subgraph Isomorphism | 2023-04-04 | Paper |
| Monotone circuit lower bounds from robust sunflowers | 2022-12-08 | Paper |
| Monotone circuit lower bounds from robust sunflowers | 2022-10-13 | Paper |
| Thresholds in the lattice of subspaces of \(\mathbb{F}_q^n\) | 2022-10-13 | Paper |
| Criticality of regular formulas | 2022-07-27 | Paper |
| A polynomial excluded-minor approximation of treedepth | 2022-03-29 | Paper |
| Shrinkage of Decision Lists and DNF Formulas | 2020-12-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5133640 | 2020-11-10 | Paper |
| LOWER BOUNDS FOR SUBGRAPH ISOMORPHISM | 2020-09-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5111381 | 2020-05-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5111425 | 2020-05-27 | Paper |
| Tree-depth and the Formula Complexity of Subgraph Isomorphism | 2020-04-28 | Paper |
| Thresholds in the Lattice of Subspaces of $(\mathbb F_q)^n$ | 2019-10-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5227514 | 2019-08-06 | Paper |
| Formulas versus Circuits for Small Distance Connectivity | 2018-11-07 | Paper |
| The average sensitivity of bounded-depth formulas | 2018-08-03 | Paper |
| An Average-Case Depth Hierarchy Theorem for Boolean Circuits | 2018-05-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4638077 | 2018-05-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4607893 | 2018-03-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4601839 | 2018-01-24 | Paper |
| The query complexity of witness finding | 2017-10-20 | Paper |
| Poly-logarithmic Frege depth lower bounds via an expander switching lemma | 2017-09-29 | Paper |
| On the $AC^0$ Complexity of Subgraph Isomorphism | 2017-05-30 | Paper |
| Formulas vs. circuits for small distance connectivity | 2015-06-26 | Paper |
| An optimal decomposition algorithm for tree edit distance | 2014-11-18 | Paper |
| The Query Complexity of Witness Finding | 2014-06-24 | Paper |
| The Monotone Complexity of $k$-Clique on Random Graphs | 2014-06-04 | Paper |
| A Tight Upper Bound on the Number of Variables for Average-Case k-Clique on Ordered Graphs | 2012-09-21 | Paper |
| The homomorphism domination exponent | 2011-11-29 | Paper |
| Choiceless Computation and Symmetry | 2010-09-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3396561 | 2009-09-19 | Paper |
| Ehrenfeucht-Fraïssé Games on Random Structures | 2009-07-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5302097 | 2009-01-05 | Paper |
| Homomorphism preservation theorems | 2008-12-21 | Paper |
| Interactive Small-Step Algorithms I: Axiomatization | 2008-04-01 | Paper |
| Interactive Small-Step Algorithms II: Abstract State Machines and the Characterization Theorem | 2008-04-01 | Paper |
| Choiceless polynomial time, counting and the Cai-Fürer-Immerman graphs | 2008-03-28 | Paper |
| An Optimal Decomposition Algorithm for Tree Edit Distance | 2007-11-28 | Paper |
| Successor-invariant first-order logic on finite structures | 2007-07-09 | Paper |
| Semantic essence of AsmL | 2005-11-01 | Paper |
| Formal Methods for Components and Objects | 2005-08-22 | Paper |
