| No. |
Title |
Author |
Year |
| 1 |
Descriptive Set Theory and Computable Topology (Dagstuhl Seminar 21461) |
Hoyrup, Mathieu et al. |
2022 |
| 2 |
Computing Measure as a Primitive Operation in Real Number Computation |
Gaßner, Christine et al. |
2021 |
| 3 |
Computing Haar Measures |
Pauly, Arno et al. |
2020 |
| 4 |
Measuring the Complexity of Computational Content: From Combinatorial Problems to Analysis (Dagstuhl Seminar 18361) |
Brattka, Vasco et al. |
2019 |
| 5 |
Beyond Admissibility: Dominance Between Chains of Strategies |
Basset, Nicolas et al. |
2018 |
| 6 |
Extending Finite-Memory Determinacy by Boolean Combination of Winning Conditions |
Le Roux, Stéphane et al. |
2018 |
| 7 |
Admissibility in Games with Imperfect Information (Invited Talk) |
Brenguier, Romain et al. |
2017 |
| 8 |
Minkowski Games |
Le Roux, Stéphane et al. |
2017 |
| 9 |
Noetherian Quasi-Polish spaces |
de Brecht, Matthew et al. |
2017 |
| 10 |
Dividing by Zero - How Bad Is It, Really? |
Kihara, Takayuki et al. |
2016 |
| 11 |
Measuring the Complexity of Computational Content (Dagstuhl Seminar 15392) |
Brattka, Vasco et al. |
2016 |
| 12 |
How Discontinuous is Computing Nash Equilibria? (Extended Abstract) |
Pauly, Arno |
2009 |
