| Characterizing positionality in games of infinite duration over infinite graphs P Ohlmann Proceedings of the 37th Annual ACM/IEEE Symposium on Logic in Computer …, 2022 | 13 | 2022 |
| Monotonic graphs for parity and mean-payoff games P Ohlmann Université Paris Cité, 2021 | 12 | 2021 |
| The theory of universal graphs for infinite duration games T Colcombet, N Fijalkow, P Gawrychowski, P Ohlmann Logical Methods in Computer Science 18, 2022 | 10 | 2022 |
| Value iteration using universal graphs and the complexity of mean payoff games N Fijalkow, P Gawrychowski, P Ohlmann 45th International Symposium on Mathematical Foundations of Computer Science …, 2020 | 10 | 2020 |
| On the Monniaux problem in abstract interpretation N Fijalkow, E Lefaucheux, P Ohlmann, J Ouaknine, A Pouly, J Worrell International Static Analysis Symposium, 162-180, 2019 | 9 | 2019 |
| Flipper games for monadically stable graph classes J Gajarský, N Mählmann, R McCarty, P Ohlmann, M Pilipczuk, ... arXiv preprint arXiv:2301.13735, 2023 | 8 | 2023 |
| Scaling neural program synthesis with distribution-based search N Fijalkow, G Lagarde, T Matricon, K Ellis, P Ohlmann, AN Potta Proceedings of the AAAI Conference on Artificial Intelligence 36 (6), 6623-6630, 2022 | 8 | 2022 |
| The complexity of mean payoff games using universal graphs N Fijalkow, P Gawrychowski, P Ohlmann arXiv preprint arXiv:1812.07072, 2018 | 8 | 2018 |
| Semialgebraic invariant synthesis for the kannan-lipton orbit problem N Fijalkow, P Ohlmann, J Ouaknine, A Pouly, J Worrell arXiv preprint arXiv:1701.02162, 2017 | 7 | 2017 |
| A symmetric attractor-decomposition lifting algorithm for parity games M Jurdziński, R Morvan, P Ohlmann, KS Thejaswini arXiv preprint arXiv:2010.08288, 2020 | 6 | 2020 |
| Controlling a random population. T Colcombet, N Fijalkow, P Ohlmann FoSSaCS, 119-135, 2020 | 5 | 2020 |
| Complete semialgebraic invariant synthesis for the kannan-lipton orbit problem N Fijalkow, P Ohlmann, J Ouaknine, A Pouly, J Worrell Theory of Computing Systems 63, 1027-1048, 2019 | 5 | 2019 |
| Characterising memory in infinite games A Casares, P Ohlmann arXiv preprint arXiv:2209.12044, 2022 | 4 | 2022 |
| The GKK algorithm is the fastest over simple mean-payoff games P Ohlmann International Computer Science Symposium in Russia, 269-288, 2022 | 3 | 2022 |
| Tight bounds using hankel matrix for arithmetic circuits with unique parse trees N Fijalkow, G Lagarde, P Ohlmann Electronic Colloquium on Computational Complexity (ECCC) 25, 38, 2018 | 3 | 2018 |
| Positionality of mean-payoff games on infinite graphs P Ohlmann arXiv preprint arXiv:2305.00347, 2023 | 2 | 2023 |
| Lower bounds for arithmetic circuits via the hankel matrix N Fijalkow, G Lagarde, P Ohlmann, O Serre computational complexity 30, 1-60, 2021 | 2 | 2021 |
| Positionality in {\Sigma} _0^ 2 and a completeness result P Ohlmann, M Skrzypczak arXiv preprint arXiv:2309.17022, 2023 | 1 | 2023 |
| Canonical decompositions in monadically stable and bounded shrubdepth graph classes P Ohlmann, M Pilipczul, S Toruńczyk, W Przybyszewski arXiv preprint arXiv:2303.01473, 2023 | 1 | 2023 |
| A technique to speed up symmetric attractor-based algorithms for parity games KS Thejaswini, P Ohlmann, M Jurdzinski Proceedings of the 42nd IARCS Annual Conference on Foundations of Software …, 2022 | 1 | 2022 |
