| 2009 |
|---|
| 49 | EE | Susanne Albers,
Jean-Yves Marion:
26th International Symposium on Theoretical Aspects of Computer Science, STACS 2009, February 26-28, 2009, Freiburg, Germany, Proceedings
Internationales Begegnungs- und Forschungszentrum fuer Informatik (IBFI), Schloss Dagstuhl, Germany 2009 |
| 48 | EE | Susanne Albers,
Jean-Yves Marion:
Preface - 26th International Symposium on Theoretical Aspects of Computer Science.
STACS 2009 |
| 47 | EE | Jean-Yves Marion:
On tiered small jump operators
CoRR abs/0903.2410: (2009) |
| 2008 |
|---|
| 46 | EE | Guillaume Bonfante,
Reinhard Kahle,
Jean-Yves Marion,
Isabel Oitavem:
Recursion Schemata for NCk.
CSL 2008: 49-63 |
| 45 | EE | Jean-Yves Marion,
Romain Péchoux:
Analyzing the Implicit Computational Complexity of object-oriented programs.
FSTTCS 2008 |
| 44 | EE | Marco Gaboardi,
Jean-Yves Marion,
Simona Ronchi Della Rocca:
A logical account of pspace.
POPL 2008: 121-131 |
| 43 | EE | Jean-Yves Marion,
Romain Péchoux:
Characterizations of polynomial complexity classes with a better intensionality.
PPDP 2008: 79-88 |
| 42 | EE | Jean-Yves Marion,
Romain Péchoux:
A Characterization of NCk.
TAMC 2008: 136-147 |
| 41 | EE | Marco Gaboardi,
Jean-Yves Marion,
Simona Ronchi Della Rocca:
Soft Linear Logic and Polynomial Complexity Classes.
Electr. Notes Theor. Comput. Sci. 205: 67-87 (2008) |
| 2007 |
|---|
| 40 | EE | Guillaume Bonfante,
Matthieu Kaczmarek,
Jean-Yves Marion:
A Classification of Viruses Through Recursion Theorems.
CiE 2007: 73-82 |
| 39 | EE | Guillaume Bonfante,
Jean-Yves Marion,
Romain Péchoux:
Quasi-interpretation Synthesis by Decomposition.
ICTAC 2007: 410-424 |
| 38 | EE | Jean-Yves Marion:
Predicative Analysis of Feasibility and Diagonalization.
TLCA 2007: 290-304 |
| 37 | EE | Jean-Yves Marion,
Romain Péchoux:
Resource control of object-oriented programs
CoRR abs/0706.2293: (2007) |
| 36 | EE | Anne Bonfante,
Jean-Yves Marion:
On the defence notion
CoRR abs/0711.0692: (2007) |
| 35 | EE | Guillaume Bonfante,
Jean-Yves Marion:
Foreword.
Journal in Computer Virology 3(1): 1-2 (2007) |
| 34 | EE | Anne Bonfante,
Jean-Yves Marion:
On the defence notion.
Journal in Computer Virology 3(4): 247-251 (2007) |
| 33 | EE | Jérôme Besombes,
Jean-Yves Marion:
Learning tree languages from positive examples and membership queries.
Theor. Comput. Sci. 382(3): 183-197 (2007) |
| 2006 |
|---|
| 32 | EE | Guillaume Bonfante,
Reinhard Kahle,
Jean-Yves Marion,
Isabel Oitavem:
Towards an Implicit Characterization of NCk.
CSL 2006: 212-224 |
| 31 | EE | Jean-Yves Marion,
Romain Péchoux:
Resource Analysis by Sup-interpretation.
FLOPS 2006: 163-176 |
| 30 | EE | Guillaume Bonfante,
Jean-Yves Marion,
Romain Péchoux:
A Characterization of Alternating Log Time by First Order Functional Programs.
LPAR 2006: 90-104 |
| 29 | EE | Anne Bonfante,
Jean-Yves Marion:
Computers under Attacks!
PhiSE 2006 |
| 28 | EE | Pascal Fontaine,
Jean-Yves Marion,
Stephan Merz,
Leonor Prensa Nieto,
Alwen Fernanto Tiu:
Expressiveness + Automation + Soundness: Towards Combining SMT Solvers and Interactive Proof Assistants.
TACAS 2006: 167-181 |
| 27 | EE | Jean-Yves Marion,
Romain Péchoux:
Quasi-friendly sup-interpretations
CoRR abs/cs/0608020: (2006) |
| 26 | EE | Olivier Bournez,
Felipe Cucker,
Paulin Jacobé de Naurois,
Jean-Yves Marion:
Implicit complexity over an arbitrary structure: Quantifier alternations.
Inf. Comput. 204(2): 210-230 (2006) |
| 25 | 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 |
|---|
| 24 | EE | Guillaume Bonfante,
Matthieu Kaczmarek,
Jean-Yves Marion:
Toward an Abstract Computer Virology.
ICTAC 2005: 579-593 |
| 23 | EE | Guillaume Bonfante,
Jean-Yves Marion,
Jean-Yves Moyen:
Quasi-interpretations and Small Space Bounds.
RTA 2005: 150-164 |
| 22 | EE | Olivier Bournez,
Felipe Cucker,
Paulin Jacobé de Naurois,
Jean-Yves Marion:
Implicit Complexity over an Arbitrary Structure: Sequential and Parallel Polynomial Time.
J. Log. Comput. 15(1): 41-58 (2005) |
| 2004 |
|---|
| 21 | EE | Jérôme Besombes,
Jean-Yves Marion:
Learning Tree Languages from Positive Examples and Membership Queries.
ALT 2004: 440-453 |
| 20 | | Olivier Bournez,
Felipe Cucker,
Paulin Jacobé de Naurois,
Jean-Yves Marion:
Tailoring Recursion to Characterize Non-Deterministic Complexity Classes over Arbitrary Structures.
IFIP TCS 2004: 409-422 |
| 19 | | Jérôme Besombes,
Jean-Yves Marion:
Learning reversible categorial grammars from structures.
Intelligent Information Systems 2004: 181-190 |
| 18 | EE | Jean-Yves Marion:
Editorial: Implicit Computational Complexity.
Theor. Comput. Sci. 318(1-2): 1 (2004) |
| 2003 |
|---|
| 17 | EE | Olivier Bournez,
Felipe Cucker,
Paulin Jacobé de Naurois,
Jean-Yves Marion:
Computability over an Arbitrary Structure. Sequential and Parallel Polynomial Time.
FoSSaCS 2003: 185-199 |
| 16 | EE | Olivier Bournez,
Felipe Cucker,
Paulin Jacobé de Naurois,
Jean-Yves Marion:
Safe Recursion Over an Arbitrary Structure: PAR, PH and DPH.
Electr. Notes Theor. Comput. Sci. 90(1): (2003) |
| 15 | EE | Jean-Yves Marion:
Analysing the implicit complexity of programs.
Inf. Comput. 183(1): 2-18 (2003) |
| 2002 |
|---|
| 14 | EE | Serge Grigorieff,
Jean-Yves Marion:
Kolmogorov complexity and non-determinism.
Theor. Comput. Sci. 271(1-2): 151-180 (2002) |
| 2001 |
|---|
| 13 | EE | Jean-Yves Marion:
Actual Arithmetic and Feasibility.
CSL 2001: 115-129 |
| 12 | EE | Guillaume Bonfante,
Jean-Yves Marion,
Jean-Yves Moyen:
On Lexicographic Termination Ordering with Space Bound Certifications.
Ershov Memorial Conference 2001: 482-493 |
| 11 | | 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) |
| 2000 |
|---|
| 10 | EE | Jean-Yves Marion,
Jean-Yves Moyen:
Efficient First Order Functional Program Interpreter with Time Bound Certifications.
LPAR 2000: 25-42 |
| 9 | EE | E. A. Cichon,
Jean-Yves Marion:
The Light Lexicographic path Ordering
CoRR cs.PL/0010008: (2000) |
| 8 | EE | Daniel Leivant,
Jean-Yves Marion:
A characterization of alternating log time by ramified recurrence.
Theor. Comput. Sci. 236(1-2): 193-208 (2000) |
| 1999 |
|---|
| 7 | EE | Jean-Yves Marion:
From Multiple Sequent for Additive Linear Logic to Decision Procedures for Free Lattices.
Theor. Comput. Sci. 224(1-2): 157-172 (1999) |
| 1998 |
|---|
| 6 | | Guillaume Bonfante,
Adam Cichon,
Jean-Yves Marion,
Hélène Touzet:
Complexity Classes and Rewrite Systems with Polynomial Interpretation.
CSL 1998: 372-384 |
| 1997 |
|---|
| 5 | | Jean-Yves Marion:
Case Study: Additive Linear Logic and Lattices.
LFCS 1997: 237-247 |
| 4 | | Daniel Leivant,
Jean-Yves Marion:
Predicative Functional Recurrence and Poly-space.
TAPSOFT 1997: 369-380 |
| 1994 |
|---|
| 3 | | Daniel Leivant,
Jean-Yves Marion:
Ramified Recurrence and Computational Complexity II: Substitution and Poly-Space.
CSL 1994: 486-500 |
| 1993 |
|---|
| 2 | | Daniel Leivant,
Jean-Yves Marion:
Lambda calculus characterizations of poly-time.
TLCA 1993: 274-288 |
| 1 | | Daniel Leivant,
Jean-Yves Marion:
Lambda Calculus Characterizations of Poly-Time.
Fundam. Inform. 19(1/2): 167-184 (1993) |
