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

Frantisek Sovis

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

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

Systems, architecture and hardware · 1 · 1 first-authorSoftware engineering, systems software and programming languages · 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 · 100%

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

TopicWeightPapersLastEvidence papers
Interconnection networks and networks-on-chip › switching network › multistage interconnection network
benes network		 0.011983
Uniform Theory of the Shuffle-Exchange Type Permutation Networks · ISCA 1983
Interconnection networks and networks-on-chip › switching network
multistage interconnection network		 0.011983
Uniform Theory of the Shuffle-Exchange Type Permutation Networks · ISCA 1983
Interconnection networks and networks-on-chip
permutation network		 0.011983
Uniform Theory of the Shuffle-Exchange Type Permutation Networks · ISCA 1983
Interconnection networks and networks-on-chip › switching network › multistage interconnection network
shuffle-exchange network		 0.011983
Uniform Theory of the Shuffle-Exchange Type Permutation Networks · ISCA 1983

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

ek stage theory · 0.0
YearPublicationVenuePosition
1983 Uniform Theory of the Shuffle-Exchange Type Permutation Networks
abstract
This paper presents the uniform theory for describing of the shuffle-exchange type permutation networks - the theory of Ek stages. The use of this new approach is demonstrated by applying it to the flip, omega, and other incomplete permutation networks and to some complete networks /e.g. the Beneš network/ as well. Especially the paper deals with the p, 2p, and /2p=1/-stage networks, where p = log2n and n is number of the inputs /or outputs/ of these networks.
Frantisek Sovis
 ISCA1