Karoliina Lehtinen

Publication Activity (10 Years)

Years Active: 2015-2024
Publications (10 Years): 58

Top Topics

Weighted Majority

Nash Equilibria

Top Venues

Log. Methods Comput. Sci.

Publications

Shibashis Guha, Ismaël Jecker, Karoliina Lehtinen, Martin Zimmermann
A Bit of Nondeterminism Makes Pushdown Automata Expressive and Succinct. Log. Methods Comput. Sci. 20 (1) (2024)
Udi Boker, Thomas A. Henzinger, Karoliina Lehtinen, Aditya Prakash
History-Determinism vs Fair Simulation. CONCUR (2024)
Udi Boker, Thomas A. Henzinger, Karoliina Lehtinen, Aditya Prakash
History-Determinism vs Fair Simulation. CoRR (2024)
Udi Boker, Karoliina Lehtinen
When a Little Nondeterminism Goes a Long Way: An Introduction to History-Determinism. ACM SIGLOG News 10 (1) (2023)
Antonio Casares, Thomas Colcombet, Nathanaël Fijalkow, Karoliina Lehtinen
From Muller to Parity and Rabin Automata: Optimal Transformations Preserving (History-)Determinism. CoRR (2023)
Udi Boker, Karoliina Lehtinen
Token Games and History-Deterministic Quantitative-Automata. Log. Methods Comput. Sci. 19 (4) (2023)
Enzo Erlich, Shibashis Guha, Ismaël Jecker, Karoliina Lehtinen, Martin Zimmermann
History-Deterministic Parikh Automata. CONCUR (2023)
Karoliina Lehtinen
A Brief History of History-Determinism (Invited Talk). STACS (2023)
Sougata Bose, Thomas A. Henzinger, Karoliina Lehtinen, Sven Schewe, Patrick Totzke
History-deterministic Timed Automata. CoRR (2023)
Shibashis Guha, Ismaël Jecker, Karoliina Lehtinen, Martin Zimmermann
Parikh Automata over Infinite Words. CoRR (2022)
Udi Boker, Karoliina Lehtinen
Token Games and History-Deterministic Quantitative Automata. FoSSaCS (2022)
Antonis Achilleos, Léo Exibard, Adrian Francalanza, Karoliina Lehtinen, Jasmine Xuereb
A Synthesis Tool for Optimal Monitors in a Branching-Time Setting. COORDINATION (2022)
Sougata Bose, Thomas A. Henzinger, Karoliina Lehtinen, Sven Schewe, Patrick Totzke
History-Deterministic Timed Automata Are Not Determinizable. RP (2022)
Karoliina Lehtinen, Pawel Parys, Sven Schewe, Dominik Wojtczak
A Recursive Approach to Solving Parity Games in Quasipolynomial Time. Log. Methods Comput. Sci. 18 (1) (2022)
Enzo Erlich, Shibashis Guha, Ismaël Jecker, Karoliina Lehtinen, Martin Zimmermann
History-deterministic Parikh Automata. CoRR (2022)
Udi Boker, Karoliina Lehtinen, Salomon Sickert
On the Translation of Automata to Linear Temporal Logic. FoSSaCS (2022)
Udi Boker, Karoliina Lehtinen, Salomon Sickert
On the Translation of Automata to Linear Temporal Logic. CoRR (2022)
Antonio Casares, Thomas Colcombet, Karoliina Lehtinen
On the Size of Good-For-Games Rabin Automata and Its Link with the Memory in Muller Games. ICALP (2022)
Karoliina Lehtinen, Martin Zimmermann
Good-for-games ω-Pushdown Automata. Log. Methods Comput. Sci. 18 (1) (2022)
Antonio Casares, Thomas Colcombet, Karoliina Lehtinen
On the size of good-for-games Rabin automata and its link with the memory in Muller games. CoRR (2022)
Shibashis Guha, Ismaël Jecker, Karoliina Lehtinen, Martin Zimmermann
Parikh Automata over Infinite Words. FSTTCS (2022)
Luca Aceto, Antonis Achilleos, Elli Anastasiadi, Adrian Francalanza, Anna Ingólfsdóttir, Karoliina Lehtinen, Mathias Ruggaard Pedersen
On Probabilistic Monitorability. Principles of Systems Design (2022)
Thomas A. Henzinger, Karoliina Lehtinen, Patrick Totzke
History-Deterministic Timed Automata. CONCUR (2022)
Udi Boker, Karoliina Lehtinen
History Determinism vs. Good for Gameness in Quantitative Automata. FSTTCS (2021)
Luca Aceto, Antonis Achilleos, Adrian Francalanza, Anna Ingólfsdóttir, Karoliina Lehtinen
The Best a Monitor Can Do. CSL (2021)
Shibashis Guha, Ismaël Jecker, Karoliina Lehtinen, Martin Zimmermann
A Bit of Nondeterminism Makes Pushdown Automata Expressive and Succinct. MFCS (2021)
Luca Aceto, Antonis Achilleos, Adrian Francalanza, Anna Ingólfsdóttir, Karoliina Lehtinen
An operational guide to monitorability with applications to regular properties. Softw. Syst. Model. 20 (2) (2021)
Udi Boker, Karoliina Lehtinen
History Determinism vs. Good for Gameness in Quantitative Automata. CoRR (2021)
Karoliina Lehtinen, Pawel Parys, Sven Schewe, Dominik Wojtczak
A Recursive Approach to Solving Parity Games in Quasipolynomial Time. CoRR (2021)
Shibashis Guha, Ismaël Jecker, Karoliina Lehtinen, Martin Zimmermann
A Bit of Nondeterminism Makes Pushdown Automata Expressive and Succinct. CoRR (2021)
Duncan Paul Attard, Luca Aceto, Antonis Achilleos, Adrian Francalanza, Anna Ingólfsdóttir, Karoliina Lehtinen
Better Late Than Never or: Verifying Asynchronous Components at Runtime. FORTE (2021)
Udi Boker, Karoliina Lehtinen
Token Games and History-Deterministic Quantitative-Automata. CoRR (2021)
Karoliina Lehtinen, Martin Zimmermann
Good-for-games ω-Pushdown Automata. LICS (2020)
Karoliina Lehtinen, Martin Zimmermann
Good-for-games ω-Pushdown Automata. CoRR (2020)
Karoliina Lehtinen, Udi Boker
Register Games. Log. Methods Comput. Sci. 16 (2) (2020)
Udi Boker, Denis Kuperberg, Karoliina Lehtinen, Michal Skrzypczak
On the Succinctness of Alternating Parity Good-for-Games Automata. CoRR (2020)
Udi Boker, Denis Kuperberg, Karoliina Lehtinen, Michal Skrzypczak
On Succinctness and Recognisability of Alternating Good-for-Games Automata. CoRR (2020)
Udi Boker, Denis Kuperberg, Karoliina Lehtinen, Michal Skrzypczak
On the Succinctness of Alternating Parity Good-For-Games Automata. FSTTCS (2020)
Luca Aceto, Antonis Achilleos, Adrian Francalanza, Anna Ingólfsdóttir, Karoliina Lehtinen
Adventures in monitorability: from branching to linear time and back again. Proc. ACM Program. Lang. 3 (POPL) (2019)
Udi Boker, Karoliina Lehtinen
Register Games. CoRR (2019)
Luca Aceto, Antonis Achilleos, Adrian Francalanza, Anna Ingólfsdóttir, Karoliina Lehtinen
An Operational Guide to Monitorability. SEFM (2019)
Laure Daviaud, Marcin Jurdzinski, Karoliina Lehtinen
Alternating Weak Automata from Universal Trees. CONCUR (2019)
Luca Aceto, Antonis Achilleos, Adrian Francalanza, Anna Ingólfsdóttir, Karoliina Lehtinen
An Operational Guide to Monitorability. CoRR (2019)
Luca Aceto, Antonis Achilleos, Adrian Francalanza, Anna Ingólfsdóttir, Karoliina Lehtinen
Testing Equivalence vs. Runtime Monitoring. Models, Languages, and Tools for Concurrent and Distributed Programming (2019)
Luca Aceto, Antonis Achilleos, Adrian Francalanza, Anna Ingólfsdóttir, Karoliina Lehtinen
The Cost of Monitoring Alone. From Reactive Systems to Cyber-Physical Systems (2019)
Udi Boker, Karoliina Lehtinen
Good for Games Automata: From Nondeterminism to Alternation. CONCUR (2019)
Laure Daviaud, Marcin Jurdzinski, Karoliina Lehtinen
Alternating Weak Automata from Universal Trees. CoRR (2019)
Karoliina Lehtinen, Sven Schewe, Dominik Wojtczak
Improving the complexity of Parys' recursive algorithm. CoRR (2019)
Luca Aceto, Antonis Achilleos, Adrian Francalanza, Anna Ingólfsdóttir, Karoliina Lehtinen
The Cost of Monitoring Alone. CoRR (2019)
Udi Boker, Karoliina Lehtinen
Good for Games Automata: From Nondeterminism to Alternation. CoRR (2019)
Luca Aceto, Antonis Achilleos, Adrian Francalanza, Anna Ingólfsdóttir, Karoliina Lehtinen
Adventures in Monitorability: From Branching to Linear Time and Back Again. CoRR (2019)
Udi Boker, Karoliina Lehtinen
On the Way to Alternating Weak Automata. FSTTCS (2018)
Karoliina Lehtinen
A modal μ perspective on solving parity games in quasi-polynomial time. LICS (2018)
Karoliina Lehtinen, Sandra Quickert
. CoRR (2017)
Karoliina Lehtinen
The descriptive complexity of modal mu model-checking parity games. GandALF (2017)
Karoliina Lehtinen, Sandra Quickert
. CiE (2017)
Karoliina Lehtinen
Disjunctive form and the modal μ alternation hierarchy. FICS (2015)
Karoliina Lehtinen, Sandra Quickert
Deciding the First Levels of the Modal mu Alternation Hierarchy by Formula Construction. CSL (2015)