Karoliina Lehtinen

About Karoliina Lehtinen

Karoliina Lehtinen, With an exceptional h-index of 12 and a recent h-index of 12 (since 2020), a distinguished researcher at University of Liverpool, specializes in the field of Logic, Automata, Games.

His recent articles reflect a diverse array of research interests and contributions to the field:

From Muller to parity and Rabin automata: Optimal transformations preserving (History) determinism

A bit of nondeterminism makes pushdown automata expressive and succinct

History-deterministic Timed Automata

When a little nondeterminism goes a long way: An introduction to history-determinism

A Brief History of History-Determinism (Invited Talk)

Token games and history-deterministic quantitative automata

A recursive approach to solving parity games in quasipolynomial time

On probabilistic monitorability

Karoliina Lehtinen Information

University

Position

___

Citations(all)

460

Citations(since 2020)

419

Cited By

162

hIndex(all)

12

hIndex(since 2020)

12

i10Index(all)

16

i10Index(since 2020)

14

Email

University Profile Page

Google Scholar

Karoliina Lehtinen Skills & Research Interests

Logic

Automata

Games

Top articles of Karoliina Lehtinen

From Muller to parity and Rabin automata: Optimal transformations preserving (History) determinism

TheoretiCS

2024/4/24

Karoliina Lehtinen
Karoliina Lehtinen

H-Index: 7

A bit of nondeterminism makes pushdown automata expressive and succinct

Logical Methods in Computer Science

2024/1/11

History-deterministic Timed Automata

arXiv preprint arXiv:2304.03183

2023/4/6

When a little nondeterminism goes a long way: An introduction to history-determinism

2023/2/14

Karoliina Lehtinen
Karoliina Lehtinen

H-Index: 7

A Brief History of History-Determinism (Invited Talk)

2023

Karoliina Lehtinen
Karoliina Lehtinen

H-Index: 7

Token games and history-deterministic quantitative automata

2022/3/29

Karoliina Lehtinen
Karoliina Lehtinen

H-Index: 7

A recursive approach to solving parity games in quasipolynomial time

Logical Methods in Computer Science

2022/1/12

On probabilistic monitorability

2022/12/29

Adrian Francalanza
Adrian Francalanza

H-Index: 20

Karoliina Lehtinen
Karoliina Lehtinen

H-Index: 7

History-deterministic timed automata are not determinizable

2022/10/12

History-deterministic parikh automata

arXiv preprint arXiv:2209.07745

2022/9/16

Parikh automata over infinite words

arXiv preprint arXiv:2207.07694

2022/12

A synthesis tool for optimal monitors in a branching-time setting

2022/6/13

Adrian Francalanza
Adrian Francalanza

H-Index: 20

Karoliina Lehtinen
Karoliina Lehtinen

H-Index: 7

On the size of good-for-games Rabin automata and its link with the memory in Muller games

arXiv preprint arXiv:2204.11333

2022/4/24

Karoliina Lehtinen
Karoliina Lehtinen

H-Index: 7

On the translation of automata to linear temporal logic

2022

Karoliina Lehtinen
Karoliina Lehtinen

H-Index: 7

Salomon Sickert
Salomon Sickert

H-Index: 11

History determinism vs. good for gameness in quantitative automata

arXiv preprint arXiv:2110.14238

2021/10/27

Karoliina Lehtinen
Karoliina Lehtinen

H-Index: 7

Better late than never or: verifying asynchronous components at runtime

2021/6/8

An operational guide to monitorability with applications to regular properties

Software and Systems Modeling

2021/4

Adrian Francalanza
Adrian Francalanza

H-Index: 20

Karoliina Lehtinen
Karoliina Lehtinen

H-Index: 7

The best a monitor can do

2021

Adrian Francalanza
Adrian Francalanza

H-Index: 20

Karoliina Lehtinen
Karoliina Lehtinen

H-Index: 7

On the succinctness of alternating parity good-for-games automata

arXiv preprint arXiv:2009.14437

2020/9/29

Karoliina Lehtinen
Karoliina Lehtinen

H-Index: 7

Michał Skrzypczak
Michał Skrzypczak

H-Index: 10

See List of Professors in Karoliina Lehtinen University(University of Liverpool)

Co-Authors

academic-engine