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.
EDBT 2026 Demo / reviewers in the wild / expert

J. M. Phelan

dblp:60/3994 · 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
Algorithms and data structures · 50% Logic in computer science · 50%

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

TopicWeightPapersLastEvidence papers
Logic in computer science
program analysis		 0.011974
A Note on the Hecht-Ullman Characterization of Nonreducible Flow Graphs · SIAM J. Comput. 1974

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

proof correction · 0.0graph theory · 0.0
YearPublicationVenuePosition
1974 A Note on the Hecht-Ullman Characterization of Nonreducible Flow Graphs
abstract
An anomaly in the proof of a theorem characterizing nonreducible flow graphs is pointed out. A proof is given which corrects for the anomaly and is fundamentally simpler than the original proof.
J. M. Adams, J. M. Phelan, Richard H. Stark
 SIAM J. Comput.2