Thomas H. Spencer
Publication record assembled from the DBLP archive of ranked conferences.
Papers indexed
7
Venues
5
Active years
1984–1993
Best venue rank
A*
Where they publish
Papers
7 indexed papers, newest first.
| Year | Venue | Title | Authors |
|---|---|---|---|
| 1993 | STOC | Separator based sparsification for dynamic planar graph algorithms. | David Eppstein, Zvi Galil, Giuseppe F. Italiano, Thomas H. Spencer |
| 1991 | SODA | Time-Work Tradeoffs for Parallel Graph Algorithms. | Thomas H. Spencer |
| 1991 | SPAA | More Time-Work Tradeoffs for Parallel Graph Algorithms. | Thomas H. Spencer |
| 1990 | SODA | An Efficient Parallel Algorithm that Finds Independent Sets of Guaranteed Size. | Mark K. Goldberg, Thomas H. Spencer |
| 1987 | FOCS | A New Parallel Algorithm for the Maximal Independent Set Problem | Mark K. Goldberg, Thomas H. Spencer |
| 1984 | FOCS | Efficient Implementation of Graph Algorithms Using Contraction | Harold N. Gabow, Zvi Galil, Thomas H. Spencer |
| 1984 | ICALP | Node Weighted Matching. | Thomas H. Spencer, Ernst W. Mayr |