Browse by People

Guha, Shibashis, Jecker, Ismaël, Lehtinen, Karoliina and Zimmermann, Martin ORCID: 0000-0002-8038-2453 (2021) A Bit of Nondeterminism Makes Pushdown Automata Expressive and Succinct. .

Lehtinen, Karoliina and Zimmermann, Martin ORCID: 0000-0002-8038-2453 (2020) GOOD-FOR-GAMES ω-PUSHDOWN AUTOMATA. LOGICAL METHODS IN COMPUTER SCIENCE, 18 (1).

Lehtinen, Karoliina ORCID: 0000-0003-1171-8790 and Zimmermann, Martin ORCID: 0000-0002-8038-2453 (2020) Good-for-games ω-Pushdown Automata. In: LICS '20: 35th Annual ACM/IEEE Symposium on Logic in Computer Science.

Bose, Sougata, Henzinger, Thomas A, Lehtinen, Karoliina, Schewe, Sven ORCID: 0000-0002-9093-9518 and Totzke, Patrick (2022) History-Deterministic Timed Automata Are Not Determinizable. .

Lehtinen, Karoliina ORCID: 0000-0003-1171-8790, Schewe, Sven ORCID: 0000-0002-9093-9518 and Wojtczak, Dominik (2019) Improving the complexity of Parys' recursive algorithm. [Internet Publication]

Lehtinen, Karoliina ORCID: 0000-0003-1171-8790, Achilleos, Antonis, Francalanza, Adrian, Aceto, Luca and Ingolfsdottir, Anna (2020) An Operational Guide to Monitorability. Journal of Software and Systems Modeling,.

Lehtinen, Karoliina ORCID: 0000-0003-1171-8790 and Boker, Udi (2020) REGISTER GAMES. LOGICAL METHODS IN COMPUTER SCIENCE, 16 (2). 2020-.

Lehtinen, Karoliina, Parys, Paweł, Schewe, Sven ORCID: 0000-0002-9093-9518 and Wojtczak, Dominik ORCID: 0000-0001-5560-0546 (2022) A Recursive Approach to Solving Parity Games in Quasipolynomial Time. Logical Methods in Computer Science, Volume (1).