( en | de | ru )

 

Disambiguation of "Doyen, Laurent"

Author of the publication

copydeleteadd this publication to your clipboard
The Complexity of Partial-observation Stochastic Parity Games With Finite-memory Strategies.

, , , and . CoRR, (2014)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Gerold Doyen

Guillaume Doyen

Laurent Bartholdi

Laurent Ntahuga

Thomas Laurent

 

Other publications of authors with the same name

Qualitative Analysis of Partially-observable Markov Decision Processes, , and . CoRR, (2009)The complexity of synchronizing Markov decision processes., , and . J. Comput. Syst. Sci., (2019)Games and Markov Decision Processes with Mean-Payoff Parity and Energy Parity Objectives., and . MEMICS, volume 7119 of Lecture Notes in Computer Science, page 37-46. Springer, (2011)Antichains: A New Algorithm for Checking Universality of Finite Automata., , , and . CAV, volume 4144 of Lecture Notes in Computer Science, page 17-30. Springer, (2006)Alpaga: A Tool for Solving Parity Games with Imperfect Information., , , , and . TACAS, volume 5505 of Lecture Notes in Computer Science, page 58-61. Springer, (2009)Automatic Rectangular Refinement of Affine Hybrid Systems., , and . FORMATS, volume 3829 of Lecture Notes in Computer Science, page 144-161. Springer, (2005)Robustness and Implementability of Timed Automata., , , and . FORMATS/FTRTFT, volume 3253 of Lecture Notes in Computer Science, page 118-133. Springer, (2004)Games with a Weak Adversary., and . ICALP (2), volume 8573 of Lecture Notes in Computer Science, page 110-121. Springer, (2014)The Complexity of Synthesis from Probabilistic Components., , and . ICALP (2), volume 9135 of Lecture Notes in Computer Science, page 108-120. Springer, (2015)Quantitative Languages., , and . CSL, volume 5213 of Lecture Notes in Computer Science, page 385-400. Springer, (2008)