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="Fortune, Steven"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
An iterated eigenvalue algorithm for approximating roots of univariate polynomials
Steven Fortune
Journal Symbolic Computation
33
(5), 2002, pp. 627-646
Polynomial root finding using iterated eigenvalue computation
Steven Fortune
Proceedings of the 2001 International Symposium on Symbolic and Algebraic Computation, ISSAC'2001 (University of Western Ontario, London, Ontario, Canada, July 22-25, 2001)
, 2001, pp. 121-128
Exact computation of the inertia of symmetric integer matrices
Steven Fortune
Proceedings of the 32nd Annual ACM Symposium on Theory of Computing, STOC'2000 (Portland, Oregon, May 21-23, 2000)
, 2000, pp. 556-564
Voronoi diagrams and Delaunay triangulations
Steven Fortune
Handbook of Discrete and Computational Geometry, 1997, pp. 377-388
Planning constrained motion
Steven Fortune
,
Gordon Wilfong
Proceedings of the 20th Annual ACM Symposium on Theory of Computing, STOC'88 (Chicago, IL, May 2-4, 1988)
, 1988, pp. 445-459
A sweepline algorithm for Voronoi diagrams
Steven Fortune
Algorithmica
2
, 1987, pp. 153-174
Lower bounds for constant depth circuits for prefix problems
Ashok Chandra
,
Steven Fortune
,
Richard Lipton
Technical Report (RC 9944), 1982
A note on sparse complete sets
Steven Fortune
Technical Report (TR 78-355), 1978