| Adventures in monitorability: from branching to linear time and back again L Aceto, A Achilleos, A Francalanza, A Ingólfsdóttir, K Lehtinen POPL 2019 Proceedings of the ACM on Programming Languages 3 (POPL), 1-29, 2019 | 74 | 2019 |
| A modal μ perspective on solving parity games in quasi-polynomial time K Lehtinen LICS 2018 Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in …, 2018 | 64 | 2018 |
| An operational guide to monitorability L Aceto, A Achilleos, A Francalanza, A Ingólfsdóttir, K Lehtinen SEFM 2019 International Conference on Software Engineering and Formal …, 2019 | 36 | 2019 |
| Good for games automata: From nondeterminism to alternation U Boker, K Lehtinen CONCUR 2019 30th International Conference on Concurrency Theory 140, 19:1--19:16, 2019 | 32 | 2019 |
| An operational guide to monitorability with applications to regular properties L Aceto, A Achilleos, A Francalanza, A Ingólfsdóttir, K Lehtinen Software and Systems Modeling 20, 335-361, 2021 | 26 | 2021 |
| Good-for-games -Pushdown Automata K Lehtinen, M Zimmermann LICS 2020 Proceedings of the 35th Annual ACM/IEEE Symposium on Logic in …, 2020 | 25 | 2020 |
| History determinism vs. good for gameness in quantitative automata U Boker, K Lehtinen arXiv preprint arXiv:2110.14238, 2021 | 24 | 2021 |
| A recursive approach to solving parity games in quasipolynomial time K Lehtinen, P Parys, S Schewe, D Wojtczak Logical Methods in Computer Science 18, 2022 | 20 | 2022 |
| The best a monitor can do L Aceto, A Achilleos, A Francalanza, A Ingólfsdóttir, K Lehtinen 29th EACSL Annual Conference on Computer Science Logic (CSL 2021), 2021 | 20 | 2021 |
| On the size of good-for-games Rabin automata and its link with the memory in Muller games A Casares, T Colcombet, K Lehtinen arXiv preprint arXiv:2204.11333, 2022 | 17 | 2022 |
| Better late than never or: verifying asynchronous components at runtime DP Attard, L Aceto, A Achilleos, A Francalanza, A Ingólfsdóttir, K Lehtinen International Conference on Formal Techniques for Distributed Objects …, 2021 | 17 | 2021 |
| When a little nondeterminism goes a long way: An introduction to history-determinism U Boker, K Lehtinen ACM SIGLOG News 10 (1), 24-51, 2023 | 16 | 2023 |
| A bit of nondeterminism makes pushdown automata expressive and succinct S Guha, I Jecker, K Lehtinen, M Zimmermann Logical Methods in Computer Science 20, 2024 | 15 | 2024 |
| Token games and history-deterministic quantitative automata U Boker, K Lehtinen International Conference on Foundations of Software Science and Computation …, 2022 | 15 | 2022 |
| On the succinctness of alternating parity good-for-games automata U Boker, D Kuperberg, K Lehtinen, M Skrzypczak arXiv preprint arXiv:2009.14437, 2020 | 12 | 2020 |
| Alternating weak automata from universal trees L Daviaud, M Jurdzinski, K Lehtinen CONCUR 2019 30th International Conference on Concurrency Theory 140, 18:1--18:14, 2019 | 12 | 2019 |
| Deciding the first levels of the modal mu alternation hierarchy by formula construction K Lehtinen, S Quickert CSL 2015 24th EACSL Annual Conference on Computer Science Logic, 2015 | 12 | 2015 |
| Parikh automata over infinite words S Guha, I Jecker, K Lehtinen, M Zimmermann arXiv preprint arXiv:2207.07694, 2022 | 10 | 2022 |
| Register Games K Lehtinen, U Boker Logical Methods in Computer Science 16 (2), 2020 | 10* | 2020 |
| On the way to alternating weak automata U Boker, K Lehtinen FSTTCS 2018 38th IARCS Annual Conference on Foundations of Software …, 2018 | 10 | 2018 |
Antonis AchilleosReykjavik UniversityVerified email at ru.is
