- CSB - MetaPress - Google - Bing - Yahoo
 | 2013 | |
|---|---|---|
| c17 |      | |
| 2012 | ||
| c16 | | David Janin: Quasi-recognizable vs MSO Definable Languages of One-Dimensional Overlapping Tiles - (Extended Abstract). MFCS 2012: 516-528 |
| c15 | | Florent Berthaut, David Janin, Benjamin Martin: Advanced Synchronization of Audio or Symbolic Musical Patterns: An Algebraic Approach. ICSC 2012: 302-309 |
| 2008 | ||
| c14 | | Julien Bernet, David Janin: From Asynchronous to Synchronous Specifications for Distributed Program Synthesis. SOFSEM 2008: 162-173 |
| 2007 | ||
| j4 | | Anuj Dawar, David Janin: The monadic theory of finite representations of infinite words. Inf. Process. Lett. 103(3): 94-101 (2007) |
| c13 | | David Janin: On the (High) Undecidability of Distributed Synthesis Problems. SOFSEM (1) 2007: 320-329 |
| 2006 | ||
| c12 | | Julien Bernet, David Janin: On Distributed Program Specification and Synthesis in Architectures with Cycles. FORTE 2006: 175-190 |
| c11 | | Dietmar Berwanger, David Janin: Automata on Directed Graphs: Edge Versus Vertex Marking. ICGT 2006: 46-60 |
| 2005 | ||
| c10 | | |
| 2004 | ||
| j3 | | David Janin, Giacomo Lenzi: On the Rlationship Between Monadic and Weak Monadic Second Order Logic on Arbitrary Trees, with Applications to the mu-Calculus. Fundam. Inform. 61(3-4): 247-265 (2004) |
| c9 | | Anuj Dawar, David Janin: On the Bisimulation Invariant Fragment of Monadic S1 in the Finite. FSTTCS 2004: 224-236 |
| c8 | | Bruno Courcelle, David Janin: Workshop on Logic, Graph Transformations, Finite and Infinite Structures. ICGT 2004: 448-450 |
| 2002 | ||
| j2 |  | David Janin, Giacomo Lenzi: On the Logical Definability of Topologically Closed Recognizable Languages of Infinite Trees. Computers and Artificial Intelligence 21(3) (2002) |
| j1 | | Julien Bernet, David Janin, Igor Walukiewicz: Permissive strategies: from parity games to safety games. ITA 36(3): 261-275 (2002) |
| 2001 | ||
| c7 | | David Janin, Giacomo Lenzi: Relating Levels of the Mu-Calculus Hierarchy and Levels of the Monadic Hierarchy. LICS 2001: 347-356 |
| c6 | | David Janin, Jerzy Marcinkowski: A Toolkit for First Order Extensions of Monadic Games. STACS 2001: 353-364 |
| 1999 | ||
| c5 | | David Janin, Giacomo Lenzi: On the Structure of the Monadic Logic of the Binary Tree. MFCS 1999: 310-320 |
| 1997 | ||
| c4 | | David Janin: Automata, Tableaus and a Reduction Theorem for Fixpoint Calculi in Arbitrary Complete Lattices. LICS 1997: 172-182 |
| 1996 | ||
| c3 | | David Janin, Igor Walukiewicz: On the Expressive Completeness of the Propositional mu-Calculus with Respect to Monadic Second Order Logic. CONCUR 1996: 263-277 |
| 1995 | ||
| c2 | | David Janin, Igor Walukiewicz: Automata for the Modal mu-Calculus and related Results. MFCS 1995: 552-562 |
| 1993 | ||
| c1 | | David Janin: Some Results About Logical Descriptions of Non-Deterministic Behaviours. FSTTCS 1993: 338-347 |
| 1 | Julien Bernet | |
| 2 | Florent Berthaut | |
| 3 | Dietmar Berwanger | |
| 4 | Bruno Courcelle | |
| 5 | Anuj Dawar | |
| 6 | Giacomo Lenzi | |
| 7 | Jerzy Marcinkowski | |
| 8 | Benjamin Martin | |
| 9 | Igor Walukiewicz |
Colors in the list of coauthors
Last update Tue May 21 12:28:47 2013 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page