Thomas H. Spencer

Available identifiers

zbMath Open spencer.thomas-hDBLP79/5372WikidataQ102257435 ScholiaQ102257435MaRDI QIDQ578911

List of research outcomes

Publication	Date of Publication	Type
Separator based sparsification for dynamic planar graph algorithms	2015-05-07	Paper
Statistical models in assessing fold change of gene expression in real-time RT-PCR experiments	2006-05-16	Paper
PARALLEL APPROXIMATE MATCHING	2004-10-06	Paper
Time–Work Tradeoffs of the Single-Source Shortest Paths Problem	1999-06-21	Paper
Separator-Based Sparsification II: Edge and Vertex Connectivity	1998-09-21	Paper
Solving a bilevel linear program when the inner decision maker control few variables	1998-08-16	Paper
Time-work tradeoffs for parallel algorithms	1998-02-17	Paper
An Efficient Algorithm to Compute the Candidate Keys of a Relational Database Schema	1996-12-11	Paper
https://portal.mardi4nfdi.de/entity/Q4871161	1996-09-15	Paper
https://portal.mardi4nfdi.de/entity/Q4871154	1996-08-22	Paper
Separator based sparsification. I: Planarity testing and minimum spanning trees	1996-07-16	Paper
Generalized Bonferroni inequalities	1995-01-15	Paper
https://portal.mardi4nfdi.de/entity/Q3138896	1994-09-19	Paper
Provably good pattern generators for a random pattern test	1994-07-24	Paper
https://portal.mardi4nfdi.de/entity/Q3138979	1993-10-20	Paper
An Efficient Parallel Algorithm that Finds Independent Sets of Guaranteed Size	1993-10-14	Paper
A New Parallel Algorithm for the Maximal Independent Set Problem	1989-01-01	Paper
Constructing a Maximal Independent Set in Parallel	1989-01-01	Paper
Refined complexity analysis for heap operations	1987-01-01	Paper
Efficient algorithms for finding minimum spanning trees in undirected and directed graphs	1986-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3680870	1984-01-01	Paper

Research outcomes over time

This page was built for person: Thomas H. Spencer