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="Landau, Susan"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Designing cryptography for the new century
Susan Landau
Communications of the ACM
43
(5), 2000, pp. 115-120
Decomposition of algebraic functions
Dexter Kozen
,
Susan Landau
,
Richard Zippel
Journal Symbolic Computation
22
(3), 1996, pp. 235-246
The complexity of iterated multiplication
Neil Immerman
,
Susan Landau
Information and Computation
116
(1), 1995, January, pp. 103-116
Decomposition of algebraic functions
Dexter Kozen
,
Susan Landau
,
Richard Zippel
Proceedings of the 1st International Symposium, ANTS-I. Algorithmic Number Theory (Ithaca, NY, USA, May 6-9, 1994)
LNCS 877
, 1994, pp. 80-92
A note on ``Zippel Denesting''
Susan Landau
Journal Symbolic Computation
13
(1), 1992, pp. 41-45
Simplification of nested radicals
Susan Landau
SIAM Journal on Computing
21
(1), 1992, February, pp. 85-110
Shrinking lattice polyhedra
John Cremona
,
Susan Landau
SIAM Journal on Discrete Mathematics
3
(3), 1990, August, pp. 338-348
Shrinking lattice polyhedra
John Cremona
,
Susan Landau
Proceedings of the 1st Annual ACM-SIAM Symposium on Discrete Algorithms, SODA'90 (San Francisco, California, January 22-24, 1990)
, 1990, pp. 188-193
Polynomial decomposition algorithms
Dexter Kozen
,
Susan Landau
Journal Symbolic Computation
7
(5), 1989, pp. 445-456
Some remarks on computing the square parts of integers
Susan Landau
Information and Computation
78
(3), 1988, pp. 246-253
Polynomial decomposition algorithms
Dexter Kozen
,
Susan Landau
misc, 1987