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

Stephen Warshall

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

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

Applied, interdisciplinary, general and emerging computing · 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
Computational complexity · 50% Graph algorithms and graph theory · 50%

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

TopicWeightPapersLastEvidence papers
Computational complexity › algebraic complexity › matrix multiplication
boolean matrix multiplication		 0.011962
A Theorem on Boolean Matrices · J. ACM 1962
Graph algorithms and graph theory › graph algorithms
transitive closure		 0.011962
A Theorem on Boolean Matrices · J. ACM 1962
YearPublicationVenuePosition
1962 A Theorem on Boolean Matrices
abstract
No abstract available.
Stephen Warshall
 J. ACM1