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

Men-Yang Lin

dblp:39/1748 · DBLP profile ↗
← Back
3ranked-venue papers
0as first author
0since 2021 · last 2003
—ORCID · none

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

Systems, architecture and hardware · 1Computer networks · 1Theory of computation · 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.

Computer architecture, parallel and distributed computing, and storage systems
1 paper
Hardware reliability and fault tolerance · 87% Interconnection networks and networks-on-chip · 13%
Theoretical computer science
1 paper
Graph algorithms and graph theory · 100%

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

TopicWeightPapersLastEvidence papers
Hardware reliability and fault tolerance › network fault tolerance
edge fault tolerance
0.011997
Multiple-Edge-Fault Tolerance with Respect to Hypercubes · IEEE Trans. Parallel Distributed Syst. 1997
Hardware reliability and fault tolerance › network fault tolerance
fault-tolerant interconnection network
0.011997
Multiple-Edge-Fault Tolerance with Respect to Hypercubes · IEEE Trans. Parallel Distributed Syst. 1997
Graph algorithms and graph theory › graph classes
hypercube
0.011997
Multiple-Edge-Fault Tolerance with Respect to Hypercubes · IEEE Trans. Parallel Distributed Syst. 1997
Interconnection networks and networks-on-chip
hypercube network
0.011997
Multiple-Edge-Fault Tolerance with Respect to Hypercubes · IEEE Trans. Parallel Distributed Syst. 1997

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

graph construction · 0.0
YearPublicationVenuePosition
2003 Cycle embedding in faulty wrapped butterfly graphs
Chang-Hsiung Tsai, Tyne Liang, Lih-Hsing Hsu, Men-Yang Lin
Networks4
1998 A New Family of Optimal 1-Hamiltonian Graphs with Small Diameter
Jeng-Jung Wang, Ting-Yi Sung, Lih-Hsing Hsu, Men-Yang Lin
COCOON4
1997 Multiple-Edge-Fault Tolerance with Respect to Hypercubes
abstract
Previous works on edge-fault tolerance with respect to hypercubes Q/sub n/ are mainly focused on 1-edge fault and 2- or 3-edge fault with limited size of n. We give a construction scheme for 2-EFT(Q/sub n/) graphs and 3-EFT(Q/sub n/) graphs, where n is arbitrarily large. In our constructions, approximately log n extra degree is added to the vertices of Q/sub n/ for 2-edge-fault tolerance, and one more degree for 3-edge-fault tolerance.
Ting-Yi Sung, Men-Yang Lin, Tung-Yang Ho
IEEE Trans. Parallel Distributed Syst.2