| No. |
Title |
Author |
Year |
| 1 |
Enumeration Classes Defined by Circuits |
Creignou, Nadia et al. |
2022 |
| 2 |
Recursion Schemes, Discrete Differential Equations and Characterization of Polynomial Time Computations |
Bournez, Olivier et al. |
2019 |
| 3 |
Descriptive Complexity of #AC^0 Functions |
Durand, Arnaud et al. |
2016 |
| 4 |
Homomorphism Polynomials Complete for VP |
Durand, Arnaud et al. |
2014 |
| 5 |
LIPIcs, Volume 16, CSL'12, Complete Volume |
Cégielski, Patrick et al. |
2013 |
| 6 |
The arithmetic complexity of tensor contractions |
Capelli, Florent et al. |
2013 |
| 7 |
Frontmatter, Table of Contents, Preface, Conference Organization |
Cégielski, Patrick et al. |
2012 |
| 8 |
Dependence logic with a majority quantifier |
Durand, Arnaud et al. |
2011 |
| 9 |
Enumeration Complexity of Logical Query Problems with Second-order Variables |
Durand, Arnaud et al. |
2011 |
| 10 |
Counting Results in Weak Formalisms |
Durand, Arnaud et al. |
2007 |
