Thomas H. Spencer

From MaRDI portal
Person:578911

Available identifiers

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

List of research outcomes





PublicationDate of PublicationType
Separator based sparsification for dynamic planar graph algorithms2015-05-07Paper
Statistical models in assessing fold change of gene expression in real-time RT-PCR experiments2006-05-16Paper
PARALLEL APPROXIMATE MATCHING2004-10-06Paper
Time–Work Tradeoffs of the Single-Source Shortest Paths Problem1999-06-21Paper
Separator-Based Sparsification II: Edge and Vertex Connectivity1998-09-21Paper
Solving a bilevel linear program when the inner decision maker control few variables1998-08-16Paper
Time-work tradeoffs for parallel algorithms1998-02-17Paper
An Efficient Algorithm to Compute the Candidate Keys of a Relational Database Schema1996-12-11Paper
https://portal.mardi4nfdi.de/entity/Q48711611996-09-15Paper
https://portal.mardi4nfdi.de/entity/Q48711541996-08-22Paper
Separator based sparsification. I: Planarity testing and minimum spanning trees1996-07-16Paper
Generalized Bonferroni inequalities1995-01-15Paper
https://portal.mardi4nfdi.de/entity/Q31388961994-09-19Paper
Provably good pattern generators for a random pattern test1994-07-24Paper
https://portal.mardi4nfdi.de/entity/Q31389791993-10-20Paper
An Efficient Parallel Algorithm that Finds Independent Sets of Guaranteed Size1993-10-14Paper
A New Parallel Algorithm for the Maximal Independent Set Problem1989-01-01Paper
Constructing a Maximal Independent Set in Parallel1989-01-01Paper
Refined complexity analysis for heap operations1987-01-01Paper
Efficient algorithms for finding minimum spanning trees in undirected and directed graphs1986-01-01Paper
https://portal.mardi4nfdi.de/entity/Q36808701984-01-01Paper

Research outcomes over time

This page was built for person: Thomas H. Spencer