Profil

Vandenhove Pierre

Université de Mons - UMONS > Faculté des Sciences > Service de Mathématiques effectives

ORCID
0000-0001-5834-1068
Main Referenced Co-authors
RANDOUR, Mickaël  (15)
Bouyer, Patricia (13)
Oualhadj, Youssouf (4)
BRIHAYE, Thomas  (2)
Casares, Antonio (2)
Main Referenced Keywords
two-player games on graphs (10); finite-memory strategies (8); finite-memory determinacy (6); omega-regular languages (6); optimal strategies (6);
Main Referenced Unit & Research Centers
CREMMI - Modélisation mathématique et informatique (47)
Main Referenced Disciplines
Computer science (47)
Mathematics (46)

Publications (total 47)

The most downloaded
88 downloads
Bouyer, P., Randour, M., & Vandenhove, P. (09 March 2022). Characterizing Omega-Regularity Through Finite-Memory Determinacy of Games on Infinite Graphs. Leibniz International Proceedings in Informatics, 219, 16:1-16:16. doi:10.4230/LIPIcs.STACS.2022.16 https://hdl.handle.net/20.500.12907/1110

The most cited

13 citations (Scopus®)

Bouyer, P., Le Roux, S., Oualhadj, Y., Randour, M., & Vandenhove, P. (01 September 2020). Games Where You Can Play Optimally with Arena-Independent Finite Memory. Leibniz International Proceedings in Informatics, 171, 24:1-24:22. doi:10.4230/LIPIcs.CONCUR.2020.24 https://hdl.handle.net/20.500.12907/26884

Bouyer, P., Oualhadj, Y., Randour, M., & Vandenhove, P. (01 December 2023). Arena-Independent Finite-Memory Determinacy in Stochastic Games. Logical Methods in Computer Science, 19 (4), 18:1-18:51. doi:10.46298/lmcs-19(4:18)2023
Peer Reviewed verified by ORBi

Bouyer, P., Casares, A., Randour, M., & Vandenhove, P. (2023). Half-Positional Objectives Recognized by Deterministic Büchi Automata (Extended Abstract). IJCAI - International Joint Conference on Artificial Intelligence. doi:10.24963/ijcai.2023/713
Peer reviewed

Vandenhove, P. (25 July 2023). How to Play Optimally for Regular Objectives? [Paper presentation]. Highlights 2023 of Logic, Games and Automata, Kassel, Germany.
Peer reviewed

Vandenhove, P. (11 July 2023). How to Play Optimally for Regular Objectives? [Paper presentation]. 50th EATCS International Colloquium on Automata, Languages and Programming (ICALP 2023), Paderborn, Germany.

Bouyer, P., Fijalkow, N., Randour, M., & Vandenhove, P. (05 July 2023). How to Play Optimally for Regular Objectives? Leibniz International Proceedings in Informatics, 261, 118:1-118:18. doi:10.4230/LIPIcs.ICALP.2023.118
Peer Reviewed verified by ORBi

Vandenhove, P. (03 July 2023). Strategy Complexity of Zero-Sum Games on Graphs [Paper presentation]. Verification Seminar, Liverpool, United Kingdom.

Vandenhove, P. (20 June 2023). Characterizing Omega-Regularity Through Finite-Memory Determinacy of Games on Infinite Graphs [Paper presentation]. STIC doctoral day on the Saclay plateau, Gif-sur-Yvette, France.

Vandenhove, P. (09 May 2023). Strategy Complexity of Zero-Sum Games on Graphs [Paper presentation]. Seminar of the Institute of Science and Technology Austria (ISTA), Vienna, Austria.

Vandenhove, P. (2023). Strategy Complexity of Zero-Sum Games on Graphs [Doctoral thesis, UMONS - Université de Mons]. ORBi UMONS-University of Mons. https://orbi.umons.ac.be/handle/20.500.12907/46092

Capon, C., Goeminne, A., Lecomte, N., Main, J., Randour, M., Staquet, G., Terefenko, A., & Vandenhove, P. (2023). À vous de jouer !

Vandenhove, P. (02 March 2023). Memory Requirements of Omega-Regular Objectives: the Regular Case [Paper presentation]. MTV Seminar at LaBRI, Bordeaux, France.

Vandenhove, P. (17 February 2023). How to Play Optimally for Regular Objectives? [Paper presentation]. GT Informel MCS & CDS of the LMF, Gif-sur-Yvette, France.

