 | 1999 |
|---|
| 21 |       | Hanmao Shi,
Thomas H. Spencer:
Time-Work Tradeoffs of the Single-Source Shortest Paths Problem.
J. Algorithms 30(1): 19-32 (1999) |
| 1998 |
|---|
| 20 | | David Eppstein,
Zvi Galil,
Giuseppe F. Italiano,
Thomas H. Spencer:
Separator-Based Sparsification II: Edge and Vertex Connectivity.
SIAM J. Comput. 28(1): 341-381 (1998) |
| 1997 |
|---|
| 19 |  | Thomas H. Spencer:
Time-work tradeoffs for parallel algorithms.
J. ACM 44(5): 742-778 (1997) |
| 1996 |
|---|
| 18 | | 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): 3-27 (1996) |
| 1994 |
|---|
| 17 | | Thomas H. Spencer:
Provably Good Pattern Generators for a Random Pattern Test.
Algorithmica 11(5): 429-442 (1994) |
| 16 | | Thomas H. Spencer:
Parallel Approximate Matching.
Parallel Algorithms Appl. 2(1-2): 115-121 (1994) |
| 1993 |
|---|
| 15 | | David Eppstein,
Zvi Galil,
Giuseppe F. Italiano,
Thomas H. Spencer:
Separator based sparsification for dynamic planar graph algorithms.
STOC 1993: 208-217 |
| 14 | | Mark K. Goldberg,
Thomas H. Spencer:
An Efficient Parallel Algorithm that Finds Independent Sets of Guaranteed Size.
SIAM J. Discrete Math. 6(3): 443-459 (1993) |
| 1991 |
|---|
| 13 | | Thomas H. Spencer:
Time-Work Tradeoffs for Parallel Graph Algorithms.
SODA 1991: 425-432 |
| 12 | | Thomas H. Spencer:
More Time-Work Tradeoffs for Parallel Graph Algorithms.
SPAA 1991: 81-93 |
| 11 | | Thomas H. Spencer:
Parallel matching on expanders.
SPDP 1991: 752-758 |
| 1990 |
|---|
| 10 | | Mark K. Goldberg,
Thomas H. Spencer:
An Efficient Parallel Algorithm that Finds Independent Sets of Guaranteed Size.
SODA 1990: 219-225 |
| 1989 |
|---|
| 9 | | Harold N. Gabow,
Zvi Galil,
Thomas H. Spencer:
Efficient implementation of graph algorithms using contraction.
J. ACM 36(3): 540-572 (1989) |
| 8 | | Mark K. Goldberg,
Thomas H. Spencer:
A New Parallel Algorithm for the Maximal Independent Set Problem.
SIAM J. Comput. 18(2): 419-427 (1989) |
| 7 | | Mark K. Goldberg,
Thomas H. Spencer:
Constructing a Maximal Independent Set in Parallel.
SIAM J. Discrete Math. 2(3): 322-328 (1989) |
| 1987 |
|---|
| 6 | | Mark K. Goldberg,
Thomas H. Spencer:
A New Parallel Algorithm for the Maximal Independent Set Problem
FOCS 1987: 161-165 |
| 5 | | Michael L. Fredman,
Thomas H. Spencer:
Refined Complexity Analysis for Heap Operations.
J. Comput. Syst. Sci. 35(3): 269-284 (1987) |
| 1986 |
|---|
| 4 | | Harold N. Gabow,
Zvi Galil,
Thomas H. Spencer,
Robert Endre Tarjan:
Efficient algorithms for finding minimum spanning trees in undirected and directed graphs.
Combinatorica 6(2): 109-122 (1986) |
| 1985 |
|---|
| 3 | | Thomas H. Spencer,
Jacob Savir:
Layout Influences Testability.
IEEE Trans. Computers 34(3): 287-290 (1985) |
| 1984 |
|---|
| 2 | | Harold N. Gabow,
Zvi Galil,
Thomas H. Spencer:
Efficient Implementation of Graph Algorithms Using Contraction
FOCS 1984: 347-357 |
| 1 | | Thomas H. Spencer,
Ernst W. Mayr:
Node Weighted Matching.
ICALP 1984: 454-464 |
