The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Jean-Yves Marion: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Daniel Leivant, Jean-Yves Marion
    Lambda Calculus Characterizations of Poly-Time. [Citation Graph (2, 0)][DBLP]
    Fundam. Inform., 1993, v:19, n:1/2, pp:167-184 [Journal]
  2. Jérôme Besombes, Jean-Yves Marion
    Learning Tree Languages from Positive Examples and Membership Queries. [Citation Graph (0, 0)][DBLP]
    ALT, 2004, pp:440-453 [Conf]
  3. Guillaume Bonfante, Adam Cichon, Jean-Yves Marion, Hélène Touzet
    Complexity Classes and Rewrite Systems with Polynomial Interpretation. [Citation Graph (0, 0)][DBLP]
    CSL, 1998, pp:372-384 [Conf]
  4. Guillaume Bonfante, R. Kahle, Jean-Yves Marion, Isabel Oitavem
    Towards an Implicit Characterization of NCk. [Citation Graph (0, 0)][DBLP]
    CSL, 2006, pp:212-224 [Conf]
  5. Jean-Yves Marion
    Actual Arithmetic and Feasibility. [Citation Graph (0, 0)][DBLP]
    CSL, 2001, pp:115-129 [Conf]
  6. Daniel Leivant, Jean-Yves Marion
    Ramified Recurrence and Computational Complexity II: Substitution and Poly-Space. [Citation Graph (0, 0)][DBLP]
    CSL, 1994, pp:486-500 [Conf]
  7. Guillaume Bonfante, Jean-Yves Marion, Jean-Yves Moyen
    On Lexicographic Termination Ordering with Space Bound Certifications. [Citation Graph (0, 0)][DBLP]
    Ershov Memorial Conference, 2001, pp:482-493 [Conf]
  8. Jean-Yves Marion, Romain Péchoux
    Resource Analysis by Sup-interpretation. [Citation Graph (0, 0)][DBLP]
    FLOPS, 2006, pp:163-176 [Conf]
  9. Olivier Bournez, Felipe Cucker, Paulin Jacobé de Naurois, Jean-Yves Marion
    Computability over an Arbitrary Structure. Sequential and Parallel Polynomial Time. [Citation Graph (0, 0)][DBLP]
    FoSSaCS, 2003, pp:185-199 [Conf]
  10. Guillaume Bonfante, Matthieu Kaczmarek, Jean-Yves Marion
    Toward an Abstract Computer Virology. [Citation Graph (0, 0)][DBLP]
    ICTAC, 2005, pp:579-593 [Conf]
  11. Olivier Bournez, Felipe Cucker, Paulin Jacobé de Naurois, Jean-Yves Marion
    Tailoring Recursion to Characterize Non-Deterministic Complexity Classes over Arbitrary Structures. [Citation Graph (0, 0)][DBLP]
    IFIP TCS, 2004, pp:409-422 [Conf]
  12. Jérôme Besombes, Jean-Yves Marion
    Learning reversible categorial grammars from structures. [Citation Graph (0, 0)][DBLP]
    Intelligent Information Systems, 2004, pp:181-190 [Conf]
  13. Jean-Yves Marion
    Case Study: Additive Linear Logic and Lattices. [Citation Graph (0, 0)][DBLP]
    LFCS, 1997, pp:237-247 [Conf]
  14. Guillaume Bonfante, Jean-Yves Marion, Romain Péchoux
    A Characterization of Alternating Log Time by First Order Functional Programs. [Citation Graph (0, 0)][DBLP]
    LPAR, 2006, pp:90-104 [Conf]
  15. Jean-Yves Marion, Jean-Yves Moyen
    Efficient First Order Functional Program Interpreter with Time Bound Certifications. [Citation Graph (0, 0)][DBLP]
    LPAR, 2000, pp:25-42 [Conf]
  16. Guillaume Bonfante, Jean-Yves Marion, Jean-Yves Moyen
    Quasi-interpretations and Small Space Bounds. [Citation Graph (0, 0)][DBLP]
    RTA, 2005, pp:150-164 [Conf]
  17. Pascal Fontaine, Jean-Yves Marion, Stephan Merz, Leonor Prensa Nieto, Alwen Fernanto Tiu
    Expressiveness + Automation + Soundness: Towards Combining SMT Solvers and Interactive Proof Assistants. [Citation Graph (0, 0)][DBLP]
    TACAS, 2006, pp:167-181 [Conf]
  18. Daniel Leivant, Jean-Yves Marion
    Predicative Functional Recurrence and Poly-space. [Citation Graph (0, 0)][DBLP]
    TAPSOFT, 1997, pp:369-380 [Conf]
  19. Daniel Leivant, Jean-Yves Marion
    Lambda calculus characterizations of poly-time. [Citation Graph (0, 0)][DBLP]
    TLCA, 1993, pp:274-288 [Conf]
  20. E. A. Cichon, Jean-Yves Marion
    The Light Lexicographic path Ordering [Citation Graph (0, 0)][DBLP]
    CoRR, 2000, v:0, n:, pp:- [Journal]
  21. Olivier Bournez, Felipe Cucker, Paulin Jacobé de Naurois, Jean-Yves Marion
    Safe Recursion Over an Arbitrary Structure: PAR, PH and DPH. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 2003, v:90, n:1, pp:- [Journal]
  22. Jean-Yves Marion
    Analysing the implicit complexity of programs. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 2003, v:183, n:1, pp:2-18 [Journal]
  23. Olivier Bournez, Felipe Cucker, Paulin Jacobé de Naurois, Jean-Yves Marion
    Implicit complexity over an arbitrary structure: Quantifier alternations. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 2006, v:204, n:2, pp:210-230 [Journal]
  24. Guillaume Bonfante, Adam Cichon, Jean-Yves Marion, Hélène Touzet
    Algorithms with polynomial interpretation termination proof. [Citation Graph (0, 0)][DBLP]
    J. Funct. Program., 2001, v:11, n:1, pp:33-53 [Journal]
  25. Olivier Bournez, Felipe Cucker, Paulin Jacobé de Naurois, Jean-Yves Marion
    Implicit Complexity over an Arbitrary Structure: Sequential and Parallel Polynomial Time. [Citation Graph (0, 0)][DBLP]
    J. Log. Comput., 2005, v:15, n:1, pp:41-58 [Journal]
  26. Serge Grigorieff, Jean-Yves Marion
    Kolmogorov complexity and non-determinism. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2002, v:271, n:1-2, pp:151-180 [Journal]
  27. Daniel Leivant, Jean-Yves Marion
    A characterization of alternating log time by ramified recurrence. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2000, v:236, n:1-2, pp:193-208 [Journal]
  28. Jean-Yves Marion
    Editorial: Implicit Computational Complexity. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2004, v:318, n:1-2, pp:1- [Journal]
  29. Jean-Yves Marion
    From Multiple Sequent for Additive Linear Logic to Decision Procedures for Free Lattices. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1999, v:224, n:1-2, pp:157-172 [Journal]
  30. Guillaume Bonfante, Matthieu Kaczmarek, Jean-Yves Marion
    On Abstract Computer Virology from a Recursion Theoretic Perspective. [Citation Graph (0, 0)][DBLP]
    Journal in Computer Virology, 2006, v:1, n:3-4, pp:45-54 [Journal]
  31. Guillaume Bonfante, Matthieu Kaczmarek, Jean-Yves Marion
    A Classification of Viruses Through Recursion Theorems. [Citation Graph (0, 0)][DBLP]
    CiE, 2007, pp:73-82 [Conf]
  32. Guillaume Bonfante, Jean-Yves Marion, Romain Péchoux
    Quasi-interpretation Synthesis by Decomposition. [Citation Graph (0, 0)][DBLP]
    ICTAC, 2007, pp:410-424 [Conf]
  33. Jean-Yves Marion
    Predicative Analysis of Feasibility and Diagonalization. [Citation Graph (0, 0)][DBLP]
    TLCA, 2007, pp:290-304 [Conf]
  34. Jean-Yves Marion, Romain Péchoux
    Resource control of object-oriented programs [Citation Graph (0, 0)][DBLP]
    CoRR, 2007, v:0, n:, pp:- [Journal]
  35. Jean-Yves Marion, Romain Péchoux
    Quasi-friendly sup-interpretations [Citation Graph (0, 0)][DBLP]
    CoRR, 2006, v:0, n:, pp:- [Journal]
  36. Jérôme Besombes, Jean-Yves Marion
    Learning tree languages from positive examples and membership queries. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2007, v:382, n:3, pp:183-197 [Journal]
  37. Guillaume Bonfante, Jean-Yves Marion
    Foreword. [Citation Graph (0, 0)][DBLP]
    Journal in Computer Virology, 2007, v:3, n:1, pp:1-2 [Journal]

  38. Computers under Attacks! [Citation Graph (, )][DBLP]


  39. Recursion Schemata for NCk. [Citation Graph (, )][DBLP]


  40. Analyzing the Implicit Computational Complexity of object-oriented programs. [Citation Graph (, )][DBLP]


  41. A logical account of pspace. [Citation Graph (, )][DBLP]


  42. Characterizations of polynomial complexity classes with a better intensionality. [Citation Graph (, )][DBLP]


  43. A Computability Perspective on Self-Modifying Programs. [Citation Graph (, )][DBLP]


  44. Table of Contents - 27th International Symposium on Theoretical Aspects of Computer Science. [Citation Graph (, )][DBLP]


  45. Preface - 26th International Symposium on Theoretical Aspects of Computer Science. [Citation Graph (, )][DBLP]


  46. Foreword -- 27th International Symposium on Theoretical Aspects of Computer Science. [Citation Graph (, )][DBLP]


  47. A Characterization of NCk. [Citation Graph (, )][DBLP]


  48. On the defence notion [Citation Graph (, )][DBLP]


  49. On tiered small jump operators [Citation Graph (, )][DBLP]


  50. An Implicit Characterization of PSPACE [Citation Graph (, )][DBLP]


  51. Soft Linear Logic and Polynomial Complexity Classes. [Citation Graph (, )][DBLP]


Search in 0.006secs, Finished in 0.007secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002