Marc Bagnol

According to our database1, Marc Bagnol authored at least 12 papers between 2014 and 2018.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of five.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2018
Unification and Logarithmic Space.
Log. Methods Comput. Sci., 2018

Büchi Good-for-Games Automata Are Efficiently Recognizable.
Proceedings of the 38th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2018

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

2016
The Shuffle Quasimonad and Modules with Differentiation and Integration.
Proceedings of the Thirty-second Conference on the Mathematical Foundations of Programming Semantics, 2016

Unary Resolution: Characterizing Ptime.
Proceedings of the Foundations of Software Science and Computation Structures, 2016

2015
Representation of Partial Traces.
Proceedings of the 31st Conference on the Mathematical Foundations of Programming Semantics, 2015

Memoization for Unary Logic Programming: Characterizing PTIME.
CoRR, 2015

MALL Proof Equivalence is Logspace-Complete, via Binary Decision Diagrams.
Proceedings of the 13th International Conference on Typed Lambda Calculi and Applications, 2015

On the Dependencies of Logical Rules.
Proceedings of the Foundations of Software Science and Computation Structures, 2015

2014
On the Resolution Semiring. (Sur le Semi-anneau de Résolution).
PhD thesis, 2014

Analyse de dépendances et correction des réseaux de preuve.
Proceedings of the 25. Journées francophones des langages applicatifs, 2014

Logic Programming and Logarithmic Space.
Proceedings of the Programming Languages and Systems - 12th Asian Symposium, 2014


  Loading...