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

Stephen Guattery

dblp:26/2898 · DBLP profile ↗
← Back
4ranked-venue papers
4as first author
0since 2021 · last 1999
—ORCID · none

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

Theory of computation · 3 · 3 first-authorSystems, architecture and hardware · 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
3 papers
Graph algorithms and graph theory · 77% Algorithms and data structures · 23%
Computer architecture, parallel and distributed computing, and storage systems
1 paper
Performance modeling and evaluation · 100%

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

TopicWeightPapersLastEvidence papers
Graph algorithms and graph theory
graph partitioning		 0.021997
The Path Resistance Method for Bounding lambda2 of a Laplacian · SODA 1997
On the Performance of Spectral Graph Partitioning Methods · SODA 1995
Graph algorithms and graph theory › spectral graph theory
laplacian spectrum		 0.011997
The Path Resistance Method for Bounding lambda2 of a Laplacian · SODA 1997
Graph algorithms and graph theory
spectral graph theory		 0.011997
The Path Resistance Method for Bounding lambda2 of a Laplacian · SODA 1997
Graph algorithms and graph theory › graph clustering
spectral clustering		 0.011995
On the Performance of Spectral Graph Partitioning Methods · SODA 1995

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

spectral methods · 0.0path resistance method · 0.0
YearPublicationVenuePosition
1999 Estimating Interpolation Error: A Combinatorial Approach
Stephen Guattery, Gary L. Miller, Noel Walkington
 SODA1
1997 The Path Resistance Method for Bounding lambda2 of a Laplacian
Stephen Guattery, Frank Thomson Leighton, Gary L. Miller
 SODA1
1995 On the Performance of Spectral Graph Partitioning Methods
Stephen Guattery, Gary L. Miller
 SODA1
1992 A Contraction Procedure for Planar Directed Graphs
abstract
We show that testing reachability in a planar DAG can be performed in parallel in O(log n log n) time (O(log n) time using randomization) using O(n) processors. In general we give a paradigm for contracting a planar DAG to a point and then expanding it back. This paradigm is developed from a property of planar directed graphs we refer to as the Poincar'e index formula. Using this new paradigm we then "overlay" our application in a fashion similar to parallel tree contraction [MR85, MR89]. We also discuss some of the changes needed to extend the reduction procedure to work for general planar digraphs. Using the strongly-connected components algorithm of Kao [Kao91] we can compute multiple-source reachability for general planar digraphs in O(log 3 n) time using O(n) processors. This improves the results of Kao and Klein [KK90] who showed that this problem could be performed in O(log 5 n) time using O(n) processors. This work represents initial results of an effort to develop effi...
Stephen Guattery, Gary L. Miller
 SPAA1