| 2008 |
|---|
| 18 | EE | Guillaume Bonfante,
Reinhard Kahle,
Jean-Yves Marion,
Isabel Oitavem:
Recursion Schemata for NCk.
CSL 2008: 49-63 |
| 17 | EE | Guillaume Bonfante,
Yves Guiraud:
Intensional Properties of Polygraphs.
Electr. Notes Theor. Comput. Sci. 203(1): 65-77 (2008) |
| 2007 |
|---|
| 16 | EE | Guillaume Bonfante,
Matthieu Kaczmarek,
Jean-Yves Marion:
A Classification of Viruses Through Recursion Theorems.
CiE 2007: 73-82 |
| 15 | EE | Guillaume Bonfante,
Jean-Yves Marion,
Romain Péchoux:
Quasi-interpretation Synthesis by Decomposition.
ICTAC 2007: 410-424 |
| 14 | EE | Guillaume Bonfante,
Yves Guiraud:
Programs as polygraphs: computability and complexity
CoRR abs/cs/0701032: (2007) |
| 13 | EE | Guillaume Bonfante,
Yves Guiraud:
Intensional properties of polygraphs
CoRR abs/cs/0703007: (2007) |
| 12 | EE | Guillaume Bonfante,
Jean-Yves Marion:
Foreword.
Journal in Computer Virology 3(1): 1-2 (2007) |
| 2006 |
|---|
| 11 | EE | Guillaume Bonfante:
Some Programming Languages for Logspace and Ptime.
AMAST 2006: 66-80 |
| 10 | EE | Guillaume Bonfante,
Joseph Le Roux,
Guy Perrier:
Lexical Disambiguation with Polarities and Automata.
CIAA 2006: 283-284 |
| 9 | EE | Guillaume Bonfante,
Reinhard Kahle,
Jean-Yves Marion,
Isabel Oitavem:
Towards an Implicit Characterization of NCk.
CSL 2006: 212-224 |
| 8 | EE | Guillaume Bonfante,
Jean-Yves Marion,
Romain Péchoux:
A Characterization of Alternating Log Time by First Order Functional Programs.
LPAR 2006: 90-104 |
| 7 | EE | Guillaume Bonfante,
Matthieu Kaczmarek,
Jean-Yves Marion:
On Abstract Computer Virology from a Recursion Theoretic Perspective.
Journal in Computer Virology 1(3-4): 45-54 (2006) |
| 2005 |
|---|
| 6 | EE | Guillaume Bonfante,
Matthieu Kaczmarek,
Jean-Yves Marion:
Toward an Abstract Computer Virology.
ICTAC 2005: 579-593 |
| 5 | EE | Guillaume Bonfante,
Jean-Yves Marion,
Jean-Yves Moyen:
Quasi-interpretations and Small Space Bounds.
RTA 2005: 150-164 |
| 2001 |
|---|
| 4 | EE | Guillaume Bonfante,
Jean-Yves Marion,
Jean-Yves Moyen:
On Lexicographic Termination Ordering with Space Bound Certifications.
Ershov Memorial Conference 2001: 482-493 |
| 3 | EE | Guillaume Bonfante,
Philippe de Groote:
Stochastic Lambek Categorial Grammars.
Electr. Notes Theor. Comput. Sci. 53: (2001) |
| 2 | | Guillaume Bonfante,
Adam Cichon,
Jean-Yves Marion,
Hélène Touzet:
Algorithms with polynomial interpretation termination proof.
J. Funct. Program. 11(1): 33-53 (2001) |
| 1998 |
|---|
| 1 | | Guillaume Bonfante,
Adam Cichon,
Jean-Yves Marion,
Hélène Touzet:
Complexity Classes and Rewrite Systems with Polynomial Interpretation.
CSL 1998: 372-384 |
