Thomas H. Spencer

Publication Activity (10 Years)

Years Active: 1984-1999
Publications (10 Years): 0

Publications

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