关注
James C. A. Main
James C. A. Main
F.R.S.-FNRS & UMONS – Université de Mons
在 umons.ac.be 的电子邮件经过验证 - 首页
标题
引用次数
引用次数
年份
Different strokes in randomised strategies: Revisiting Kuhn's theorem under finite-memory assumptions
JCA Main, M Randour
Information and Computation 301, 105229, 2024
62024
Time flies when looking out of the window: Timed games with window parity objectives
JCA Main, M Randour, J Sproston
arXiv preprint arXiv:2105.06686, 2021
32021
Reachability Games and Friends: A Journey Through the Lens of Memory and Complexity (Invited Talk)
T Brihaye, A Goeminne, JCA Main, M Randour
43rd IARCS Annual Conference on Foundations of Software Technology and …, 2023
12023
Abstract book du Mardi des Chercheurs 2024
L Equeter, A Cools, L Cultrera, N Dupont, V Fays, K Giancola, M Gillet, ...
Abstract book du Mardi des Chercheurs, 2024
2024
Arena-Independent Memory Bounds for Nash Equilibria in Reachability Games
JCA Main
arXiv preprint arXiv:2310.02142, 2023
2023
Timed Games with Bounded Window Parity Objectives
JCA Main, M Randour, J Sproston
International Conference on Formal Modeling and Analysis of Timed Systems …, 2022
2022
系统目前无法执行此操作，请稍后再试。
文章 1–6