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 SIGIR 2026 / reviewers in the wild / expert

John W. Nieto

dblp:122/1498 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
0since 2021 · last 1993
—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 networks
1 paper
Network optimization and economics · 100%
Computer architecture, parallel and distributed computing, and storage systems
1 paper
Distributed systems · 100%

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

TopicWeightPapersLastEvidence papers
Network optimization and economics › network design
link assignment		 0.011993
An adaptive link assignment algorithm for dynamically changing topologies · IEEE Trans. Commun. 1993
Distributed systems
fault tolerance		 0.011993
An adaptive link assignment algorithm for dynamically changing topologies · IEEE Trans. Commun. 1993

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

distributed optimization · 0.0graph-theoretic algorithms · 0.0graph-theoretic algorithm · 0.0
YearPublicationVenuePosition
1993 An adaptive link assignment algorithm for dynamically changing topologies
abstract
An adaptive link assignment algorithm for the distributed optimization of dynamically changing network topologies is presented. The algorithm is responsible for determining the network connectivity by controlling the selection of links to be established and disconnected. This algorithm is designed to recover from predictable link outages as well as massive unpredictable failures. To minimize computational time complexity as well as to improve transient response. Some known graph-theoretic algorithms are utilized.>
Michael D. Noakes, J. Bibb Cain, John W. Nieto, Edwin L. Althouse
 IEEE Trans. Commun.3