default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDavid Janin
Person information
- affiliation: Université de Bordeaux, France
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
2010 – 2019
- 2019
[c31]David Janin:
Screaming in the IO monad: a realtime audio processing and control experiment in Haskell. FARM@ICFP 2019: 71-82- 2018
- [c30]David Janin:
Spatio-Temporal Domains: An Overview. ICTAC 2018: 231-251 - 2017
- [c29]Simon Archipoff, David Janin:
Unified media programming: an algebraic approach. FARM@ICFP 2017: 36-47 - 2016
- [c28]Simon Archipoff, David Janin:
Structured reactive programming with polymorphic temporal tiles. FARM@ICFP 2016: 29-40 - [c27]Michael Sperber, David Janin:
FARM 2016 demo summary. FARM@ICFP 2016: 60 - [c26]David Janin:
Walking Automata in Free Inverse Monoids. SOFSEM 2016: 314-328 - [e2]David Janin, Michael Sperber:
Proceedings of the 4th International Workshop on Functional Art, Music, Modelling, and Design, FARM@ICFP 2016, Nara, Japan, September 24, 2016. ACM 2016, ISBN 978-1-4503-4432-6 [contents] - 2015
- [j8]Anne Dicky, David Janin:
Two-way Automata and Regular Languages of Overlapping Tiles. Fundam. Informaticae 141(4): 311-343 (2015) - [j7]David Janin:
On labeled birooted tree languages: Algebras, automata and logic. Inf. Comput. 243: 222-248 (2015) - [c25]David Janin:
Inverse Monoids of Higher-Dimensional Strings. ICTAC 2015: 126-143 - [e1]Henrik Nilsson, David Janin:
Proceedings of the 3rd ACM SIGPLAN International Workshop on Functional Art, Music, Modelling and Design, FARM@ICFP 2015, Vancouver, BC, Canada, September 5, 2015. ACM 2015, ISBN 978-1-4503-3806-6 [contents] - 2014
- [c24]Anne Dicky, David Janin:
Embedding Finite and Infinite Words into Overlapping Tiles - (Short Paper). Developments in Language Theory 2014: 339-347 - [c23]Paul Hudak, David Janin:
Tiled polymorphic temporal media. FARM@ICFP 2014: 49-60 - [c22]Etienne Dubourg, David Janin:
Algebraic Tools for the Overlapping Tile Product. LATA 2014: 335-346 - [c21]David Janin:
Towards a Higher-Dimensional String Theory for the Modeling of Computerized Systems. SOFSEM 2014: 7-20 - 2013
- [j6]Julien Bernet, David Janin:
Une étude des jeux distribués. Tech. Sci. Informatiques 32(9-10): 1007-1041 (2013) - [c20]David Janin:
Overlapping Tile Automata. CSR 2013: 431-443 - [c19]David Janin:
Algebras, Automata and Logic for Languages of Labeled Birooted Trees. ICALP (2) 2013: 312-323 - [c18]David Janin, Florent Berthaut
, Myriam Desainte-Catherine, Yann Orlarey, Sylvain Salvati:
The T-calculus: towards a structured programing of (musical) time and space. FARM@ICFP 2013: 23-34 - [c17]David Janin:
On Languages of One-Dimensional Overlapping Tiles. SOFSEM 2013: 244-256 - 2012
- [j5]Florent Berthaut, David Janin, Benjamin Martin:
Advanced Synchronization of Audio or Symbolic Musical Patterns: an Algebraic Approach. Int. J. Semantic Comput. 6(4): 409-428 (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
2000 – 2009
- 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
- [b1]David Janin:
A contribution to formal methods : games, logic and automata. (Contribution aux fondements des méthodes formelles : jeux, logique et automates). University of Bordeaux, France, 2005 - [c10]Julien Bernet, David Janin:
Tree Automata and Discrete Distributed Games. FCT 2005: 540-551 - 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. Informaticae 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. Comput. Artif. Intell. 21(3): 185-203 (2002) - [j1]Julien Bernet, David Janin, Igor Walukiewicz:
Permissive strategies: from parity games to safety games. RAIRO Theor. Informatics Appl. 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
1990 – 1999
- 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
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-05-02 21:47 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
