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

Henry R. Bauer III

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

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

Software engineering, systems software and programming languages · 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.

Software engineering, system software, and programming languages
1 paper
Compilers and program optimization · 100%

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

TopicWeightPapersLastEvidence papers
Compilers and program optimization
dependence analysis		 0.011989
The Program Dependence Graph and Vectorization · POPL 1989
Compilers and program optimization › dependence analysis
program dependence graph		 0.011989
The Program Dependence Graph and Vectorization · POPL 1989
Compilers and program optimization
vectorization		 0.011989
The Program Dependence Graph and Vectorization · POPL 1989
Compilers and program optimization › program transformation › control flow transformation
if-conversion		 0.011989
The Program Dependence Graph and Vectorization · POPL 1989

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

data dependence analysis · 0.0
YearPublicationVenuePosition
1989 The Program Dependence Graph and Vectorization
abstract
Previous attempts at vectorizing programs written in a sequential high level language focused on converting control dependences to data dependences using a mechanism known as IF-conversion. After IF-conversion vector optimizations are performed on a data dependence graph. However, IF-conversion is an irrevocable process which can introduce high run-time overhead if the input program is not amenable to vectorization.
William Baxter, Henry R. Bauer III
 POPL2