Bouyer, P., Randour, M., & Vandenhove, P. (16 January 2023). Characterizing Omega-Regularity through Finite-Memory Determinacy of Games on Infinite Graphs. TheoretiCS, 2, 1-48.
Peer reviewed

Vandenhove, P. (16 December 2022). Memory Requirements of Omega-Regular Objectives: the Regular Case [Paper presentation]. UMONS Formal Methods Reading Group, Mons, Belgium.

Bouyer, P., Randour, M., & Vandenhove, P. (12 December 2022). The True Colors of Memory: A Tour of Chromatic-Memory Strategies in Zero-Sum Games on Graphs (Invited Talk). Leibniz International Proceedings in Informatics, 250, 18. doi:10.4230/LIPIcs.FSTTCS.2022.3
Peer Reviewed verified by ORBi

Zhao, J., VANDENHOVE, P., Xu, P., Tao, H., Wang, L., Liu, C. H., & Crowcroft, J. (21 November 2022). Parallel and Memory-Efficient Distributed Edge Learning in B5G IoT Networks. IEEE Journal of Selected Topics in Signal Processing, 17 (1), 222-233. doi:10.1109/jstsp.2022.3223759
Peer Reviewed verified by ORBi

Bouyer, P., Brihaye, T., Randour, M., Rivière, C., & Vandenhove, P. (November 2022). Decisiveness of stochastic systems and its application to hybrid models. Information and Computation, 289 (B), 104861. doi:10.1016/j.ic.2021.104861
Peer Reviewed verified by ORBi

Vandenhove, P. (28 October 2022). Characterizing Omega-Regularity Through Finite-Memory Determinacy of Games on Infinite Graphs [Paper presentation]. IRIF Automata Seminar, Paris, France.

Bouyer, P., Fijalkow, N., Randour, M., & Vandenhove, P. (2022). How to Play Optimally for Regular Objectives? ORBi UMONS-University of Mons. https://orbi.umons.ac.be/handle/20.500.12907/44195. doi:10.48550/arXiv.2210.09703

Vandenhove, P. (14 October 2022). Characterizing Omega-Regularity Through Finite-Memory Determinacy of Games on Infinite Graphs [Paper presentation]. ULB Verif Seminar, Brussels, Belgium.

Vandenhove, P. (14 September 2022). Half-Positional Objectives Recognized by Deterministic Büchi Automata [Paper presentation]. International Conference on Concurrency Theory (CONCUR 2022), Warsaw, Poland.
Peer reviewed

Bouyer, P., Casares, A., Randour, M., & Vandenhove, P. (06 September 2022). Half-Positional Objectives Recognized by Deterministic Büchi Automata. Leibniz International Proceedings in Informatics, 243, 20:1-20:18. doi:10.4230/LIPIcs.CONCUR.2022.20
Peer Reviewed verified by ORBi

Vandenhove, P. (26 August 2022). Characterizing Omega-Regularity through Finite-Memory Determinacy of Games on Infinite Graphs [Paper presentation]. LAMAS&SR: Logical Aspects in Multi-Agent Systems and Strategic Reasoning, Rennes, France.
Peer reviewed

Vandenhove, P. (29 June 2022). Half-Positional Objectives Recognized by Deterministic Büchi Automata [Paper presentation]. Highlights 2022 of Logic, Games and Automata, Paris, France.
Peer reviewed

