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.
? Tutorial for this page
Demo Data from EDBT 2026 / reviewers in the wild / expert

Johannes Osterholzer

dblp:147/8509 · DBLP profile ↗
← Back
4ranked-venue papers
3as first author
0since 2021 · last 2019
—ORCID · none

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

Theory of computation · 4 · 3 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
1 paper
Automata and formal languages · 100%

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

TopicWeightPapersLastEvidence papers
Automata and formal languages › formal language operations
inverse homomorphism		 0.412019
Linear context-free tree languages and inverse homomorphisms · Inf. Comput. 2019
Automata and formal languages › formal language operations
morphisms		 0.412019
Linear context-free tree languages and inverse homomorphisms · Inf. Comput. 2019

Methods — techniques the papers use, named apart from their topics

tree automata · 0.4formal language theory · 0.4
YearPublicationVenuePosition
2019 Linear context-free tree languages and inverse homomorphisms
Johannes Osterholzer, Toni Dietze, Luisa Herrmann 0001
 Inf. Comput.1
2016 Linear Context-Free Tree Languages and Inverse Homomorphisms
Johannes Osterholzer, Toni Dietze, Luisa Herrmann 0001
 LATA1
2015 A link between multioperator and tree valuation automata and logics
Markus Teichmann, Johannes Osterholzer
 Theor. Comput. Sci.2
2014 Pushdown Machines for Weighted Context-Free Tree Translation
Johannes Osterholzer
 CIAA1