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

John S. Carson

dblp:13/978 · also John S. Carson II · DBLP profile ↗
← Back
1ranked-venue papers
1as first author
0since 2021 · last 1977
—ORCID · none

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

Theory of computation · 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.

Theoretical computer science
1 paper
Graph algorithms and graph theory · 100%

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

TopicWeightPapersLastEvidence papers
Graph algorithms and graph theory › shortest path
all-pairs shortest paths		 0.011977
A Note on Spira's Algorithm for the All-Pairs Shortest-Path Problem · SIAM J. Comput. 1977
Graph algorithms and graph theory
shortest path		 0.011977
A Note on Spira's Algorithm for the All-Pairs Shortest-Path Problem · SIAM J. Comput. 1977
Graph algorithms and graph theory › shortest path › single-source shortest paths
dijkstra's algorithm		 0.011977
A Note on Spira's Algorithm for the All-Pairs Shortest-Path Problem · SIAM J. Comput. 1977

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

empirical comparison · 0.0asymptotic analysis · 0.0
YearPublicationVenuePosition
1977 A Note on Spira's Algorithm for the All-Pairs Shortest-Path Problem
abstract
We correct some errors in Spira’s algorithm for the all-pairs shortest-path problem, and empirically compare his algorithm (with two distinct sorting, routines) to Dijkstra’s procedure. The results show that Spira’s algorithm is only efficient for “large” networks. Furthermore, it is seen that the asymptotic number of additions and comparisons required by two algorithms may be a very poor indicator of their relative running times.
John S. Carson, Averill M. Law
 SIAM J. Comput.1