default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDKaroliina Lehtinen
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j10]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)- [j9]Sougata Bose, Thomas A. Henzinger, Karoliina Lehtinen, Sven Schewe, Patrick Totzke:
History-deterministic Timed Automata. Log. Methods Comput. Sci. 20(4) (2024) - [j8]Antonio Casares, Thomas Colcombet, Nathanaël Fijalkow, Karoliina Lehtinen:
From Muller to Parity and Rabin Automata: Optimal Transformations Preserving (History) Determinism. TheoretiCS 3 (2024) - [c28]Udi Boker, Thomas A. Henzinger, Karoliina Lehtinen, Aditya Prakash:
History-Determinism vs Fair Simulation. CONCUR 2024: 12:1-12:16 - [i22]Udi Boker, Thomas A. Henzinger, Karoliina Lehtinen, Aditya Prakash:
History-Determinism vs Fair Simulation. CoRR abs/2407.08620 (2024) - 2023
- [j7]Udi Boker, Karoliina Lehtinen:
Token Games and History-Deterministic Quantitative-Automata. Log. Methods Comput. Sci. 19(4) (2023) - [j6]Udi Boker, Karoliina Lehtinen:
When a Little Nondeterminism Goes a Long Way: An Introduction to History-Determinism. ACM SIGLOG News 10(1): 24-51 (2023) - [c27]Enzo Erlich, Shibashis Guha, Ismaël Jecker, Karoliina Lehtinen, Martin Zimmermann:
History-Deterministic Parikh Automata. CONCUR 2023: 31:1-31:16 - [c26]Karoliina Lehtinen:
A Brief History of History-Determinism (Invited Talk). STACS 2023: 1:1-1:2 - [i21]Sougata Bose, Thomas A. Henzinger, Karoliina Lehtinen, Sven Schewe, Patrick Totzke:
History-deterministic Timed Automata. CoRR abs/2304.03183 (2023) - [i20]Antonio Casares, Thomas Colcombet, Nathanaël Fijalkow, Karoliina Lehtinen:
From Muller to Parity and Rabin Automata: Optimal Transformations Preserving (History-)Determinism. CoRR abs/2305.04323 (2023) - 2022
- [j5]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) - [j4]Karoliina Lehtinen, Martin Zimmermann:
Good-for-games ω-Pushdown Automata. Log. Methods Comput. Sci. 18(1) (2022) - [c25]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: 325-342 - [c24]Thomas A. Henzinger, Karoliina Lehtinen, Patrick Totzke:
History-Deterministic Timed Automata. CONCUR 2022: 14:1-14:21 - [c23]Antonis Achilleos, Léo Exibard, Adrian Francalanza, Karoliina Lehtinen, Jasmine Xuereb:
A Synthesis Tool for Optimal Monitors in a Branching-Time Setting. COORDINATION 2022: 181-199 - [c22]Udi Boker, Karoliina Lehtinen:
Token Games and History-Deterministic Quantitative Automata. FoSSaCS 2022: 120-139 - [c21]Udi Boker, Karoliina Lehtinen, Salomon Sickert:
On the Translation of Automata to Linear Temporal Logic. FoSSaCS 2022: 140-160 - [c20]Shibashis Guha, Ismaël Jecker, Karoliina Lehtinen, Martin Zimmermann:
Parikh Automata over Infinite Words. FSTTCS 2022: 40:1-40:20 - [c19]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: 117:1-117:20 - [c18]Sougata Bose, Thomas A. Henzinger, Karoliina Lehtinen, Sven Schewe, Patrick Totzke:
History-Deterministic Timed Automata Are Not Determinizable. RP 2022: 67-76 - [i19]Udi Boker, Karoliina Lehtinen, Salomon Sickert:
On the Translation of Automata to Linear Temporal Logic. CoRR abs/2201.10267 (2022) - [i18]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 abs/2204.11333 (2022) - [i17]Shibashis Guha, Ismaël Jecker, Karoliina Lehtinen, Martin Zimmermann:
Parikh Automata over Infinite Words. CoRR abs/2207.07694 (2022) - [i16]Enzo Erlich, Mario Grobler, Shibashis Guha, Ismaël Jecker, Karoliina Lehtinen, Martin Zimmermann:
History-deterministic Parikh Automata. CoRR abs/2209.07745 (2022) - 2021
- [j3]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): 335-361 (2021) - [c17]Luca Aceto, Antonis Achilleos, Adrian Francalanza, Anna Ingólfsdóttir, Karoliina Lehtinen:
The Best a Monitor Can Do. CSL 2021: 7:1-7:23 - [c16]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: 207-225 - [c15]Udi Boker, Karoliina Lehtinen:
History Determinism vs. Good for Gameness in Quantitative Automata. FSTTCS 2021: 38:1-38:20 - [c14]Shibashis Guha, Ismaël Jecker, Karoliina Lehtinen, Martin Zimmermann:
A Bit of Nondeterminism Makes Pushdown Automata Expressive and Succinct. MFCS 2021: 53:1-53:20 - [i15]Karoliina Lehtinen, Pawel Parys, Sven Schewe, Dominik Wojtczak:
A Recursive Approach to Solving Parity Games in Quasipolynomial Time. CoRR abs/2104.09717 (2021) - [i14]Shibashis Guha, Ismaël Jecker, Karoliina Lehtinen, Martin Zimmermann:
A Bit of Nondeterminism Makes Pushdown Automata Expressive and Succinct. CoRR abs/2105.02611 (2021) - [i13]Udi Boker, Karoliina Lehtinen:
History Determinism vs. Good for Gameness in Quantitative Automata. CoRR abs/2110.14238 (2021) - [i12]Udi Boker, Karoliina Lehtinen:
Token Games and History-Deterministic Quantitative-Automata. CoRR abs/2110.14308 (2021) - 2020
- [j2]Karoliina Lehtinen, Udi Boker:
Register Games. Log. Methods Comput. Sci. 16(2) (2020) - [c13]Udi Boker, Denis Kuperberg, Karoliina Lehtinen, Michal Skrzypczak:
On the Succinctness of Alternating Parity Good-For-Games Automata. FSTTCS 2020: 41:1-41:13 - [c12]Karoliina Lehtinen, Martin Zimmermann:
Good-for-games ω-Pushdown Automata. LICS 2020: 689-702 - [i11]Karoliina Lehtinen, Martin Zimmermann:
Good-for-games ω-Pushdown Automata. CoRR abs/2001.04392 (2020) - [i10]Udi Boker, Denis Kuperberg, Karoliina Lehtinen, Michal Skrzypczak:
On Succinctness and Recognisability of Alternating Good-for-Games Automata. CoRR abs/2002.07278 (2020) - [i9]Udi Boker, Denis Kuperberg, Karoliina Lehtinen, Michal Skrzypczak:
On the Succinctness of Alternating Parity Good-for-Games Automata. CoRR abs/2009.14437 (2020)
2010 – 2019
- 2019
- [j1]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): 52:1-52:29 (2019) - [c11]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: 28-44 - [c10]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: 259-275 - [c9]Laure Daviaud, Marcin Jurdzinski, Karoliina Lehtinen:
Alternating Weak Automata from Universal Trees. CONCUR 2019: 18:1-18:14 - [c8]Udi Boker, Karoliina Lehtinen:
Good for Games Automata: From Nondeterminism to Alternation. CONCUR 2019: 19:1-19:16 - [c7]Luca Aceto, Antonis Achilleos, Adrian Francalanza, Anna Ingólfsdóttir, Karoliina Lehtinen:
An Operational Guide to Monitorability. SEFM 2019: 433-453 - [i8]Luca Aceto, Antonis Achilleos, Adrian Francalanza, Anna Ingólfsdóttir, Karoliina Lehtinen:
Adventures in Monitorability: From Branching to Linear Time and Back Again. CoRR abs/1902.00435 (2019) - [i7]Luca Aceto, Antonis Achilleos, Adrian Francalanza, Anna Ingólfsdóttir, Karoliina Lehtinen:
The Cost of Monitoring Alone. CoRR abs/1902.05152 (2019) - [i6]Udi Boker, Karoliina Lehtinen:
Register Games. CoRR abs/1902.10654 (2019) - [i5]Laure Daviaud, Marcin Jurdzinski, Karoliina Lehtinen:
Alternating Weak Automata from Universal Trees. CoRR abs/1903.12620 (2019) - [i4]Karoliina Lehtinen, Sven Schewe, Dominik Wojtczak:
Improving the complexity of Parys' recursive algorithm. CoRR abs/1904.11810 (2019) - [i3]Luca Aceto, Antonis Achilleos, Adrian Francalanza, Anna Ingólfsdóttir, Karoliina Lehtinen:
An Operational Guide to Monitorability. CoRR abs/1906.00766 (2019) - [i2]Udi Boker, Karoliina Lehtinen:
Good for Games Automata: From Nondeterminism to Alternation. CoRR abs/1906.11624 (2019) - 2018
- [c6]Udi Boker, Karoliina Lehtinen:
On the Way to Alternating Weak Automata. FSTTCS 2018: 21:1-21:22 - [c5]Karoliina Lehtinen:
A modal μ perspective on solving parity games in quasi-polynomial time. LICS 2018: 639-648 - 2017
- [c4]Karoliina Lehtinen, Sandra Quickert:
∑μ2 is decidable for ∏μ2. CiE 2017: 292-303 - [c3]Karoliina Lehtinen:
The descriptive complexity of modal mu model-checking parity games. GandALF 2017: 76-90 - [i1]Karoliina Lehtinen, Sandra Quickert:
Σμ2 is decidable for Πμ2. CoRR abs/1703.03239 (2017) - 2015
- [c2]Karoliina Lehtinen, Sandra Quickert:
Deciding the First Levels of the Modal mu Alternation Hierarchy by Formula Construction. CSL 2015: 457-471 - [c1]Karoliina Lehtinen:
Disjunctive form and the modal μ alternation hierarchy. FICS 2015: 117-131
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-15 21:37 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
