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

Christopher Bader

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

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

Applied, interdisciplinary, general and emerging computing · 1 · 1 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 2, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Automata and formal languages
context-free languages		 0.011982
A Generalization of Ogden's Lemma · J. ACM 1982
Automata and formal languages › regular languages
pumping lemma		 0.011982
A Generalization of Ogden's Lemma · J. ACM 1982

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

iteration lemma · 0.0counterexample construction · 0.0
YearPublicationVenuePosition
1982 A Generalization of Ogden's Lemma
abstract
Excluded positions" are incorporated into a modified form of Ogden's lemma, and a language satisfying the latter, which the authors' generalized lemma can show fails to be context-free, is presented.It is also shown that in a fairly general sense there ts no function relating the number of distinguished and excluded posnions which would allow the authors' Iteration lemma to characterize the context-free languages.Categones and SubJect Descriptors' F 4.2
Christopher Bader, Arnaldo Moura
 J. ACM1