| No. |
Title |
Author |
Year |
| 1 |
Descriptive Set Theory and Computable Topology (Dagstuhl Seminar 21461) |
Hoyrup, Mathieu et al. |
2022 |
| 2 |
Duality in Computer Science (Dagstuhl Seminar 15441) |
Gehrke, Mai et al. |
2016 |
| 3 |
Well Quasi-Orders in Computer Science (Dagstuhl Seminar 16031) |
Goubault-Larrecq, Jean et al. |
2016 |
| 4 |
Duality in Computer Science (Dagstuhl Seminar 13311) |
Gehrke, Mai et al. |
2013 |
| 5 |
Computing with Infinite Data: Topological and Logical Foundations (Dagstuhl Seminar 11411) |
Berger, Ulrich et al. |
2012 |
| 6 |
10501 Abstracts Collection -- Advances and Applications of Automata on Words and Trees |
Glasser, Christian et al. |
2011 |
| 7 |
10501 Executive Summary -- Advances and Applications of Automata on Words and Trees |
Glasser, Christian et al. |
2011 |
| 8 |
08271 Abstracts Collection -- Topological and Game-Theoretic Aspects of Infinite Computations |
Hertling, Peter et al. |
2008 |
| 9 |
08271 Executive Summary -- Topological and Game-Theoretic Aspects of Infinite Computations |
Hertling, Peter et al. |
2008 |
| 10 |
Efficient Algorithms for Membership in Boolean Hierarchies of Regular Languages |
Glasser, Christian et al. |
2008 |
