| 2020 | PADL | A Timed IO Monad. | David Janin |
| 2019 | ICFP | Screaming in the IO monad: a realtime audio processing and control experiment in Haskell. | David Janin |
| 2018 | ICTAC | Spatio-Temporal Domains: An Overview. | David Janin |
| 2017 | ICFP | Unified media programming: an algebraic approach. | Simon Archipoff, David Janin |
| 2016 | ICFP | Structured reactive programming with polymorphic temporal tiles. | Simon Archipoff, David Janin |
| 2016 | ICFP | FARM 2016 demo summary. | Michael Sperber, David Janin |
| 2016 | SOFSEM | Walking Automata in Free Inverse Monoids. | David Janin |
| 2015 | ICTAC | Inverse Monoids of Higher-Dimensional Strings. | David Janin |
| 2014 | DLT | Embedding Finite and Infinite Words into Overlapping Tiles - (Short Paper). | Anne Dicky, David Janin |
| 2014 | ICFP | Tiled polymorphic temporal media. | Paul Hudak, David Janin |
| 2014 | LATA | Algebraic Tools for the Overlapping Tile Product. | Etienne Dubourg, David Janin |
| 2014 | SOFSEM | Towards a Higher-Dimensional String Theory for the Modeling of Computerized Systems. | David Janin |
| 2013 | CSR | Overlapping Tile Automata. | David Janin |
| 2013 | ICALP | Algebras, Automata and Logic for Languages of Labeled Birooted Trees. | David Janin |
| 2013 | ICFP | The T-calculus: towards a structured programing of (musical) time and space. | David Janin, Florent Berthaut, Myriam Desainte-Catherine, Yann Orlarey, Sylvain Salvati |
| 2013 | SOFSEM | On Languages of One-Dimensional Overlapping Tiles. | David Janin |
| 2012 | MFCS | Quasi-recognizable vs MSO Definable Languages of One-Dimensional Overlapping Tiles - (Extended Abstract). | David Janin |
| 2008 | SOFSEM | From Asynchronous to Synchronous Specifications for Distributed Program Synthesis. | Julien Bernet, David Janin |
| 2007 | SOFSEM | On the (High) Undecidability of Distributed Synthesis Problems. | David Janin |
| 2006 | FORTE | On Distributed Program Specification and Synthesis in Architectures with Cycles. | Julien Bernet, David Janin |
| 2005 | FCT | Tree Automata and Discrete Distributed Games. | Julien Bernet, David Janin |
| 2001 | LICS | Relating Levels of the Mu-Calculus Hierarchy and Levels of the Monadic Hierarchy. | David Janin, Giacomo Lenzi |
| 2001 | STACS | A Toolkit for First Order Extensions of Monadic Games. | David Janin, Jerzy Marcinkowski |
| 1999 | MFCS | On the Structure of the Monadic Logic of the Binary Tree. | David Janin, Giacomo Lenzi |
| 1997 | LICS | Automata, Tableaus and a Reduction Theorem for Fixpoint Calculi in Arbitrary Complete Lattices. | David Janin |
| 1996 | CONCUR | On the Expressive Completeness of the Propositional mu-Calculus with Respect to Monadic Second Order Logic. | David Janin, Igor Walukiewicz |
| 1995 | MFCS | Automata for the Modal mu-Calculus and related Results. | David Janin, Igor Walukiewicz |