The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Giacomo Lenzi: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Dietmar Berwanger, Erich Grädel, Giacomo Lenzi
    On the Variable Hierarchy of the Modal µ-Calculus. [Citation Graph (0, 0)][DBLP]
    CSL, 2002, pp:352-366 [Conf]
  2. Giacomo Lenzi
    A Hierarchy Theorem for the µ-Calculus. [Citation Graph (0, 0)][DBLP]
    ICALP, 1996, pp:87-97 [Conf]
  3. André Arnold, Giacomo Lenzi, Jerzy Marcinkowski
    The Hierarchy inside Closed Monadic Sigma1 Collapses on the Infinite Binary Tree. [Citation Graph (0, 0)][DBLP]
    LICS, 2001, pp:157-166 [Conf]
  4. David Janin, Giacomo Lenzi
    Relating Levels of the Mu-Calculus Hierarchy and Levels of the Monadic Hierarchy. [Citation Graph (0, 0)][DBLP]
    LICS, 2001, pp:347-356 [Conf]
  5. David Janin, Giacomo Lenzi
    On the Structure of the Monadic Logic of the Binary Tree. [Citation Graph (0, 0)][DBLP]
    MFCS, 1999, pp:310-320 [Conf]
  6. Dietmar Berwanger, Giacomo Lenzi
    The Variable Hierarchy of the µ-Calculus Is Strict. [Citation Graph (0, 0)][DBLP]
    STACS, 2005, pp:97-109 [Conf]
  7. Giacomo Lenzi
    A New Logical Characterization of Büchi Automata. [Citation Graph (0, 0)][DBLP]
    STACS, 2001, pp:467-477 [Conf]
  8. David Janin, Giacomo Lenzi
    On the Logical Definability of Topologically Closed Recognizable Languages of Infinite Trees. [Citation Graph (0, 0)][DBLP]
    Computers and Artificial Intelligence, 2002, v:21, n:3, pp:- [Journal]
  9. Giacomo Lenzi
    Monadic Second Order Logic And Its Fragments. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 2001, v:51, n:, pp:- [Journal]
  10. Giacomo Lenzi
    About a Positive Set Theory With Equality. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 2007, v:169, n:, pp:111-120 [Journal]
  11. David Janin, Giacomo Lenzi
    On the Rlationship Between Monadic and Weak Monadic Second Order Logic on Arbitrary Trees, with Applications to the mu-Calculus. [Citation Graph (0, 0)][DBLP]
    Fundam. Inform., 2004, v:61, n:3-4, pp:247-265 [Journal]
  12. Giacomo Lenzi, Erich Monteleone
    On Fixpoint Arithmetic and Infinite Time Turing Machines. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2004, v:91, n:3, pp:121-128 [Journal]
  13. Giovanna D'Agostino, Giacomo Lenzi
    On modal mu-calculus with explicit interpolants. [Citation Graph (0, 0)][DBLP]
    J. Applied Logic, 2006, v:4, n:3, pp:256-278 [Journal]
  14. Giacomo Lenzi
    Mu-depth 3 is more than 2: a game-theoretic proof. [Citation Graph (0, 0)][DBLP]
    Mathematical Structures in Computer Science, 2001, v:11, n:2, pp:273-297 [Journal]
  15. Giovanna D'Agostino, Giacomo Lenzi
    An axiomatization of bisimulation quantifiers via the mu-calculus. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2005, v:338, n:1-3, pp:64-95 [Journal]
  16. Dietmar Berwanger, Erich Grädel, Giacomo Lenzi
    The Variable Hierarchy of the µ-Calculus Is Strict. [Citation Graph (0, 0)][DBLP]
    Theory Comput. Syst., 2007, v:40, n:4, pp:437-466 [Journal]

  17. On Modal μ-Calculus over Finite Graphs with Bounded Strongly Connected Components [Citation Graph (, )][DBLP]


Search in 0.004secs, Finished in 0.005secs
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