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.

K. Weiss

dblp:22/7041 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
0since 2021 · last 1974
—ORCID · none

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

Theory of computation · 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
Automata and formal languages · 77% Computational complexity · 23%

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

TopicWeightPapersLastEvidence papers
Automata and formal languages › context-free languages
context-free rewriting systems
0.011974
On the Complexity of Regulated Context-Free Rewriting · Inf. Control. 1974

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

regulated context-free rewriting · 0.0
YearPublicationVenuePosition
1974 On the Complexity of Regulated Context-Free Rewriting
Armin B. Cremers, Otto Mayer, K. Weiss
Inf. Control.3