Logic Programming and Logarithmic Space. - Clément Aubert; Marc Bagnol; Paolo Pistone; Thomas Seiller (APLAS, 2014)

Analyse de dépendances et correction des réseaux de preuve. - Marc Bagnol; Amina Doumane; Alexis Saurin (JFLA, 2014)

On the Resolution Semiring. (Sur le Semi-anneau de Résolution). - Marc Bagnol (2014)

On the Dependencies of Logical Rules. - Marc Bagnol; Amina Doumane; Alexis Saurin (FoSSaCS, 2015)

MALL Proof Equivalence is Logspace-Complete, via Binary Decision Diagrams. - Marc Bagnol (TLCA, 2015)

Memoization for Unary Logic Programming: Characterizing PTIME. - Clément Aubert; Marc Bagnol; Thomas Seiller (CoRR, 2015)

Representation of Partial Traces. - Marc Bagnol (MFPS, 2015)

Unary Resolution: Characterizing Ptime. - Clément Aubert; Marc Bagnol; Thomas Seiller (FoSSaCS, 2016)

The Shuffle Quasimonad and Modules with Differentiation and Integration. - Marc Bagnol; Richard Blute; J. Robin B. Cockett; J. S. Lemay (MFPS, 2016)

Multiplicative-Additive Proof Equivalence is Logspace-complete, via Binary Decision Trees. - Marc Bagnol (Log. Methods Comput. Sci., 2017)

Büchi Good-for-Games Automata Are Efficiently Recognizable. - Marc Bagnol; Denis Kuperberg (FSTTCS, 2018)

Unification and Logarithmic Space. - Clément Aubert; Marc Bagnol (Log. Methods Comput. Sci., 2018)