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

Stuart R. Soloway

dblp:85/4663 · DBLP profile ↗
← Back
2ranked-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 · 2 · 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%
Computer architecture, parallel and distributed computing, and storage systems
1 paper
Distributed systems · 100%

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

TopicWeightPapersLastEvidence papers
Routing and switching › routing protocol
distributed routing protocol		 0.011991
Distributed network protocols for changing topologies: a counterexample · IEEE Trans. Commun. 1991
Routing and switching › routing algorithms
shortest path routing		 0.011991
Distributed network protocols for changing topologies: a counterexample · IEEE Trans. Commun. 1991
Distributed systems
distributed algorithms		 0.011991
Distributed network protocols for changing topologies: a counterexample · IEEE Trans. Commun. 1991
Distributed systems
fault tolerance		 0.011991
Distributed network protocols for changing topologies: a counterexample · IEEE Trans. Commun. 1991
Distributed systems › distributed system verification
protocol verification		 0.011991
Distributed network protocols for changing topologies: a counterexample · IEEE Trans. Commun. 1991

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

counterexample construction · 0.0
YearPublicationVenuePosition
1991 Distributed network protocols for changing topologies: a counterexample
abstract
A number of distributed network protocols for reliable data transmission. connectivity test, shortest path, and topology broadcast have been proposed with claims that they operate correctly in the face of changing topology, without the need for unbounded numbers to identify different runs of the algorithms. It is shown that the protocols do not possess all the claimed properties and that they may not terminate, because they all share a basic flaw.>
Stuart R. Soloway, Pierre A. Humblet
 IEEE Trans. Commun.1
1989 Topology Broadcast Algorithms
Pierre A. Humblet, Stuart R. Soloway
 Comput. Networks2