The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Guillaume Bonfante: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Guillaume Bonfante
    Some Programming Languages for Logspace and Ptime. [Citation Graph (0, 0)][DBLP]
    AMAST, 2006, pp:66-80 [Conf]
  2. 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]
  3. 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]
  4. 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]
  5. Guillaume Bonfante, Matthieu Kaczmarek, Jean-Yves Marion
    Toward an Abstract Computer Virology. [Citation Graph (0, 0)][DBLP]
    ICTAC, 2005, pp:579-593 [Conf]
  6. 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]
  7. 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]
  8. Guillaume Bonfante, Joseph Le Roux, Guy Perrier
    Lexical Disambiguation with Polarities and Automata. [Citation Graph (0, 0)][DBLP]
    CIAA, 2006, pp:283-284 [Conf]
  9. Guillaume Bonfante, Philippe de Groote
    Stochastic Lambek Categorial Grammars. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 2001, v:53, n:, pp:- [Journal]
  10. 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]
  11. 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]
  12. 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]
  13. Guillaume Bonfante, Jean-Yves Marion, Romain Péchoux
    Quasi-interpretation Synthesis by Decomposition. [Citation Graph (0, 0)][DBLP]
    ICTAC, 2007, pp:410-424 [Conf]
  14. Guillaume Bonfante, Yves Guiraud
    Programs as polygraphs: computability and complexity [Citation Graph (0, 0)][DBLP]
    CoRR, 2007, v:0, n:, pp:- [Journal]
  15. Guillaume Bonfante, Yves Guiraud
    Intensional properties of polygraphs [Citation Graph (0, 0)][DBLP]
    CoRR, 2007, v:0, n:, pp:- [Journal]
  16. Guillaume Bonfante, Jean-Yves Marion
    Foreword. [Citation Graph (0, 0)][DBLP]
    Journal in Computer Virology, 2007, v:3, n:1, pp:1-2 [Journal]

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


  18. Dependency Constraints for Lexical Disambiguation. [Citation Graph (, )][DBLP]


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


  20. Complexity Invariance of Real Interpretations. [Citation Graph (, )][DBLP]


  21. Observation of implicit complexity by non confluence [Citation Graph (, )][DBLP]


  22. Intensional Properties of Polygraphs. [Citation Graph (, )][DBLP]


Search in 0.002secs, Finished in 0.003secs
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