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

J. L. Rangel

dblp:84/766 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
0since 2021 · last 1975
—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 · 67% Computational complexity · 33%

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

TopicWeightPapersLastEvidence papers
Automata and formal languages
context-free languages		 0.011975
Decidability of Equivalence, Containment, Intersection, and Separability of Context-Free Languages (Extended Abstract) · FOCS 1975
Computational complexity
decidability		 0.011975
Decidability of Equivalence, Containment, Intersection, and Separability of Context-Free Languages (Extended Abstract) · FOCS 1975
Automata and formal languages
equivalence and containment		 0.011975
Decidability of Equivalence, Containment, Intersection, and Separability of Context-Free Languages (Extended Abstract) · FOCS 1975
YearPublicationVenuePosition
1975 Decidability of Equivalence, Containment, Intersection, and Separability of Context-Free Languages (Extended Abstract)
Harry B. Hunt III, J. L. Rangel
 FOCS2