Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
[1]
Hilfe
Suche: Author="Spencer, Thomas H."
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Time-work tradeoffs of the single-source shortest paths problem
Hanmao Shi
,
Thomas H. Spencer
Journal of Algorithms
30
(1), 1999, pp. 19-32
Separator-based sparsification II: Edge and vertex connectivity
David Eppstein
,
Zvi Galil
,
Giuseppe F. Italiano
,
Thomas H. Spencer
SIAM Journal on Computing
28
(1), 1998, pp. 341-381
Time-work tradeoffs for parallel algorithms
Thomas H. Spencer
Journal of the ACM
44
(5), 1997, pp. 742-778
Separator based sparsification - I. Planarity testing and minimum spanning trees
David Eppstein
,
Zvi Galil
,
Giuseppe F. Italiano
,
Thomas H. Spencer
Journal of Computer and System Sciences
52
(1), 1996, pp. 3-27
Provably good pattern generators for a random pattern test
Thomas H. Spencer
Algorithmica
11
, 1994, pp. 429-442
Separator based sparsification for dynamic planar graph algorithms (extended abstract)
David Eppstein
,
Zvi Galil
,
Giuseppe F. Italiano
,
Thomas H. Spencer
Proceedings of the 25th Annual ACM Symposium on Theory of Computing, STOC'93 (San Diego, California, May 16--18, 1993)
, 1993, pp. 208-217
Almost optimally efficient parallel ear decomposition
Thomas H. Spencer
Technical Report (UNO-CS-TR-93-4), 1993
Almost optimally efficient spanning tree computation on the EREW PRAM
Thomas H. Spencer
Technical Report (UNO-CS-TR-93-3), 1993, March
Time-work tradeoffs for parallel graph algorithms
Thomas H. Spencer
Proceedings of the 2nd Annual ACM-SIAM Symposium on Discrete Algorithms, SODA'91 (San Francisco, California, January 28-30, 1991)
, 1991, pp. 425-432
More time-work tradeoffs for parallel graph algorithms
Thomas H. Spencer
Proceedings of the 3rd Annual ACM Symposium on Parallel Algorithms and Architectures, SPAA'91 (Hilton Head, South Carolina, July 21-24, 1991)
, 1991, pp. 81-93
Parallel matching on expanders
Thomas H. Spencer
Technical Report (91-14), 1991, May
Parallel matching on expanders
Thomas H. Spencer
Proceedings of the 3rd IEEE Symposium on Parallel and Distributed Processing, SPDP'91 (Dallas, Texas, December 2-5, 1991)
, 1991, pp. 752-758
An efficient parallel algorithm that finds independent sets of guaranteed size
Mark Goldberg
,
Thomas H. Spencer
Proceedings of the 1st Annual ACM-SIAM Symposium on Discrete Algorithms, SODA'90 (San Francisco, California, January 22-24, 1990)
, 1990, pp. 219-225
Efficient implementation of graph algorithms using contraction
Harold N. Gabow
,
Zvi Galil
,
Thomas H. Spencer
Journal of the ACM
36
(3), 1989, July, pp. 540-572
Fast Boolean matrix multiplication
Thomas H. Spencer
Technical Report (89-30), 1989, December
Time-work tradeoffs for parallel algorithms
Thomas H. Spencer
Technical Report (89-26), 1989, November
Provably good pattern generators for random pattern test
Thomas H. Spencer
Technical Report (88-3), 1988, January
Refined complexity analysis for heap operations
Michael L. Fredman
,
Thomas H. Spencer
Journal of Computer and System Sciences
35
(3), 1987, December, pp. 269-284