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

Feng-Shr Jiang

dblp:25/511 · DBLP profile ↗
← Back
1ranked-venue papers
1as first author
0since 2021 · last 1997
—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
Interconnection networks and networks-on-chip · 87% Hardware reliability and fault tolerance · 13%

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

TopicWeightPapersLastEvidence papers
Interconnection networks and networks-on-chip › graph embedding
hypercube embedding		 0.011997
Embedding of Generalized Fibonacci Cubes in Hypercubes with Faulty Nodes · IEEE Trans. Parallel Distributed Syst. 1997
Interconnection networks and networks-on-chip
network topology		 0.011997
Embedding of Generalized Fibonacci Cubes in Hypercubes with Faulty Nodes · IEEE Trans. Parallel Distributed Syst. 1997
Hardware reliability and fault tolerance › network fault tolerance
faulty node tolerance		 0.011997
Embedding of Generalized Fibonacci Cubes in Hypercubes with Faulty Nodes · IEEE Trans. Parallel Distributed Syst. 1997

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

graph embedding · 0.0fault tolerance analysis · 0.0
YearPublicationVenuePosition
1997 Embedding of Generalized Fibonacci Cubes in Hypercubes with Faulty Nodes
abstract
The generalized Fibonacci cubes (abbreviated to GFCs) were recently proposed as a class of interconnection topologies, which cover a spectrum ranging from regular graphs such as the hypercube to semiregular graphs such as the second order Fibonacci cube. It has been shown that the kth order GFC of dimension n+k is equivalent to an n-cube for 0/spl les/n
Feng-Shr Jiang, Shi-Jinn Horng, Tzong-Wann Kao
 IEEE Trans. Parallel Distributed Syst.1