Thomas H. Spencer

According to our database, Thomas H. Spencer authored at least 21 papers between 1984 and 1999.

Collaborative distances:

• Dijkstra number of three.
• Erdős number of three.

1999

Time-Work Tradeoffs of the Single-Source Shortest Paths Problem.

Hanmao Shi, Thomas H. Spencer

J. Algorithms, 1999

1998

Separator-Based Sparsification II: Edge and Vertex Connectivity.

David Eppstein, Zvi Galil, Giuseppe F. Italiano, Thomas H. Spencer

SIAM J. Comput., 1998

1997

Time-work tradeoffs for parallel algorithms.

Thomas H. Spencer

J. ACM, 1997

1996

Separator Based Sparsification. I. Planary Testing and Minimum Spanning Trees.

David Eppstein, Zvi Galil, Giuseppe F. Italiano, Thomas H. Spencer

J. Comput. Syst. Sci., 1996

1994

Parallel Approximate Matching.

Thomas H. Spencer

Parallel Algorithms Appl., 1994

Solving Divide and Conquer Recurrences.

Thomas H. Spencer

Comput. Sci. Educ., 1994

Provably Good Pattern Generators for a Random Pattern Test.

Thomas H. Spencer

Algorithmica, 1994

1993

Context-free languages.

Thomas H. Spencer

SIGACT News, 1993

An Efficient Parallel Algorithm that Finds Independent Sets of Guaranteed Size.

Mark K. Goldberg, Thomas H. Spencer

SIAM J. Discret. Math., 1993

Separator based sparsification for dynamic planar graph algorithms.

David Eppstein, Zvi Galil, Giuseppe F. Italiano, Thomas H. Spencer

Proceedings of the Twenty-Fifth Annual ACM Symposium on Theory of Computing, 1993

1991

Parallel matching on expanders.

Thomas H. Spencer

Proceedings of the Third IEEE Symposium on Parallel and Distributed Processing, 1991

More Time-Work Tradeoffs for Parallel Graph Algorithms.

Thomas H. Spencer

Proceedings of the 3rd Annual ACM Symposium on Parallel Algorithms and Architectures, 1991

Time-Work Tradeoffs for Parallel Graph Algorithms.

Thomas H. Spencer

Proceedings of the Second Annual ACM/SIGACT-SIAM Symposium on Discrete Algorithms, 1991

1989

Constructing a Maximal Independent Set in Parallel.

Mark K. Goldberg, Thomas H. Spencer

SIAM J. Discret. Math., 1989

A New Parallel Algorithm for the Maximal Independent Set Problem.

Mark K. Goldberg, Thomas H. Spencer

SIAM J. Comput., 1989

Efficient implementation of graph algorithms using contraction.

Harold N. Gabow, Zvi Galil, Thomas H. Spencer

J. ACM, 1989

1987

Refined Complexity Analysis for Heap Operations.

Michael L. Fredman, Thomas H. Spencer

J. Comput. Syst. Sci., 1987

1986

Weighted matching algorithms.

Thomas H. Spencer

PhD thesis, 1986

Efficient algorithms for finding minimum spanning trees in undirected and directed graphs.

Harold N. Gabow, Zvi Galil, Thomas H. Spencer, Robert Endre Tarjan

Comb., 1986

1985

Layout Influences Testability.

Thomas H. Spencer, Jacob Savir

IEEE Trans. Computers, 1985

1984

Node Weighted Matching.

Thomas H. Spencer, Ernst W. Mayr

Proceedings of the Automata, 1984