Search the dblp DataBase
Thomas H. Spencer: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]
Publications of Author
- Harold N. Gabow, Zvi Galil, Thomas H. Spencer
Efficient Implementation of Graph Algorithms Using Contraction [Citation Graph (0, 0)][DBLP]
FOCS, 1984, pp:347-357 [Conf] - Mark K. Goldberg, Thomas H. Spencer
A New Parallel Algorithm for the Maximal Independent Set Problem [Citation Graph (0, 0)][DBLP]
FOCS, 1987, pp:161-165 [Conf] - Thomas H. Spencer, Ernst W. Mayr
Node Weighted Matching. [Citation Graph (0, 0)][DBLP]
ICALP, 1984, pp:454-464 [Conf] - Mark K. Goldberg, Thomas H. Spencer
An Efficient Parallel Algorithm that Finds Independent Sets of Guaranteed Size. [Citation Graph (0, 0)][DBLP]
SODA, 1990, pp:219-225 [Conf] - Thomas H. Spencer
Time-Work Tradeoffs for Parallel Graph Algorithms. [Citation Graph (0, 0)][DBLP]
SODA, 1991, pp:425-432 [Conf] - Thomas H. Spencer
More Time-Work Tradeoffs for Parallel Graph Algorithms. [Citation Graph (0, 0)][DBLP]
SPAA, 1991, pp:81-93 [Conf] - David Eppstein, Zvi Galil, Giuseppe F. Italiano, Thomas H. Spencer
Separator based sparsification for dynamic planar graph algorithms. [Citation Graph (0, 0)][DBLP]
STOC, 1993, pp:208-217 [Conf] - Thomas H. Spencer
Provably Good Pattern Generators for a Random Pattern Test. [Citation Graph (0, 0)][DBLP]
Algorithmica, 1994, v:11, n:5, pp:429-442 [Journal] - Harold N. Gabow, Zvi Galil, Thomas H. Spencer, Robert Endre Tarjan
Efficient algorithms for finding minimum spanning trees in undirected and directed graphs. [Citation Graph (0, 0)][DBLP]
Combinatorica, 1986, v:6, n:2, pp:109-122 [Journal] - Harold N. Gabow, Zvi Galil, Thomas H. Spencer
Efficient implementation of graph algorithms using contraction. [Citation Graph (0, 0)][DBLP]
J. ACM, 1989, v:36, n:3, pp:540-572 [Journal] - Thomas H. Spencer
Time-work tradeoffs for parallel algorithms. [Citation Graph (0, 0)][DBLP]
J. ACM, 1997, v:44, n:5, pp:742-778 [Journal] - Hanmao Shi, Thomas H. Spencer
Time-Work Tradeoffs of the Single-Source Shortest Paths Problem. [Citation Graph (0, 0)][DBLP]
J. Algorithms, 1999, v:30, n:1, pp:19-32 [Journal] - David Eppstein, Zvi Galil, Giuseppe F. Italiano, Thomas H. Spencer
Separator Based Sparsification. I. Planary Testing and Minimum Spanning Trees. [Citation Graph (0, 0)][DBLP]
J. Comput. Syst. Sci., 1996, v:52, n:1, pp:3-27 [Journal] - Michael L. Fredman, Thomas H. Spencer
Refined Complexity Analysis for Heap Operations. [Citation Graph (0, 0)][DBLP]
J. Comput. Syst. Sci., 1987, v:35, n:3, pp:269-284 [Journal] - David Eppstein, Zvi Galil, Giuseppe F. Italiano, Thomas H. Spencer
Separator-Based Sparsification II: Edge and Vertex Connectivity. [Citation Graph (0, 0)][DBLP]
SIAM J. Comput., 1998, v:28, n:1, pp:341-381 [Journal] - Mark K. Goldberg, Thomas H. Spencer
A New Parallel Algorithm for the Maximal Independent Set Problem. [Citation Graph (0, 0)][DBLP]
SIAM J. Comput., 1989, v:18, n:2, pp:419-427 [Journal] - Mark K. Goldberg, Thomas H. Spencer
Constructing a Maximal Independent Set in Parallel. [Citation Graph (0, 0)][DBLP]
SIAM J. Discrete Math., 1989, v:2, n:3, pp:322-328 [Journal] - Mark K. Goldberg, Thomas H. Spencer
An Efficient Parallel Algorithm that Finds Independent Sets of Guaranteed Size. [Citation Graph (0, 0)][DBLP]
SIAM J. Discrete Math., 1993, v:6, n:3, pp:443-459 [Journal] - Thomas H. Spencer, Jacob Savir
Layout Influences Testability. [Citation Graph (0, 0)][DBLP]
IEEE Trans. Computers, 1985, v:34, n:3, pp:287-290 [Journal]
Parallel matching on expanders. [Citation Graph (, )][DBLP]
Search in 0.025secs, Finished in 0.026secs
| NOTICE1 |
|---|
| System may not be available sometimes or not working properly, since it is still in development with continuous upgrades |
| NOTICE2 |
|---|
| The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP |
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002