![](https://dblp1.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp1.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp1.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
default search action
Thomas H. Spencer
Person information
Refine list
![note](https://dblp1.uni-trier.de/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
1990 – 1999
- 1999
- [j15]Hanmao Shi, Thomas H. Spencer:
Time-Work Tradeoffs of the Single-Source Shortest Paths Problem. J. Algorithms 30(1): 19-32 (1999) - 1998
- [j14]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
- [j13]Thomas H. Spencer:
Time-work tradeoffs for parallel algorithms. J. ACM 44(5): 742-778 (1997) - 1996
- [j12]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
- [j11]Thomas H. Spencer:
Provably Good Pattern Generators for a Random Pattern Test. Algorithmica 11(5): 429-442 (1994) - [j10]Thomas H. Spencer:
Solving Divide and Conquer Recurrences. Comput. Sci. Educ. 5(1): 15-35 (1994) - [j9]Thomas H. Spencer:
Parallel Approximate Matching. Parallel Algorithms Appl. 2(1-2): 115-121 (1994) - 1993
- [j8]Mark K. Goldberg, Thomas H. Spencer:
An Efficient Parallel Algorithm that Finds Independent Sets of Guaranteed Size. SIAM J. Discret. Math. 6(3): 443-459 (1993) - [j7]Thomas H. Spencer:
Context-free languages. SIGACT News 24(4): 90-91 (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
1980 – 1989
- 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. Discret. 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
- [b1]Thomas H. Spencer:
Weighted matching algorithms. Stanford University, USA, 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. Comb. 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
![](https://dblp1.uni-trier.de/img/cog.dark.24x24.png)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 23:02 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint