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

K. M. Chung

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

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

Systems, architecture and hardware · 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
Distributed systems · 50% Interconnection networks and networks-on-chip · 50%
Theoretical computer science
1 paper
Information theory · 100%

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

TopicWeightPapersLastEvidence papers
Interconnection networks and networks-on-chip › switching network
generalized connector		 0.011980
Construction of a Generalized Connector with 5.8 n log2 n Edges · IEEE Trans. Computers 1980
Distributed systems › peer-to-peer systems
network construction		 0.011980
Construction of a Generalized Connector with 5.8 n log2 n Edges · IEEE Trans. Computers 1980
Information theory › asymptotic analysis
asymptotic optimality		 0.011980
Construction of a Generalized Connector with 5.8 n log2 n Edges · IEEE Trans. Computers 1980

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

construction · 0.0lower bounds · 0.0lower bound · 0.0
YearPublicationVenuePosition
1980 Construction of a Generalized Connector with 5.8 n log2 n Edges
abstract
In this correspondence we present a simple construction of a generalized connector with 5.8n log2n edges, which is an improvement over a previous construction proposed by Thompson and requiring 7.6n log2n edges. Specifically, we propose a construction for a generalizer with only 2n log2n edges as against that proposed by Thompson with 3.8n log2n edges.
K. M. Chung, Chak-Kuen Wong
 IEEE Trans. Computers1