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

Richard Kenner

dblp:21/5937 · DBLP profile ↗
← Back
2ranked-venue papers
0as first author
0since 2021 · last 1992
—ORCID · none

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

Systems, architecture and hardware · 1Software 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 2 heaviest of 2, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Compilers and program optimization › compiler optimization › branch optimization
branch elimination		 0.011992
Eliminating Branches using a Superoptimizer and the GNU C Compiler · PLDI 1992
Compilers and program optimization › compiler optimization
superoptimization		 0.011992
Eliminating Branches using a Superoptimizer and the GNU C Compiler · PLDI 1992

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

superoptimizer · 0.0GNU C Compiler · 0.0
YearPublicationVenuePosition
1992 Eliminating Branches using a Superoptimizer and the GNU C Compiler
abstract
this paper uses the RS/6000 for all its examples, the techniques described here are applicable to most machines
Torbjörn Granlund, Richard Kenner
 PLDI2
1992 Hardware Combining and Scalability
abstract
Scalabilityrefers to the extent to which a system approaches perfect (linear) speedup with large numbers of processors.Fundamental physical laws limit scalability, but in practical terms, bottlenecks due to serialization points at critical sections are often the most immediate limitation on the scalability y of an architecture.The NYU Ultracomputer project
Susan R. Dickey, Richard Kenner
 SPAA2