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

Jens M. Dill

dblp:37/3331 · DBLP profile ↗
← Back
1ranked-venue papers
1as first author
0since 2021 · last 1989
—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 · 87% Algorithms and data structures · 13%

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

TopicWeightPapersLastEvidence papers
Automata and formal languages › formal grammars
attribute grammars		 0.011989
A counter-example for "A simpler construction for showing the intrinsically exponential complexity of the circularity problem for attribute grammars" · J. ACM 1989
Automata and formal languages › formal grammars › attribute grammars
circularity problem		 0.011989
A counter-example for "A simpler construction for showing the intrinsically exponential complexity of the circularity problem for attribute grammars" · J. ACM 1989
Algorithms and data structures › exact algorithms
exponential time algorithms		 0.011989
A counter-example for "A simpler construction for showing the intrinsically exponential complexity of the circularity problem for attribute grammars" · J. ACM 1989
YearPublicationVenuePosition
1989 A counter-example for "A simpler construction for showing the intrinsically exponential complexity of the circularity problem for attribute grammars"
abstract
Jazayeri [ J. ACM 28 , 4 (Oct. 1981), 715-720] proposes a simpler construction for use in the proof by Jazayeri et al. [ Commun. ACM 18 , 12 (Dec. 1975), 697-706] that the circularity problem for attribute grammars has inherent exponential time complexity. The simplification introduces a flaw that invalidates the proof. The flaw can be corrected, at the cost of eliminating some of the simplification claimed for the new construction.
Jens M. Dill
 J. ACM1