Lars Kuhtz

dblp:98/3297 · DBLP profile ↗
← Back
4ranked-venue papers
2as first author
0since 2021 · last 2011
0009-0009-5916-7968ORCID · reported

Domains — the database's venue-derived domains; a paper can count in several

Theory of computation · 3 · 2 first-authorSoftware engineering, systems software and programming languages · 1Databases, data management, data science and information retrieval · 1

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Theoretical computer science
1 paper
Logic in computer science · 77% Computational complexity · 23%

Topics — the 2 heaviest of 2, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Logic in computer science › temporal logic
linear temporal logic
0.112009
LTL Path Checking Is Efficiently Parallelizable · ICALP (2) 2009
Computational complexity
parallel complexity
0.012009
LTL Path Checking Is Efficiently Parallelizable · ICALP (2) 2009
YearPublicationVenuePosition
2011 Weak Kripke Structures and LTL
Lars Kuhtz, Bernd Finkbeiner
CONCUR1
2009 LTL Path Checking Is Efficiently Parallelizable
Lars Kuhtz, Bernd Finkbeiner
ICALP (2)1
2009 Monitor Circuits for LTL with Bounded and Unbounded Future
Bernd Finkbeiner, Lars Kuhtz
RV2
2006 An improved algorithm for approximating the chromatic number of Gn, p
Amin Coja-Oghlan, Lars Kuhtz
Inf. Process. Lett.2