| 2026 | LICS | Checking History Determinism for Parity Automata Is in NP. | Karoliina Lehtinen, Keya Prakash, Michal Skrzypczak |
| 2025 | CONCUR | Monitorability for the Modal Mu-Calculus over Systems with Data: From Practice to Theory. | Luca Aceto, Antonis Achilleos, Duncan Paul Attard, Lo Exibard, Adrian Francalanza, Anna Inglfsdttir, Karoliina Lehtinen |
| 2025 | ICALP | Using Games and Universal Trees to Characterise the Nondeterministic Index of Tree Languages. | Olivier Idir, Karoliina Lehtinen |
| 2025 | ICALP | A Collapse of the Parity Index Hierarchy of Tree Automata, Based on Cantor-Bendixson Ranks. | Karoliina Lehtinen, Nathan Lhote |
| 2025 | STOC | The 2-Token Theorem: Recognising History-Deterministic Parity Automata Efficiently. | Karoliina Lehtinen, Aditya Prakash |
| 2024 | CONCUR | History-Determinism vs Fair Simulation. | Udi Boker, Thomas A. Henzinger, Karoliina Lehtinen, Aditya Prakash |
| 2023 | CONCUR | History-Deterministic Parikh Automata. | Enzo Erlich, Shibashis Guha, Ismal Jecker, Karoliina Lehtinen, Martin Zimmermann |
| 2023 | STACS | A Brief History of History-Determinism (Invited Talk). | Karoliina Lehtinen |
| 2022 | CONCUR | History-Deterministic Timed Automata. | Thomas A. Henzinger, Karoliina Lehtinen, Patrick Totzke |
| 2022 | Coordination | A Synthesis Tool for Optimal Monitors in a Branching-Time Setting. | Antonis Achilleos, Lo Exibard, Adrian Francalanza, Karoliina Lehtinen, Jasmine Xuereb |
| 2022 | FOSSACS | Token Games and History-Deterministic Quantitative Automata. | Udi Boker, Karoliina Lehtinen |
| 2022 | FOSSACS | On the Translation of Automata to Linear Temporal Logic. | Udi Boker, Karoliina Lehtinen, Salomon Sickert |
| 2022 | ICALP | On the Size of Good-For-Games Rabin Automata and Its Link with the Memory in Muller Games. | Antonio Casares, Thomas Colcombet, Karoliina Lehtinen |
| 2021 | CSL | The Best a Monitor Can Do. | Luca Aceto, Antonis Achilleos, Adrian Francalanza, Anna Inglfsdttir, Karoliina Lehtinen |
| 2021 | FORTE | Better Late Than Never or: Verifying Asynchronous Components at Runtime. | Duncan Paul Attard, Luca Aceto, Antonis Achilleos, Adrian Francalanza, Anna Inglfsdttir, Karoliina Lehtinen |
| 2021 | MFCS | A Bit of Nondeterminism Makes Pushdown Automata Expressive and Succinct. | Shibashis Guha, Ismal Jecker, Karoliina Lehtinen, Martin Zimmermann |
| 2020 | LICS | Good-for-games ω-Pushdown Automata. | Karoliina Lehtinen, Martin Zimmermann |
| 2019 | CONCUR | Good for Games Automata: From Nondeterminism to Alternation. | Udi Boker, Karoliina Lehtinen |
| 2019 | CONCUR | Alternating Weak Automata from Universal Trees. | Laure Daviaud, Marcin Jurdzinski, Karoliina Lehtinen |
| 2019 | SEFM | An Operational Guide to Monitorability. | Luca Aceto, Antonis Achilleos, Adrian Francalanza, Anna Inglfsdttir, Karoliina Lehtinen |
| 2018 | LICS | A modal μ perspective on solving parity games in quasi-polynomial time. | Karoliina Lehtinen |
| 2017 | CiE | ∑ | Karoliina Lehtinen, Sandra Quickert |
| 2015 | CSL | Deciding the First Levels of the Modal mu Alternation Hierarchy by Formula Construction. | Karoliina Lehtinen, Sandra Quickert |