The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

David Janin: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. David Janin, Igor Walukiewicz
    On the Expressive Completeness of the Propositional mu-Calculus with Respect to Monadic Second Order Logic. [Citation Graph (0, 0)][DBLP]
    CONCUR, 1996, pp:263-277 [Conf]
  2. Julien Bernet, David Janin
    Tree Automata and Discrete Distributed Games. [Citation Graph (0, 0)][DBLP]
    FCT, 2005, pp:540-551 [Conf]
  3. Julien Bernet, David Janin
    On Distributed Program Specification and Synthesis in Architectures with Cycles. [Citation Graph (0, 0)][DBLP]
    FORTE, 2006, pp:175-190 [Conf]
  4. Anuj Dawar, David Janin
    On the Bisimulation Invariant Fragment of Monadic S1 in the Finite. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 2004, pp:224-236 [Conf]
  5. David Janin
    Some Results About Logical Descriptions of Non-Deterministic Behaviours. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1993, pp:338-347 [Conf]
  6. Dietmar Berwanger, David Janin
    Automata on Directed Graphs: Edge Versus Vertex Marking. [Citation Graph (0, 0)][DBLP]
    ICGT, 2006, pp:46-60 [Conf]
  7. Bruno Courcelle, David Janin
    Workshop on Logic, Graph Transformations, Finite and Infinite Structures. [Citation Graph (0, 0)][DBLP]
    ICGT, 2004, pp:448-450 [Conf]
  8. David Janin
    Automata, Tableaus and a Reduction Theorem for Fixpoint Calculi in Arbitrary Complete Lattices. [Citation Graph (0, 0)][DBLP]
    LICS, 1997, pp:172-182 [Conf]
  9. 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]
  10. 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]
  11. David Janin, Igor Walukiewicz
    Automata for the Modal mu-Calculus and related Results. [Citation Graph (0, 0)][DBLP]
    MFCS, 1995, pp:552-562 [Conf]
  12. David Janin, Jerzy Marcinkowski
    A Toolkit for First Order Extensions of Monadic Games. [Citation Graph (0, 0)][DBLP]
    STACS, 2001, pp:353-364 [Conf]
  13. 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]
  14. 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]
  15. Julien Bernet, David Janin, Igor Walukiewicz
    Permissive strategies: from parity games to safety games. [Citation Graph (0, 0)][DBLP]
    ITA, 2002, v:36, n:3, pp:261-275 [Journal]
  16. David Janin
    On the (High) Undecidability of Distributed Synthesis Problems. [Citation Graph (0, 0)][DBLP]
    SOFSEM (1), 2007, pp:320-329 [Conf]
  17. Anuj Dawar, David Janin
    The monadic theory of finite representations of infinite words. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2007, v:103, n:3, pp:94-101 [Journal]

  18. From Asynchronous to Synchronous Specifications for Distributed Program Synthesis. [Citation Graph (, )][DBLP]


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