Pierre Vandenhove

According to our database, Pierre Vandenhove authored at least 18 papers between 2018 and 2025.

Collaborative distances:

• Dijkstra number of three.
• Erdős number of four.

2025

LTL_f Learning Meets Boolean Set Cover.

Gabriel Bathie, Nathanaël Fijalkow, Théo Matricon, Baptiste Mouillon, Pierre Vandenhove

CoRR, September, 2025

Decisiveness for Countable MDPs and Insights for NPLCSs and POMDPs.

Nathalie Bertrand, Patricia Bouyer, Thomas Brihaye, Paulin Fournier, Pierre Vandenhove

Proceedings of the Principles of Formal Quantitative Analysis, 2025

Revelations: A Decidable Class of POMDPs with Omega-Regular Objectives.

Marius Belly, Nathanaël Fijalkow, Hugo Gimbert, Florian Horn, Guillermo A. Pérez, Pierre Vandenhove

Proceedings of the AAAI-25, Sponsored by the Association for the Advancement of Artificial Intelligence, February 25, 2025

2024

A positional Π⁰₃-complete objective.

Antonio Casares, Pierre Ohlmann, Pierre Vandenhove

CoRR, 2024

The Power of Counting Steps in Quantitative Games.

Sougata Bose, Rasmus Ibsen-Jensen, David Purser, Patrick Totzke, Pierre Vandenhove

Proceedings of the 35th International Conference on Concurrency Theory, 2024

2023

Parallel and Memory-Efficient Distributed Edge Learning in B5G IoT Networks.

Jianxin Zhao, Pierre Vandenhove, Peng Xu, Hao Tao, Liang Wang, Chi Harold Liu, Jon Crowcroft

IEEE J. Sel. Top. Signal Process., January, 2023

Strategy complexity of zero-sum games on graphs. (Complexité des stratégies des jeux sur graphes à somme nulle).

Pierre Vandenhove

PhD thesis, 2023

Half-Positional Objectives Recognized by Deterministic Büchi Automata (Extended Abstract).

Patricia Bouyer, Antonio Casares, Mickael Randour, Pierre Vandenhove

Proceedings of the Thirty-Second International Joint Conference on Artificial Intelligence, 2023

How to Play Optimally for Regular Objectives?

Patricia Bouyer, Nathanaël Fijalkow, Mickael Randour, Pierre Vandenhove

Proceedings of the 50th International Colloquium on Automata, Languages, and Programming, 2023

2022

Decisiveness of stochastic systems and its application to hybrid models.

Patricia Bouyer, Thomas Brihaye, Mickael Randour, Cédric Rivière, Pierre Vandenhove

Inf. Comput., 2022

Characterizing Omega-Regularity Through Finite-Memory Determinacy of Games on Infinite Graphs.

Patricia Bouyer, Mickael Randour, Pierre Vandenhove

Proceedings of the 39th International Symposium on Theoretical Aspects of Computer Science, 2022

The True Colors of Memory: A Tour of Chromatic-Memory Strategies in Zero-Sum Games on Graphs (Invited Talk).

Patricia Bouyer, Mickael Randour, Pierre Vandenhove

Proceedings of the 42nd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2022

Half-Positional Objectives Recognized by Deterministic Büchi Automata.

Patricia Bouyer, Antonio Casares, Mickael Randour, Pierre Vandenhove

Proceedings of the 33rd International Conference on Concurrency Theory, 2022

2021

Arena-Independent Finite-Memory Determinacy in Stochastic Games.

Patricia Bouyer, Youssouf Oualhadj, Mickael Randour, Pierre Vandenhove

Proceedings of the 32nd International Conference on Concurrency Theory, 2021

2020

Decisiveness of Stochastic Systems and its Application to Hybrid Models (Full Version).

Patricia Bouyer, Thomas Brihaye, Mickael Randour, Cédric Rivière, Pierre Vandenhove

CoRR, 2020

Games Where You Can Play Optimally with Finite Memory.

Patricia Bouyer, Stéphane Le Roux, Youssouf Oualhadj, Mickael Randour, Pierre Vandenhove

CoRR, 2020

Games Where You Can Play Optimally with Arena-Independent Finite Memory.

Patricia Bouyer, Stéphane Le Roux, Youssouf Oualhadj, Mickael Randour, Pierre Vandenhove

Proceedings of the 31st International Conference on Concurrency Theory, 2020

2018

Functional Design of Computation Graph.

Pierre Vandenhove

CoRR, 2018