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

Richard A. Koch

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

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

Theory of computation · 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.

Computer architecture, parallel and distributed computing, and storage systems
1 paper
Interconnection networks and networks-on-chip · 30% Electronic design automation · 30% Performance modeling and evaluation · 30%

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

TopicWeightPapersLastEvidence papers
Interconnection networks and networks-on-chip › switching network › multistage interconnection network
butterfly network		 0.011988
Increasing the Size of a Network by a Constant Factor Can Increase Performance by More Than a Constant Factor · FOCS 1988
Performance modeling and evaluation
queueing models		 0.011988
Increasing the Size of a Network by a Constant Factor Can Increase Performance by More Than a Constant Factor · FOCS 1988
Electronic design automation › physical design › routing
routing performance		 0.011988
Increasing the Size of a Network by a Constant Factor Can Increase Performance by More Than a Constant Factor · FOCS 1988
Parallel and multicore computing
parallel architecture		 0.011988
Increasing the Size of a Network by a Constant Factor Can Increase Performance by More Than a Constant Factor · FOCS 1988

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

probabilistic analysis · 0.0nonlinear difference equations · 0.0
YearPublicationVenuePosition
1988 Increasing the Size of a Network by a Constant Factor Can Increase Performance by More Than a Constant Factor
abstract
In one routing scheme which has been implemented on a parallel architecture based on the butterfly graph, messages are sometimes destroyed. It is shown that if messages are sent to random destinations, the expected number of messages that reach their destinations is Theta (n(log n)-1/q), where n is the size of the butterfly graph and q is the number of messages that can move through one edge (or, equivalently, vertex) in one time step. In the analysis of this problem, interesting techniques for solving nonlinear systems of difference equations are developed that could have applications to other problems.>
Richard A. Koch
 FOCS1