No. Title Author Year
1 How to Play Optimally for Regular Objectives? Bouyer, Patricia et al. 2023
2 Optimal Transformations of Games and Automata Using Muller Conditions Casares, Antonio et al. 2021
3 Statistical Comparison of Algorithm Performance Through Instance Selection Matricon, Théo et al. 2021
4 A Robust Class of Linear Recurrence Sequences Barloy, Corentin et al. 2020
5 Lower Bounds for Arithmetic Circuits via the Hankel Matrix Fijalkow, Nathanaël et al. 2020
6 Value Iteration Using Universal Graphs and the Complexity of Mean Payoff Games Fijalkow, Nathanaël et al. 2020
7 Quantifying Bounds in Strategy Logic Fijalkow, Nathanaël et al. 2018
8 Expressiveness of Probabilistic Modal Logics, Revisited Fijalkow, Nathanaël et al. 2017
9 Probabilistic Automata of Bounded Ambiguity Fijalkow, Nathanaël et al. 2017
10 Semialgebraic Invariant Synthesis for the Kannan-Lipton Orbit Problem Fijalkow, Nathanaël et al. 2017
11 Characterisation of an Algebraic Algorithm for Probabilistic Automata Fijalkow, Nathanaël 2016
12 The Bridge Between Regular Cost Functions and Omega-Regular Languages Colcombet, Thomas et al. 2016
13 Playing Safe Colcombet, Thomas et al. 2014
14 Emptiness Of Alternating Tree Automata Using Games With Imperfect Information Fijalkow, Nathanaël et al. 2013
15 Infinite-state games with finitary conditions Chatterjee, Krishnendu et al. 2013
16 Cost-Parity and Cost-Streett Games Fijalkow, Nathanael et al. 2012
Current Page :
Number of result pages: 1
Number of documents: 16

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