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, S."
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Introduction
S. Fortune
Algorithmica
27
(1), 2000, pp. 1-4
Sorting helps for Voronoi diagrams
L.P. Chew
,
S. Fortune
Algorithmica
18
(2), 1997, pp. 217-228
Stable maintenance of point set triangulations in two dimensions
S. Fortune
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. 494-499
Polygon containment under translation
B.S. Baker
,
S.J. Fortune
,
S.R. Mahaney
Journal of Algorithms
7
(4), 1986, December, pp. 532-548
Stable prehension with three fingers
B.S. Baker
,
S. Fortune
,
E. Grosse
Proceedings of the 17th Annual ACM Symposium on Theory of Computing, STOC'85 (Providence, RI, May 6-8, 1985)
, 1985, pp. 114-120
Unbounded fan-in circuits and associative functions
A.K. Chandra
,
S. Fortune
,
R. Lipton
Journal of Computer and System Sciences
30
(2), 1985, April, pp. 222-234
A fast algorithm for polygon containment by translation
S.J. Fortune
Lecture Notes in Computer Science
194
, 1985, pp. 189-198
Unbounded fan-in circuits and associative functions
A.K. Chandra
,
S. Fortune
,
R. Lipton
Proceedings of the 15th Annual ACM Symposium on Theory of Computing, STOC'83 (Boston, MA, May 25-27, 1983)
, 1983, pp. 52-60
The expressiveness of simple and second-order type structures
S. Fortune
,
D. Leivant
,
M. O'Donnell
Journal of the ACM
30
(1), 1983, pp. 151-185
The directed subgraph homeomorphism problem
S. Fortune
,
J. Hopcroft
,
J. Wyllie
Theoretical Computer Science
10
(2), 1980, pp. 111-121
A note on Rabin's nearest-neighbor algorithm
S. Fortune
,
J. Hopcroft
Information Processing Letters
8
(1), 1979, January, pp. 20-23
A note on sparse complete sets
S. Fortune
SIAM Journal on Computing
8
(3), 1979, August, pp. 431-433
The complexity of equivalence and containment for free single variable program schemes
S. Fortune
,
J. Hopcroft
,
E.M. Schmidt
Lecture Notes in Computer Science
62
, 1978, pp. 227-240
Parallelism in random access machines
S. Fortune
,
J. Wyllie
Proceedings of the 10th Annual ACM Symposium on Theory of Computing, STOC'78 (San Diego, CA, May 1-3, 1978)
, 1978, pp. 114-118