| |
| 2008 | ||
|---|---|---|
| 9 | EE | Paulin Jacobé de Naurois, Virgile Mogbil: Correctness of Multiplicative Additive Proof Structures is NL-Complete. LICS 2008: 476-485 |
| 8 | EE | Christophe Fouqueré, Virgile Mogbil: Rewritings for Polarized Multiplicative and Exponential Proof Structures. Electr. Notes Theor. Comput. Sci. 203(1): 109-121 (2008) |
| 2007 | ||
| 7 | EE | Paulin Jacobé de Naurois, Virgile Mogbil: Correctness of Multiplicative (and Exponential) Proof Structures is NL -Complete. CSL 2007: 435-450 |
| 6 | EE | Virgile Mogbil, Vincent Rahli: Uniform Circuits, & Boolean Proof Nets. LFCS 2007: 401-421 |
| 2004 | ||
| 5 | EE | Patrick Baillot, Virgile Mogbil: Soft lambda-Calculus: A Language for Polynomial Time Computation. FoSSaCS 2004: 27-41 |
| 4 | EE | Christophe Fouqueré, Virgile Mogbil: Modules and Logic Programming CoRR cs.LO/0411029: (2004) |
| 2003 | ||
| 3 | EE | Patrick Baillot, Virgile Mogbil: Soft lambda-calculus: a language for polynomial time computation CoRR cs.LO/0312015: (2003) |
| 2001 | ||
| 2 | EE | Virgile Mogbil: Quadratic Correctness Criterion for Non-commutative Logic. CSL 2001: 69-83 |
| 1 | EE | Thomas Krantz, Virgile Mogbil: Encoding Hamiltonian circuits into multiplicative linear logic. Theor. Comput. Sci. 266(1-2): 987-996 (2001) |
| 1 | Patrick Baillot | [3] [5] |
| 2 | Christophe Fouqueré | [4] [8] |
| 3 | Thomas Krantz | [1] |
| 4 | Paulin Jacobé de Naurois | [7] [9] |
| 5 | Vincent Rahli | [6] |