No. Title Author Year
1 Computing Haar Measures Pauly, Arno et al. 2020
2 Measuring the Complexity of Computational Content: From Combinatorial Problems to Analysis (Dagstuhl Seminar 18361) Brattka, Vasco et al. 2019
3 Beyond Admissibility: Dominance Between Chains of Strategies Basset, Nicolas et al. 2018
4 Extending Finite-Memory Determinacy by Boolean Combination of Winning Conditions Le Roux, St├ęphane et al. 2018
5 Admissibility in Games with Imperfect Information (Invited Talk) Brenguier, Romain et al. 2017
6 Minkowski Games Le Roux, St├ęphane et al. 2017
7 Noetherian Quasi-Polish spaces de Brecht, Matthew et al. 2017
8 Dividing by Zero - How Bad Is It, Really? Kihara, Takayuki et al. 2016
9 Measuring the Complexity of Computational Content (Dagstuhl Seminar 15392) Brattka, Vasco et al. 2016
10 How Discontinuous is Computing Nash Equilibria? (Extended Abstract) Pauly, Arno 2009
Current Page :
Number of result pages: 1
Number of documents: 10


DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI