@INPROCEEDINGS{aBM06,
AUTHOR = {Anne Bonfante and Jean-Yves Marion},
BOOKTITLE = {Misc},
DATE-ADDED = {2006-10-26 21:09:25 +0200},
DATE-MODIFIED = {2006-10-30 14:08:34 +0100},
PAGES = {4-7},
TITLE = {Les paradoxes de la d{\'e}fense virale : Le cas Bradley},
VOLUME = {28},
YEAR = {2006}
}
@INPROCEEDINGS{BMP06,
AUTHOR = {Guillaume Bonfante and Jean-Yves Marion and Romain P\'echoux},
BOOKTITLE = {LPAR},
DATE-ADDED = {2006-10-26 20:54:11 +0200},
DATE-MODIFIED = {2006-10-26 21:02:25 +0200},
EDITOR = {Springer},
PAGES = {90-104},
SERIES = {Lecture Notes in Computer Science},
TITLE = {A Characterization of Alternating Log Time by First Order Functional Programs},
URL = {Articles/lpar06.pdf},
VOLUME = {4246},
YEAR = {2006}
}
@ARTICLE{BCMT01,
AUTHOR = {G.~Bonfante and A.~Cichon and J.-Y.~Marion and H.~Touzet},
JOURNAL = {Journal of Functional Programming},
NUMBER = 1,
PAGES = {33-53},
TITLE = {Algorithms with polynomial interpretation termination proof},
URL = {Articles/bcmt01.ps},
VOLUME = 11,
YEAR = 2001
}
@INPROCEEDINGS{LM2,
AUTHOR = {D.~Leivant and J.-Y.~Marion},
BOOKTITLE = {Typed Lambda Calculi and Applications},
EDITOR = {M.~Bezem and J.F.~Groote},
PAGES = {274--288},
PUBLISHER = {Springer},
SERIES = {Lecture Notes in Computer Science},
TITLE = {A $\lambda$-Calculus Characterizations of Poly-Time},
URL = {Articles/tlca93.ps},
VOLUME = 664,
YEAR = {1993}
}
@ARTICLE{LM93,
AUTHOR = {D.~Leivant and J.-Y.~Marion},
JOURNAL = {Fundamenta Informaticae},
MONTH = {September},
NUMBER = {1,2},
PAGES = {167,184},
TITLE = {Lambda Calculus Characterizations of Poly-Time},
VOLUME = {19},
YEAR = {1993}
}
@INPROCEEDINGS{LM94,
ADDRESS = {Kazimierz,Poland},
AUTHOR = {D.~Leivant and J.-Y.~Marion},
BOOKTITLE = {Computer Science Logic, 8th Workshop, CSL '94},
EDITOR = {L.~Pacholski and J.~Tiuryn},
PAGES = {486--500},
PUBLISHER = {Springer},
SERIES = {Lecture Notes in Computer Science},
TITLE = {Ramified recurrence and computational complexity {II}: substitution and poly-space},
URL = {Articles/csl94.ps},
VOLUME = 933,
YEAR = {1994}
}
@INPROCEEDINGS{LM97,
AUTHOR = {D.~Leivant and J.-Y. Marion},
BOOKTITLE = {TAPSOFT'97, Theory and Practice of Software Development},
EDITOR = {M.~Bidoit and M.~Dauchet},
MONTH = {Apr},
PAGES = {369--380},
PUBLISHER = {Springer},
SERIES = {Lecture Notes in Computer Science},
TITLE = {Predicative Functional Recurrence and Poly-Space},
URL = {Articles/caap97.ps},
VOLUME = 1214,
YEAR = 1997
}
@ARTICLE{LeivantMarion,
AUTHOR = {D.~Leivant and J.-Y. Marion},
NOTE = {should be published !},
TITLE = {Predicative recurrence and computational complexity {IV}: {P}redicative functionals and poly-space}
}
@ARTICLE{LM00,
AUTHOR = {D. Leivant and J.-Y. Marion},
EDITOR = {M.~Dauchet},
JOURNAL = {Theoretical Computer Science},
MONTH = {Apr},
NUMBER = {1-2},
PAGES = {192--208},
TITLE = {A characterization of alternating log time by ramified recurrence},
URL = {Articles/tcs00.ps},
VOLUME = 236,
YEAR = 2000
}
@INPROCEEDINGS{MM00,
AUTHOR = {J.-Y.~Marion and J.-Y.~Moyen},
BOOKTITLE = {Logic for Programming and Automated Reasoning, 7th International Conference, LPAR 2000, Reunion Island, France},
EDITOR = {Michel Parigot and Andrei Voronkov},
MONTH = {Nov},
PAGES = {25--42},
PUBLISHER = {Springer},
SERIES = {Lecture Notes in Computer Science},
TITLE = {Efficient first order functional program interpreter with time bound certifications},
URL = {Articles/lpar00.ps},
VOLUME = 1955,
YEAR = 2000
}
@ARTICLE{Mar99a,
AUTHOR = {J.-Y. Marion},
EDITOR = {S. Adian},
JOURNAL = {Theoretical Computer Science},
NUMBER = {1-2},
PAGES = {157-172},
TITLE = {From multiple sequent for Additive Linear Logic to decision procedures for Free Lattices},
URL = {Articles/tcs99.ps},
VOLUME = {224},
YEAR = 1999
}
@INPROCEEDINGS{MP06,
AUTHOR = {J-Y Marion and R. P\'echoux},
BOOKTITLE = {FLOPS},
PAGES = {163--176},
PUBLISHER = {Springer},
SERIES = {Lecture Notes in Computer Science},
TITLE = {Resource Analysis by Sup-interpretation},
URL = {Articles/flops06.pdf},
VOLUME = 3945,
YEAR = 2006
}
@INPROCEEDINGS{BKMO06,
AUTHOR = {G. Bonfante and R. Kahle and J-Y Marion and I. Oitavem},
BOOKTITLE = {CSL},
DATE-MODIFIED = {2007-01-15 13:46:01 +0100},
EDITOR = {Springer},
PAGES = {212-224},
PUBLISHER = {Springer},
SERIES = {Lecture Notes in Computer Science},
TITLE = {Towards an implicit characterization of {NC}^k},
URL = {Articles/CSL06.pdf},
VOLUME = {4207},
YEAR = 2006
}
@INPROCEEDINGS{MFMNT06,
AUTHOR = {Pascal Fontaine and Jean-Yves Marion and Stephan Merz and Leonor Prensa Nieto and Alwen Tiu},
BOOKTITLE = {TACAS},
PAGES = {167--181},
PUBLSIHER = {Springer},
SERIES = {Lecture Notes in Computer Science},
TITLE = {Expressiveness + Automation + Soundness: Towards Combining SMT Solvers and Interactive Proof Assistants},
URL = {Articles/tacas06.pdf},
VOLUME = {3920},
YEAR = 2006
}
@PHDTHESIS{MarionHDR,
AUTHOR = {J.-Y. Marion},
SCHOOL = {Universit\'e {N}ancy 2},
TITLE = {Complexit\'{e} implicite des calculs, de la th{\'e}orie \`a la pratique},
TYPE = {Habilitation \`a diriger les recherches},
URL = {Articles/hdr.pdf},
YEAR = 2000
}
@PHDTHESIS{these,
AUTHOR = {J.-Y.~Marion},
MONTH = DEC,
NOTE = {140 pages},
SCHOOL = {Universit\'e Paris 7},
TITLE = {Extension du syst\`eme T de G\"odel dans les domaines finis, Etude de la complexit\'e},
YEAR = {1991}
}
@INPROCEEDINGS{JYMLFCS97,
AUTHOR = {J.-Y.~Marion},
BOOKTITLE = {4th International Symposium Logical, Foundations of Computer Science},
EDITOR = {S.~Adian A.~Nerode},
MONTH = {July},
PAGES = {237--247},
PUBLISHER = {Springer},
SERIES = {Lecture Notes in Computer Science},
TITLE = {Case study : Additive Linear Logic and Lattices},
URL = {Articles/lfcs97.ps},
VOLUME = 1234,
YEAR = 1997
}
@ARTICLE{JYM-Wollic96,
AUTHOR = {J.-Y.~Marion},
JOURNAL = {IGPL},
MONTH = {May},
NOTE = {Third Worshop on Logic, Language, Information and Computation. R.~de~Queiroz. {\tt http://www.mpi-sb.mpg.de/igpl/Bulletin/V4-3/}},
NUMBER = 3,
PAGES = {48--51},
TITLE = {Additive Linear Logic with Analytic Cut},
VOLUME = 4,
YEAR = {1996}
}
@INPROCEEDINGS{BMM01,
AUTHOR = {G.~Bonfante and J.-Y.~Marion and J.-Y.~Moyen},
BOOKTITLE = {Perspectives of System Informatics, 4th International Andrei Ershov Memorial Conference, PSI 2001, Novosibirsk, Russia},
EDITOR = {Dines Bj{\o}rner and Manfred Broy and Alexandre V. Zamulin},
MONTH = {Jul},
PAGE = {482-493},
PUBLISHER = {Springer},
SERIES = {Lecture Notes in Computer Science},
TITLE = {On lexicographic termination ordering with space bound certifications},
URL = {Articles/psi01.ps},
VOLUME = {2244},
YEAR = {2001}
}
@INPROCEEDINGS{BCMT98,
AUTHOR = {G.~Bonfante and A.~Cichon and J.-Y.~Marion and H.~Touzet},
BOOKTITLE = {Computer Science Logic, 12th International Workshop, CSL'98},
PAGES = {372--384},
PUBLISHER = {Springer},
SERIES = {Lecture Notes in Computer Science},
TITLE = {Complexity classes and rewrite systems with polynomial interpretation},
URL = {Articles/csl98.ps},
VOLUME = {1584},
YEAR = 1999
}
@ARTICLE{BCdNM06,
AUTHOR = {O. Bournez and F. Cucker and P.J. de Naurois and J.Y. Marion},
JOURNAL = {Information and Computation},
MONTH = {Feb},
NUMBER = 2,
PAGES = {210-230},
TITLE = {Implicit complexity over an arbitrary structure: Quantifier alternations},
URL = {Articles/ic06.pdf},
VOLUME = 204,
YEAR = 2006
}
@INPROCEEDINGS{BKM05,
AUTHOR = {Guillaume Bonfante and Matthieu Kaczmarek and Jean-Yves Marion},
BOOKTITLE = {ICTAC},
MONTH = {Oct},
PAGES = {579-593},
PUBLISHER = {Springer},
SERIES = {Lecture Notes in Computer Science},
TITLE = {Toward an abstract computer virology},
URL = {Articles/ictac05.pdf},
VOLUME = 3722,
YEAR = 2005
}
@TECHREPORT{BM05a,
AUTHOR = {J\'er\^ome Besombes and Jean-Yves Marion},
INSTITUTION = {loria},
NOTE = {submitted to Journal of Applied Logic},
TITLE = {Learning Discrete Categorial Grammars from Structures},
URL = {Articles/jal.pdf},
YEAR = 2005
}
@ARTICLE{BM06,
AUTHOR = {J\'er\^ome Besombes and Jean-Yves Marion},
JOURNAL = {Theoretical Computer Science},
TITLE = {Learning Tree Languages from Positive Examples and Membership Queries},
URL = {Articles/BesombesMarionQueriesTCS06.pdf},
YEAR = {2006}
}
@INPROCEEDINGS{BMM05a,
AUTHOR = {Guillaume Bonfante and Jean-Yves Marion and Jean-Yves Moyen},
BOOKTITLE = {Term Rewriting and Applications, 16th International Conference, RTA 2005, Nara, Japan, April 19-21, 2005, Proceedings},
EDITOR = {J{\"u}rgen Giesl},
PAGES = {150-164},
PUBLISHER = {Springer},
SERIES = {Lecture Notes in Computer Science},
TITLE = {Quasi-interpretations and Small Space Bounds.},
URL = {Articles/rta05.pdf},
VOLUME = {3467},
YEAR = {2005}
}
@ARTICLE{BMM05b,
AUTHOR = {Guillaume Bonfante and Jean-Yves Marion and Jean-Yves Moyen},
JOURNAL = {Theoretical Computer Science},
TITLE = {Quasi-interpretations, a way to control resources},
URL = {Articles/TCS.pdf},
YEAR = {(revision)}
}
@ARTICLE{BKM06,
AUTHOR = {Guillaume Bonfante and Matthieu Kaczmarek and Jean-Yves Marion},
JOURNAL = {Journal of computer virology},
NUMBER = {3-4},
TITLE = {On abstract computer virology: from a recursion-theoretic perspective},
URL = {Articles/jcv06.pdf},
VOLUME = 1,
YEAR = 2006
}
@ARTICLE{BCdNM05,
AUTHOR = {Olivier Bournez and Felipe Cucker and Paulin Jacob{\'e} de Naurois and Jean-Yves Marion},
JOURNAL = {Journal of Logic and Computation},
NUMBER = {1},
PAGES = {41-58},
TITLE = {Implicit Complexity over an Arbitrary Structure: Sequential and Parallel Polynomial Time.},
URL = {Articles/jlc05.pdf},
VOLUME = {15},
YEAR = {2005}
}
@ARTICLE{GM02,
AUTHOR = {Serge Grigorieff and Jean-Yves Marion},
JOURNAL = {Theor. Comput. Sci.},
NUMBER = {1-2},
PAGES = {151-180},
TITLE = {Kolmogorov complexity and non-determinism.},
URL = {Articles/tcs02.ps},
VOLUME = {271},
YEAR = {2002}
}
@ARTICLE{Marion03,
AUTHOR = {Jean-Yves Marion},
JOURNAL = {Information and Computation},
NUMBER = 1,
PAGES = {2-18},
TITLE = {Analysing the implicit complexity of programs},
URL = {Articles/ic03.ps},
VOLUME = 183,
YEAR = 2003
}
@INPROCEEDINGS{besombes01b,
AUTHOR = {J\'{e}r\^{o}me Besombes and Jean-Yves Marion},
BOOKTITLE = {3rd Learning Language in Logic (LLL) Workshop},
MONTH = {Sep},
ORGANIZATION = {L. Popelinsky, Matthieu Nepil},
TITLE = {Identification reversible dependency tree languages},
URL = {Articles/lll01.ps},
YEAR = {2001}
}
@ARTICLE{besombes03a,
AUTHOR = {J\'{e}r\^ome Besombes and Jean-Yves Marion},
JOURNAL = {Traitement automatique de langues},
MONTH = {Jul},
NUMBER = {1},
PAGES = {121-153},
TITLE = {Apprentissage des langages r\'{e}guliers d'arbres et applications},
URL = {Articles/tal03.ps},
VOLUME = {44},
YEAR = {2003}
}
@INPROCEEDINGS{besombesMarion03b,
AUTHOR = {J\'{e}r\^ome Besombes and Jean-Yves Marion},
BOOKTITLE = {Conf\'{e}rence d'Apprentissage - CAP'2003},
MONTH = {Jul},
PAGES = {107--122},
TITLE = {Apprentissage des langages r\'{e}guliers d'arbres \`{a} l'aide d'un expert},
URL = {Articles/cap03.pdf},
YEAR = {2003}
}
@INPROCEEDINGS{besombesMarion02,
AUTHOR = {J\'{e}r\^ome Besombes and Jean-Yves Marion},
BOOKTITLE = {Conf\'{e}rence d'Apprentissage - CAP'2002},
MONTH = {Jul},
PAGES = {55-70},
TITLE = {Apprentissage des langages r\'{e}guliers d'arbres et applications},
URL = {Articles/cap02.pdf},
YEAR = {2002}
}
@INPROCEEDINGS{besombesMarion04a,
AUTHOR = {J\'{e}r\^{o}me Besombes and Jean-Yves Marion},
BOOKTITLE = {Intelligent Information Processing and Web Mining, Proceedings of the International IIS\,: IIPWM{\~O}04},
EDITOR = {Mieczyslaw A. Klopotek and Slawomir T. Wierzchon and Krzsztof Trojanowski},
MONTH = {May},
PAGES = {181-190},
PUBLISHER = {Springer},
SERIES = {Advances in Soft Computing},
TITLE = {Learning reversible categorial grammars from structures},
URL = {Articles/iipwm04.pdf},
YEAR = {2004}
}
@INPROCEEDINGS{besombesMarion04b,
AUTHOR = {J\'{e}r\^{o}me Besombes and Jean-Yves Marion},
BOOKTITLE = {15th international conference on Algorithmic Learning Theory - ALT},
EDITOR = {Shai Ben-David and John Case and Akira Maruoka},
MONTH = {Oct},
PAGES = {440-453},
PUBLISHER = {Springer},
SERIES = {Lecture notes in Artificial Intelligence},
TITLE = {Learning Tree Languages from Positive Examples and Membership Queries},
URL = {Articles/alt04.pdf},
VOLUME = {3244},
YEAR = {2004}
}
@INPROCEEDINGS{besombesMarion04e,
AUTHOR = {J\'{e}r\^{o}me Besombes and Jean-Yves Marion},
BOOKTITLE = {Conf\'{e}rence Francophone d'Apprentissage - CAp'2004},
MONTH = {Jun},
PAGES = {315-330},
PUBLISHER = {Presse universitaire de Grenoble},
TITLE = {Apprentissage des grammaires cat\'{e}gorielles \`{a} partir de structures},
URL = {Articles/cap04.pdf},
YEAR = {2004}
}
@INPROCEEDINGS{marion01a,
AUTHOR = {Marion, Jean-Yves},
BOOKTITLE = {International Workshop on Computer Science Logic - CSL'2001},
EDITOR = {L. Fribourg},
MONTH = {Sep},
PAGES = {115--129},
PUBLISHER = {Springer},
SERIES = {Lecture notes in Computer Science},
TITLE = {Actual arithmetic and feasibility},
URL = {Articles/csl01.ps},
VOLUME = {2142},
YEAR = {2001}
}
@ARTICLE{marion04a,
AUTHOR = {Marion, Jean-Yves},
JOURNAL = {Theoretical Computer Science},
MONTH = {Jun},
NUMBER = {1-2},
PAGES = {1},
TITLE = {Editorial \,: Implicit Computational Complexity ({ICC})},
VOLUME = {318},
YEAR = {2004}
}
@INPROCEEDINGS{BCdNM04,
AUTHOR = {Olivier Bournez and Felipe Cucker and Paulin Jacob{\'e} de Naurois and Jean-Yves Marion},
BOOKTITLE = {IFIP TCS},
PAGES = {409-422},
PUBLISHER = {Kluwer},
TITLE = {Tailoring Recursion to Characterize Non-Deterministic Complexity Classes over Arbitrary Structures.},
URL = {Articles/ifipTCS04.pdf},
YEAR = {2004}
}
@ARTICLE{BCdNM03,
AUTHOR = {Olivier Bournez and Felipe Cucker and Paulin Jacob{\'e} de Naurois and Jean-Yves Marion},
JOURNAL = {Electronic Notes in Theoretical Computer Science},
NUMBER = {1},
TITLE = {Safe Recursion Over an Arbitrary Structure: PAR, PH and DPH.},
URL = {Articles/entcsICC03.pdf},
VOLUME = {90},
YEAR = {2003}
}
This file has been generated by bibtex2html 1.80