Karoliina Lehtinen

According to our database1, Karoliina Lehtinen authored at least 19 papers between 2015 and 2021.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2021
The Best a Monitor Can Do.
Proceedings of the 29th EACSL Annual Conference on Computer Science Logic, 2021

2020
Register Games.
Log. Methods Comput. Sci., 2020

On Succinctness and Recognisability of Alternating Good-for-Games Automata.
CoRR, 2020

Good-for-games ω-Pushdown Automata.
Proceedings of the LICS '20: 35th Annual ACM/IEEE Symposium on Logic in Computer Science, 2020

On the Succinctness of Alternating Parity Good-For-Games Automata.
Proceedings of the 40th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2020

2019
Adventures in monitorability: from branching to linear time and back again.
Proc. ACM Program. Lang., 2019

Improving the complexity of Parys' recursive algorithm.
CoRR, 2019

An Operational Guide to Monitorability.
Proceedings of the Software Engineering and Formal Methods - 17th International Conference, 2019

Alternating Weak Automata from Universal Trees.
Proceedings of the 30th International Conference on Concurrency Theory, 2019

Good for Games Automata: From Nondeterminism to Alternation.
Proceedings of the 30th International Conference on Concurrency Theory, 2019

The Cost of Monitoring Alone.
Proceedings of the From Reactive Systems to Cyber-Physical Systems, 2019

Testing Equivalence vs. Runtime Monitoring.
Proceedings of the Models, Languages, and Tools for Concurrent and Distributed Programming, 2019

2018
A modal μ perspective on solving parity games in quasi-polynomial time.
Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science, 2018

On the Way to Alternating Weak Automata.
Proceedings of the 38th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2018

2017
The descriptive complexity of modal mu model-checking parity games.
Proceedings of the Proceedings Eighth International Symposium on Games, 2017

Σ<sup>μ</sup><sub>2</sub> is decidable for Π<sup>μ</sup><sub>2</sub>.
CoRR, 2017

∑<sup>μ</sup><sub>2</sub> is decidable for ∏<sup>μ</sup><sub>2</sub>.
Proceedings of the Unveiling Dynamics and Complexity, 2017

2015
Disjunctive form and the modal μ alternation hierarchy.
Proceedings of the Proceedings Tenth International Workshop on Fixed Points in Computer Science, 2015

Deciding the First Levels of the Modal mu Alternation Hierarchy by Formula Construction.
Proceedings of the 24th EACSL Annual Conference on Computer Science Logic, 2015


  Loading...