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

Jinzhi Tan

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

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

Computer networks · 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
Interconnection networks and networks-on-chip · 100%

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

TopicWeightPapersLastEvidence papers
Interconnection networks and networks-on-chip › switching network
multistage interconnection network
0.112007
Strictly Nonblocking f-Cast Logd(N, m, p) Networks · IEEE Trans. Commun. 2007
Interconnection networks and networks-on-chip › nonblocking networks
strictly nonblocking networks
0.112007
Strictly Nonblocking f-Cast Logd(N, m, p) Networks · IEEE Trans. Commun. 2007

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

combinatorial analysis · 0.1
YearPublicationVenuePosition
2007 Strictly Nonblocking f-Cast Logd(N, m, p) Networks
abstract
Necessary and sufficient conditions for Logd(N,m,p) network to be point-to-point strictly nonblocking are known. Recently, Kabacinski and Danilewicz obtained necessary and sufficient conditions for the Log2(N,0,p) network to be broadcast strictly nonblocking. In this paper, we give necessary and sufficient conditions for Logd(N,m,p) to be f-cast strictly nonblocking for every f, thus covering the point-to-point case (f=1) and the broadcast case (f=N) as special cases
Frank K. Hwang, Jinzhi Tan
IEEE Trans. Commun.3