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

Justin R. Smith

dblp:51/4712 · DBLP profile ↗
← Back
1ranked-venue papers
1as first author
0since 2021 · last 1986
—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.

Computer architecture, parallel and distributed computing, and storage systems
1 paper
Parallel and multicore computing · 100%
Theoretical computer science
1 paper
Graph algorithms and graph theory · 100%

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

TopicWeightPapersLastEvidence papers
Parallel and multicore computing › parallel algorithms
graph algorithms		 0.011986
Parallel Algorithms for Depth-First Searches I. Planar Graphs · SIAM J. Comput. 1986
Parallel and multicore computing
parallel algorithms		 0.011986
Parallel Algorithms for Depth-First Searches I. Planar Graphs · SIAM J. Comput. 1986
Graph algorithms and graph theory
planar graphs		 0.011986
Parallel Algorithms for Depth-First Searches I. Planar Graphs · SIAM J. Comput. 1986
Parallel and multicore computing › parallel algorithms › parallel algorithm analysis
work complexity		 0.011986
Parallel Algorithms for Depth-First Searches I. Planar Graphs · SIAM J. Comput. 1986

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

unbounded-parallel algorithm · 0.0
YearPublicationVenuePosition
1986 Parallel Algorithms for Depth-First Searches I. Planar Graphs
abstract
This paper presents an unbounded-parallel algorithm for performing a depth-first search of a planar undirected graph. The algorithm uses $O(n^4 )$ processors and executes in $O(\log ^3 n)$-time. It had previously been conjectured that the problem of computing a depth-first spanning tree was inherently sequential.
Justin R. Smith
 SIAM J. Comput.1