Vandenhove, P. (02 June 2022). Existence of memoryless optimal strategies through universal graphs [based on a LICS'22 paper] [Paper presentation]. UMONS Formal Methods Reading Group, Mons, Belgium.

Vandenhove, P. (06 April 2022). Characterizing Omega-Regularity Through Finite-Memory Determinacy of Games on Infinite Graphs [Poster presentation]. Current Trends in Graph and Stochastic Games, Maastricht, Netherlands.
Editorial reviewed

Main, J., Meurisse, Q., Randour, M., Staquet, G., Tamines, C., & Vandenhove, P. (2022). À vous de jouer !

Vandenhove, P. (17 March 2022). Characterizing Omega-Regularity Through Finite-Memory Determinacy of Games on Infinite Graphs [Paper presentation]. Symposium on Theoretical Aspects of Computer Science (STACS), Marseille, France.

Bouyer, P., Randour, M., & Vandenhove, P. (09 March 2022). Characterizing Omega-Regularity Through Finite-Memory Determinacy of Games on Infinite Graphs. Leibniz International Proceedings in Informatics, 219, 16:1-16:16. doi:10.4230/LIPIcs.STACS.2022.16
Peer Reviewed verified by ORBi

Vandenhove, P. (03 March 2022). Characterizing Omega-Regular Languages Through Strategy Complexity of Games on Infinite Graphs (invited talk) [Paper presentation]. LaBRI seminar, Bordeaux, France.

Bouyer, P., Le Roux, S., Oualhadj, Y., Randour, M., & Vandenhove, P. (2022). Games Where You Can Play Optimally with Arena-Independent Finite Memory. Logical Methods in Computer Science, 18 (1). doi:10.46298/LMCS-18(1:11)2022
Peer Reviewed verified by ORBi

Vandenhove, P. (17 November 2021). Characterizing Omega-Regularity through Finite-Memory Determinacy of Games on Infinite Graphs [Paper presentation]. Journées du GT Vérif, Gif-sur-Yvette, France.
Editorial reviewed

Vandenhove, P. (23 September 2021). Characterizing omega-regular languages through strategy complexity of games on infinite graphs [Ongoing work] [Paper presentation]. UMONS Formal Methods Reading Group, Mons, Belgium.

Vandenhove, P. (15 September 2021). Arena-Independent Finite-Memory Determinacy [Paper presentation]. Highlights of Logic, Games and Automata, Aachen/Online, Germany.
Peer reviewed

Vandenhove, P. (26 August 2021). Arena-Independent Finite-Memory Determinacy in Stochastic Games [Paper presentation]. International Conference on Concurrency Theory (CONCUR 2021), Paris, France.

Bouyer, P., Oualhadj, Y., Randour, M., & Vandenhove, P. (23 August 2021). Arena-Independent Finite-Memory Determinacy in Stochastic Games. Leibniz International Proceedings in Informatics, 203, 26:1-26:18. doi:10.4230/LIPIcs.CONCUR.2021.26
Peer Reviewed verified by ORBi

Vandenhove, P. (17 June 2021). Arena-Independent Finite-Memory Strategies [Paper presentation]. GT ALGA, Journées annuelles 2021, Online, France.
Editorial reviewed

Vandenhove, P. (23 April 2021). Arena-Independent Finite-Memory Strategies [Paper presentation]. Groupe de Travail Concurrence & Distribué et Model-Checking & Synthèse, LMF, École normale supérieure Paris-Saclay, Université Paris-Saclay, France.

Vandenhove, P. (09 December 2020). Understanding Finite-Memory Determinacy [Poster presentation]. LMF Research Days, Saclay, France.

Vandenhove, P. (22 September 2020). Decisiveness of Stochastic Systems and its Application to Hybrid Models [Paper presentation]. International Symposium on Games, Automata, Logics and Formal Verification, Brussels, Belgium.

Bouyer, P., Brihaye, T., Randour, M., Rivière, C., & Vandenhove, P. (21 September 2020). Decisiveness of Stochastic Systems and its Application to Hybrid Models. Electronic Proceedings in Theoretical Computer Science, 326, 149-165. doi:10.4204/EPTCS.326.10
Peer Reviewed verified by ORBi

Vandenhove, P. (02 September 2020). Games Where You Can Play Optimally with Arena-Independent Finite Memory [Paper presentation]. International Conference on Concurrency Theory, Vienna, Austria.

Bouyer, P., Le Roux, S., Oualhadj, Y., Randour, M., & Vandenhove, P. (01 September 2020). Games Where You Can Play Optimally with Arena-Independent Finite Memory. Leibniz International Proceedings in Informatics, 171, 24:1-24:22. doi:10.4230/LIPIcs.CONCUR.2020.24
Peer Reviewed verified by ORBi

Vandenhove, P. (22 June 2020). Games Where You Can Play Optimally with Arena-Independent Finite Memory [Paper presentation]. 14th Summer School on Modelling and Verification of Parallel Processes (MOVEP 2020), Grenoble, France.
Editorial reviewed

Vandenhove, P. (19 September 2019). Reachability in Stochastic Hybrid Systems [Paper presentation]. Highlights of Logic, Games and Automata, Warsaw, Poland.
Peer reviewed

Vandenhove, P. (12 September 2019). Reachability in Stochastic Hybrid Systems [Paper presentation]. 13th International Conference on Reachability Problems (RP'19), Brussels, Belgium.
Editorial reviewed

Vandenhove, P. (05 March 2019). Reachability in Infinite Markov Chains [Poster presentation]. Mardi des Chercheurs, Mons, Belgium.

Contact ORBi UMONS