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

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