| Separation of AC(0)[circle plus] Formulas and Circuits | 0 | 0.34 | 2019 |
| A Polynomial Excluded-Minor Approximation of Treedepth. | 0 | 0.34 | 2018 |
| Formulas versus Circuits for Small Distance Connectivity. | 0 | 0.34 | 2018 |
| The Average Sensitivity of Bounded-Depth Formulas. | 4 | 0.42 | 2018 |
| Separation of AC$^0[\oplus]$ Formulas and Circuits. | 0 | 0.34 | 2017 |
| Exponential Lower Bounds for Monotone Span Programs | 1 | 0.35 | 2016 |
| Poly-logarithmic Frege depth lower bounds via an expander switching lemma. | 3 | 0.40 | 2016 |
| An Improved Homomorphism Preservation Theorem From Lower Bounds in Circuit Complexity. | 2 | 0.43 | 2016 |
| The Monotone Complexity of k-clique on Random Graphs | 6 | 0.58 | 2014 |
| The Query Complexity of Witness Finding. | 0 | 0.34 | 2014 |
| Formulas vs. circuits for small distance connectivity | 0 | 0.34 | 2013 |
| A Tight Upper Bound on the Number of Variables for Average-Case k-Clique on Ordered Graphs. | 0 | 0.34 | 2012 |
| Query Complexity and Error Tolerance of Witness Finding Algorithms. | 1 | 0.36 | 2012 |
| The homomorphism domination exponent | 2 | 0.40 | 2011 |
| Ehrenfeucht-Fraïssé Games on Random Structures | 1 | 0.37 | 2009 |
| Combining Ehrenfeucht-Fraïssé Games | 0 | 0.34 | 2009 |
| An Optimal Decomposition Algorithm for Tree Edit Distance | 86 | 3.07 | 2009 |
| On the constant-depth complexity of k-clique | 32 | 1.35 | 2008 |
| Homomorphism preservation theorems | 25 | 0.94 | 2008 |
| Choiceless polynomial time, counting and the Cai–Fürer–Immerman graphs | 15 | 0.80 | 2008 |
| Interactive Small-Step Algorithms II: Abstract State Machines and the Characterization Theorem. | 9 | 0.55 | 2007 |
| Successor-invariant first-order logic on finite structures | 5 | 0.43 | 2007 |
| Interactive Small-Step Algorithms I: Axiomatization | 5 | 0.44 | 2007 |
| An O(n^3)-Time Algorithm for Tree Edit Distance | 15 | 0.66 | 2006 |
| Choiceless Polynomial Time, Counting and the Cai-Fürer-Immerman Graphs: (Extended Abstract) | 3 | 0.41 | 2006 |
| Existential Positive Types and Preservation under Homomorphisisms | 32 | 1.53 | 2005 |
| Explicit Graphs with Extension Properties | 4 | 0.55 | 2005 |
| Semantic essence of AsmL | 40 | 2.57 | 2003 |
| Successor-Invariance in the Finite | 7 | 0.69 | 2003 |
