Thomas H. Spencer

List of publications from the DBLP Bibliography Server - FAQ
Other views: by type - by year (modern) - classic-C

Ask others: ACM DL/Guide -

- CSB - MetaPress - Google - Bing - Yahoo

	1999
j13		Hanmao Shi, Thomas H. Spencer: Time-Work Tradeoffs of the Single-Source Shortest Paths Problem. J. Algorithms 30(1): 19-32 (1999)
	1998
j12		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
j11		Thomas H. Spencer: Time-work tradeoffs for parallel algorithms. J. ACM 44(5): 742-778 (1997)
	1996
j10		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
j9		Thomas H. Spencer: Provably Good Pattern Generators for a Random Pattern Test. Algorithmica 11(5): 429-442 (1994)
j8		Thomas H. Spencer: Parallel Approximate Matching. Parallel Algorithms Appl. 2(1-2): 115-121 (1994)
	1993
j7		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)
c8		David Eppstein, Zvi Galil, Giuseppe F. Italiano, Thomas H. Spencer: Separator based sparsification for dynamic planar graph algorithms. STOC 1993: 208-217
	1991
c7		Thomas H. Spencer: Time-Work Tradeoffs for Parallel Graph Algorithms. SODA 1991: 425-432
c6		Thomas H. Spencer: More Time-Work Tradeoffs for Parallel Graph Algorithms. SPAA 1991: 81-93
c5		Thomas H. Spencer: Parallel matching on expanders. SPDP 1991: 752-758
	1990
c4		Mark K. Goldberg, Thomas H. Spencer: An Efficient Parallel Algorithm that Finds Independent Sets of Guaranteed Size. SODA 1990: 219-225
	1989
j6		Harold N. Gabow, Zvi Galil, Thomas H. Spencer: Efficient implementation of graph algorithms using contraction. J. ACM 36(3): 540-572 (1989)
j5		Mark K. Goldberg, Thomas H. Spencer: A New Parallel Algorithm for the Maximal Independent Set Problem. SIAM J. Comput. 18(2): 419-427 (1989)
j4		Mark K. Goldberg, Thomas H. Spencer: Constructing a Maximal Independent Set in Parallel. SIAM J. Discrete Math. 2(3): 322-328 (1989)
	1987
j3		Michael L. Fredman, Thomas H. Spencer: Refined Complexity Analysis for Heap Operations. J. Comput. Syst. Sci. 35(3): 269-284 (1987)
c3		Mark K. Goldberg, Thomas H. Spencer: A New Parallel Algorithm for the Maximal Independent Set Problem. FOCS 1987: 161-165
	1986
j2		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
j1		Thomas H. Spencer, Jacob Savir: Layout Influences Testability. IEEE Trans. Computers 34(3): 287-290 (1985)
	1984
c2		Harold N. Gabow, Zvi Galil, Thomas H. Spencer: Efficient Implementation of Graph Algorithms Using Contraction. FOCS 1984: 347-357
c1		Thomas H. Spencer, Ernst W. Mayr: Node Weighted Matching. ICALP 1984: 454-464

Coauthor Index

1	David Eppstein	[j12] [j10] [c8]
2	Michael L. Fredman	[j3]
3	Harold N. Gabow	[j6] [j2] [c2]
4	Zvi Galil	[j12] [j10] [c8] [j6] [j2] [c2]
5	Mark K. Goldberg	[j7] [c4] [j5] [j4] [c3]
6	Giuseppe F. Italiano	[j12] [j10] [c8]
7	Ernst W. Mayr	[c1]
8	Jacob Savir	[j1]
9	Hanmao Shi	[j13]
10	Robert Endre Tarjan	[j2]

Last update Fri May 24 07:22:59 2013 CET by the DBLP Team —

Data released under the ODC-BY 1.0 license — See also our legal information page