2024
Playing Safe, Ten Years Later.
Log. Methods Comput. Sci., 2024
2023
,
,
,
,
,
,
,
,
,
,
,
,
,
,
,
,
CoRR, 2023
The Problem of Discovery in Version Control Systems.
Proceedings of the XII Latin-American Algorithms, Graphs and Optimization Symposium, 2023
2020
Deciding the Existence of Cut-Off in Parameterized Rendez-Vous Networks.
Proceedings of the 31st International Conference on Concurrency Theory, 2020
2016
Entropy Games and Matrix Multiplication Games.
Proceedings of the 33rd Symposium on Theoretical Aspects of Computer Science, 2016
2015
Optimal strategy synthesis for request-response games.
RAIRO Theor. Informatics Appl., 2015
Trading Bounds for Memory in Games with Counters.
Proceedings of the Automata, Languages, and Programming - 42nd International Colloquium, 2015
2014
Two Recursively Inseparable Problems for Probabilistic Automata.
Proceedings of the Mathematical Foundations of Computer Science 2014, 2014
Proceedings of the 34th International Conference on Foundation of Software Technology and Theoretical Computer Science, 2014
2013
Les jeux d'accessibilité généralisée.
Tech. Sci. Informatiques, 2013
2011
Self-Stabilizing k-out-of-ℓ Exclusion in Tree Networks.
Int. J. Found. Comput. Sci., 2011
The Complexity of Request-Response Games.
Proceedings of the Language and Automata Theory and Applications, 2011
2010
The surprizing complexity of reachability games
CoRR, 2010
How do we remember the past in randomised strategies?
Proceedings of the Proceedings First Symposium on Games, 2010
Solving Simple Stochastic Tail Games.
Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms, 2010
Proceedings of the CONCUR 2010 - Concurrency Theory, 21th International Conference, 2010
2009
Finitary winning in omega-regular games.
ACM Trans. Comput. Log., 2009
Solving Simple Stochastic Games with Few Random Vertices
, 2009
Random Fruits on the Zielonka Tree.
Proceedings of the 26th International Symposium on Theoretical Aspects of Computer Science, 2009
Stochastic Games with Finitary Objectives.
Proceedings of the Mathematical Foundations of Computer Science 2009, 2009
Self-Stabilizing k-out-of-<i>l</i> exclusion on tree networks.
Proceedings of the 23rd IEEE International Symposium on Parallel and Distributed Processing, 2009
2008
Self-stabilizing K-out-of-L exclusion on tree network
CoRR, 2008
Optimal Strategies in Perfect-Information Stochastic Games with Tail Winning Conditions
CoRR, 2008
On Reachability Games of Ordinal Length.
Proceedings of the SOFSEM 2008: Theory and Practice of Computer Science, 2008
Explicit Muller Games are PTIME.
Proceedings of the IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2008
Proceedings of the IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2008
Simple Stochastic Games with Few Random Vertices Are Easy to Solve.
Proceedings of the Foundations of Software Science and Computational Structures, 2008
Solving Simple Stochastic Games.
Proceedings of the Logic and Theory of Algorithms, 2008
Optimal Strategy Synthesis in Request-Response Games.
Proceedings of the Automated Technology for Verification and Analysis, 2008
2007
Inf. Process. Lett., 2007
Faster Algorithms for Finitary Games.
Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2007