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

Chao-Tsung Wu

dblp:23/2222 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
0since 2021 · last 1995
—ORCID · unresolved

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

Systems, architecture and hardware · 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.

Theoretical computer science
1 paper
Distributed computing theory · 61% Graph algorithms and graph theory · 30% Algorithms and data structures · 9%

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

TopicWeightPapersLastEvidence papers
Distributed computing theory
broadcast		 0.011995
An Optimal Broadcasting Algorithm without Message Redundancy in Star Graphs · IEEE Trans. Parallel Distributed Syst. 1995
Distributed computing theory
interconnection networks		 0.011995
An Optimal Broadcasting Algorithm without Message Redundancy in Star Graphs · IEEE Trans. Parallel Distributed Syst. 1995
Graph algorithms and graph theory › graph classes
star graphs		 0.011995
An Optimal Broadcasting Algorithm without Message Redundancy in Star Graphs · IEEE Trans. Parallel Distributed Syst. 1995
Algorithms and data structures
parallel algorithms		 0.011995
An Optimal Broadcasting Algorithm without Message Redundancy in Star Graphs · IEEE Trans. Parallel Distributed Syst. 1995

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

distributed algorithm design · 0.0complexity analysis · 0.0
YearPublicationVenuePosition
1995 An Optimal Broadcasting Algorithm without Message Redundancy in Star Graphs
abstract
Based on the V.E. Mendia and D. Sarkar's algorithm (1992), we propose an optimal and nonredundant distributed broadcasting algorithm in star graphs. For an n-dimensional star graph, our algorithm takes O(n log/sub 2/ n) time and guarantees that all nodes in the star graph receive the message exactly once. Moreover, broadcasting m packets in a pipeline fashion takes O(m log/sub 2/ n+n log/sub 2/ n) time due to the nonredundant property of our broadcasting algorithm.>
Jang-Ping Sheu, Chao-Tsung Wu, Tzung-Shi Chen
 IEEE Trans. Parallel Distributed Syst.2