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

Zhonghe Wang

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

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

Computer networks · 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 networks
1 paper
Routing and switching · 100%

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

TopicWeightPapersLastEvidence papers
Routing and switching › routing
distributed routing
0.011991
An optimal distributed routing algorithm · IEEE Trans. Commun. 1991
Routing and switching › routing algorithms
optimal routing
0.011991
An optimal distributed routing algorithm · IEEE Trans. Commun. 1991
Routing and switching
routing algorithms
0.011991
An optimal distributed routing algorithm · IEEE Trans. Commun. 1991

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

variable reduction method · 0.0newton's method · 0.0
YearPublicationVenuePosition
1991 An optimal distributed routing algorithm
abstract
A distributed optimal one-level routing algorithm is presented. The algorithm is based on Newton's method. Using the variable reduction method, the Hessian matrix becomes diagonal. An example shows that the algorithm has a much faster convergence rate, more accurate results, and better transient behavior than previous work. The algorithm is shown to be convergent, stable, robust, and loop free.>
Zhonghe Wang, Douglas W. Browning
IEEE Trans. Commun.1