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 SIGIR 2026 / reviewers in the wild / expert

C. P. Earnest

dblp:73/5794 · DBLP profile ↗
← Back
1ranked-venue papers
1as first author
0since 2021 · last 1972
—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.

Software engineering, system software, and programming languages
1 paper
Compilers and program optimization · 77% Program analysis · 23%
Theoretical computer science
1 paper
Graph algorithms and graph theory · 100%

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

TopicWeightPapersLastEvidence papers
Compilers and program optimization
compiler optimization		 0.011972
Analysis of Graphs by Ordering of Nodes · J. ACM 1972
Graph algorithms and graph theory
graph ordering		 0.011972
Analysis of Graphs by Ordering of Nodes · J. ACM 1972
Program analysis › control flow analysis
control flow graph analysis		 0.011972
Analysis of Graphs by Ordering of Nodes · J. ACM 1972

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

graph ordering · 0.0directed graph analysis · 0.0
YearPublicationVenuePosition
1972 Analysis of Graphs by Ordering of Nodes
abstract
A method of analyzing directed graphs by establishing a particular ordering for the nodes is presented, and properties of the ordered graph are derived.Both the method and the resultant order are interesting graph-t heoretically, and also practically: the method is quite efficient, and the results of the analysis are particularly useful to an object code optimizer for programs.The paper includes examples of interesting graphs, and a conjecture about a refinement of the method.
C. P. Earnest, K. G. Balke
 J. ACM1