Thomas H. Spencer

24 papers A* 6B 1Journal 15Unranked 1
YearRankTypeTitle / Venue / Authors
1999 J jnl
Time-Work Tradeoffs of the Single-Source Shortest Paths Problem.
J. Algorithms
Hanmao Shi, Thomas H. Spencer
1998 J jnl
Separator-Based Sparsification II: Edge and Vertex Connectivity.
SIAM J. Comput.
David Eppstein, Zvi Galil, Giuseppe F. Italiano, Thomas H. Spencer
1997 J jnl
Time-work tradeoffs for parallel algorithms.
J. ACM
Thomas H. Spencer
1996 J jnl
Separator Based Sparsification. I. Planary Testing and Minimum Spanning Trees.
J. Comput. Syst. Sci.
David Eppstein, Zvi Galil, Giuseppe F. Italiano, Thomas H. Spencer
1994 J jnl
Parallel Approximate Matching.
Parallel Algorithms Appl.
Thomas H. Spencer
1994 J jnl
Provably Good Pattern Generators for a Random Pattern Test.
Algorithmica
Thomas H. Spencer
1994 J jnl
Solving Divide and Conquer Recurrences.
Comput. Sci. Educ.
Thomas H. Spencer
1993 J jnl
An Efficient Parallel Algorithm that Finds Independent Sets of Guaranteed Size.
SIAM J. Discret. Math.
Mark K. Goldberg, Thomas H. Spencer
1993 J jnl
Context-free languages.
SIGACT News
Thomas H. Spencer
1993 A* conf
Separator based sparsification for dynamic planar graph algorithms.
STOC
David Eppstein, Zvi Galil, Giuseppe F. Italiano, Thomas H. Spencer
1991 B conf
More Time-Work Tradeoffs for Parallel Graph Algorithms.
SPAA
Thomas H. Spencer
1991 — conf
Parallel matching on expanders.
SPDP
Thomas H. Spencer
1991 A* conf
Time-Work Tradeoffs for Parallel Graph Algorithms.
SODA
Thomas H. Spencer
1990 A* conf
An Efficient Parallel Algorithm that Finds Independent Sets of Guaranteed Size.
SODA
Mark K. Goldberg, Thomas H. Spencer
1989 J jnl
A New Parallel Algorithm for the Maximal Independent Set Problem.
SIAM J. Comput.
Mark K. Goldberg, Thomas H. Spencer
1989 J jnl
Constructing a Maximal Independent Set in Parallel.
SIAM J. Discret. Math.
Mark K. Goldberg, Thomas H. Spencer
1989 J jnl
Efficient implementation of graph algorithms using contraction.
J. ACM
Harold N. Gabow, Zvi Galil, Thomas H. Spencer
1987 A* conf
A New Parallel Algorithm for the Maximal Independent Set Problem
FOCS
Mark K. Goldberg, Thomas H. Spencer
1987 J jnl
Refined Complexity Analysis for Heap Operations.
J. Comput. Syst. Sci.
Michael L. Fredman, Thomas H. Spencer
1986 J jnl
Efficient algorithms for finding minimum spanning trees in undirected and directed graphs.
Comb.
Harold N. Gabow, Zvi Galil, Thomas H. Spencer, Robert Endre Tarjan
1986 — —
Weighted matching algorithms.
Thomas H. Spencer
1985 J jnl
Layout Influences Testability.
IEEE Trans. Computers
Thomas H. Spencer, Jacob Savir
1984 A* conf
Efficient Implementation of Graph Algorithms Using Contraction
FOCS
Harold N. Gabow, Zvi Galil, Thomas H. Spencer
1984 A* conf
Node Weighted Matching.
ICALP
Thomas H. Spencer, Ernst W. Mayr