Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.

Klaus Indermark

dblp:i/KIndermark · DBLP profile ↗
← Back
8ranked-venue papers
7as first author
0since 2021 · last 2006
—ORCID · none

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

Theory of computation · 8 · 7 first-author

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
2 papers
Automata and formal languages · 84% Computational complexity · 16%

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

TopicWeightPapersLastEvidence papers
Automata and formal languages › automata on infinite objects
infinite trees
0.011983
Complexity of Infinite Trees · ICALP 1983
Computational complexity › computability theory › recursive functions
primitive recursive functions
0.011972
Hierarchies of Primitive Recursive Wordfunctions and Transductions Defined by Automata · ICALP 1972
Automata and formal languages
transductions
0.011972
Hierarchies of Primitive Recursive Wordfunctions and Transductions Defined by Automata · ICALP 1972
Automata and formal languages › transductions
wordfunctions
0.011972
Hierarchies of Primitive Recursive Wordfunctions and Transductions Defined by Automata · ICALP 1972
YearPublicationVenuePosition
2006 Algebraic Correctness Proofs for Compiling Recursive Function Definitions with Strictness Information
Klaus Indermark, Thomas Noll 0001
Acta Informatica1
1987 Efficient Implementation of Structural Recursion
Klaus Indermark, Herbert Klaeren
FCT1
1983 Complexity of Infinite Trees
Klaus Indermark
ICALP1
1982 On Rational Definitions in Complete Algebras without Rank
Klaus Indermark
Theor. Comput. Sci.1
1976 Schemes with Recursion on Higher Types
Klaus Indermark
MFCS1
1975 The Continuous Algebra of Monadic Languages
Klaus Indermark
MFCS1
1973 On Ianov Schemas with One Memory Location
Klaus Indermark
MFCS1
1972 Hierarchies of Primitive Recursive Wordfunctions and Transductions Defined by Automata
Friedrich W. von Henke, Klaus Indermark, Klaus Weihrauch
ICALP2