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 Quantifying Bounds in Strategy Logic Fijalkow, Nathanaël et al. 2018
4 Expressiveness of Probabilistic Modal Logics, Revisited Fijalkow, Nathanaël et al. 2017
5 Probabilistic Automata of Bounded Ambiguity Fijalkow, Nathanaël et al. 2017
6 Semialgebraic Invariant Synthesis for the Kannan-Lipton Orbit Problem Fijalkow, Nathanaël et al. 2017
7 Characterisation of an Algebraic Algorithm for Probabilistic Automata Fijalkow, Nathanaël 2016
8 The Bridge Between Regular Cost Functions and Omega-Regular Languages Colcombet, Thomas et al. 2016
9 Playing Safe Colcombet, Thomas et al. 2014
10 Emptiness Of Alternating Tree Automata Using Games With Imperfect Information Fijalkow, Nathanaël et al. 2013
11 Infinite-state games with finitary conditions Chatterjee, Krishnendu et al. 2013
12 Cost-Parity and Cost-Streett Games Fijalkow, Nathanael et al. 2012
Current Page :
Number of result pages: 1
Number of documents: 12


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