Follow
Pierre Vandenhove
Title
Cited by
Cited by
Year
Games where you can play optimally with arena-independent finite memory
P Vandenhove, M Randour, Y Oualhadj, S Le Roux, P Bouyer
Logical Methods in Computer Science 18, 11:1-11:44, 2022
342022
Characterizing Omega-Regularity through Finite-Memory Determinacy of Games on Infinite Graphs
P Vandenhove, M Randour, P Bouyer
TheoretiCS 2, 1-48, 2023
20*2023
Arena-Independent Finite-Memory Determinacy in Stochastic Games
P Bouyer, Y Oualhadj, M Randour, P Vandenhove
Logical Methods in Computer Science 19, 18:1-18:51, 2023
162023
Half-Positional Objectives Recognized by Deterministic Büchi Automata
P Bouyer, A Casares, M Randour, P Vandenhove
33rd International Conference on Concurrency Theory (CONCUR 2022), 2022
102022
Decisiveness of stochastic systems and its application to hybrid models
P Bouyer, T Brihaye, M Randour, C Rivičre, P Vandenhove
Information and Computation, 104861, 2021
9*2021
How to Play Optimally for Regular Objectives?
P Bouyer, N Fijalkow, M Randour, P Vandenhove
50th EATCS International Colloquium on Automata, Languages and Programming …, 2023
82023
The True Colors of Memory: A Tour of Chromatic-Memory Strategies in Zero-Sum Games on Graphs (Invited Talk)
P Bouyer, M Randour, P Vandenhove
42nd IARCS Annual Conference on Foundations of Software Technology and …, 2022
42022
Strategy Complexity of Zero-Sum Games on Graphs
P Vandenhove
Université de Mons & Université Paris-Saclay, 2023
3*2023
Parallel and Memory-Efficient Distributed Edge Learning in B5G IoT Networks
J Zhao, P Vandenhove, P Xu, H Tao, L Wang, CH Liu, J Crowcroft
IEEE Journal of Selected Topics in Signal Processing 17 (1), 222-233, 2022
32022
Functional Design of Computation Graph
P Vandenhove
arXiv preprint arXiv:1812.03770, 2018
22018
The Power of Counting Steps in Quantitative Games
S Bose, R Ibsen-Jensen, D Purser, P Totzke, P Vandenhove
2024
The system can't perform the operation now. Try again later.
Articles 1–11