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
Hilfe
Suche: Author="Goodrich, M.T."
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Efficiently approximating polygonal paths in three and higher dimensions
G. Barequet
,
D.Z. Chen
,
O. Daescu
,
M.T. Goodrich
,
J. Snoeyink
Algorithmica
33
(2), 2002, pp. 150-167
Drawing planar graphs with circular arcs
C.C. Cheng
,
C.A. Duncan
,
M.T. Goodrich
,
S.G. Kobourov
Lecture Notes in Computer Science
1731
, 1999, pp. 117-126
A nearly optimal deterministic parallel Voronoi diagram algorithm
R. Cole
,
M.T. Goodrich
,
C. O'DĂșnlaing
Algorithmica
16
, 1996, pp. 569-617
Sweep methods for parallel computational geometry
M.T. Goodrich
,
M.R. Ghouse
,
J. Bright
Algorithmica
15
, 1996, pp. 126-153
Blocking for external graph searching
M.H. Nodine
,
M.T. Goodrich
,
J.S. Vitter
Algorithmica
16
, 1996, pp. 181-214
Sorting on a parallel pointer machine with applications to set expression evaluation
M.T. Goodrich
,
S.R. Kosaraju
Proceedings of the 30th Annual IEEE Symposium on Foundations of Computer Science, FOCS'89 (Research Triangle Park, NC, October 30 - November 1, 1989)
, 1989, pp. 190-195
Intersecting line segments in parallel with an output-sensitive number of processors
M.T. Goodrich
Proceedings of the 1st Annual ACM Symposium on Parallel Algorithms and Architectures, SPAA'89 (Santa Fe, New Mexico, June 18-21, 1989)
, 1989, pp. 127-136
Parallel algorithms for evaluating sequences of set manipulation operations (preliminary version)
M.J. Atallah
,
M.T. Goodrich
,
S.R. Kosaraju
Lecture Notes in Computer Science
319
, 1988, pp. 1-10
Cascading divide-and-conquer: A technique for designing parallel algorithms
M.J. Atallah
,
R. Cole
,
M.T. Goodrich
Proceedings of the 28th Annual IEEE Symposium on Foundations of Computer Science, FOCS'87 (Los Angeles, CA, October 12-14, 1987)
, 1987, pp. 151-160
Finding the convex hull of a sorted point set in parallel
M.T. Goodrich
Information Processing Letters
26
(4), 1987, December, pp. 173-179