The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Thomas H. Spencer: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. 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]
  2. 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]
  3. Thomas H. Spencer, Ernst W. Mayr
    Node Weighted Matching. [Citation Graph (0, 0)][DBLP]
    ICALP, 1984, pp:454-464 [Conf]
  4. 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]
  5. Thomas H. Spencer
    Time-Work Tradeoffs for Parallel Graph Algorithms. [Citation Graph (0, 0)][DBLP]
    SODA, 1991, pp:425-432 [Conf]
  6. Thomas H. Spencer
    More Time-Work Tradeoffs for Parallel Graph Algorithms. [Citation Graph (0, 0)][DBLP]
    SPAA, 1991, pp:81-93 [Conf]
  7. 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]
  8. 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]
  9. 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]
  10. 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]
  11. 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]
  12. 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]
  13. 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]
  14. 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]
  15. 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]
  16. 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]
  17. 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]
  18. 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]
  19. 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]

  20. Parallel matching on expanders. [Citation Graph (, )][DBLP]


Search in 0.003secs, Finished in 0.004secs
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
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002