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="Odlyzko, A.M."
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Asymptotic enumeration methods
A.M. Odlyzko
Handbook of Combinatorics
2
, 1995, pp. 1063-1229
Minimal-distance routing for KYKLOS II
Ding-Zhu Du
,
F.K. Hwang
,
A.M. Odlyzko
,
Yanjung Zhang
Networks
24
(2), 1994, pp. 103-108
On the number of alignments of
k
-sequences
J.R. Griggs
,
P. Hanlon
,
A.M. Odlyzko
,
M.S. Waterman
Graphs and Combinatorics
6
, 1990, pp. 133-146
On subspaces spanned by random selections of
\pm 1
vectors
A.M. Odlyzko
Journal of Combinatorial Theory Series A
47
, 1988, pp. 124-133
Minimal-distance routing for Kyklos II
D.Z. Du
,
F.K. Hwang
,
A.M. Odlyzko
,
Y.J. Zhang
Proceedings of the 1987 International Conference on Parallel Processing, ICPP'87 (Penn State University, August 17-21, 1987)
, 1987, pp. 546-549
Computing pi (X): an analytic method
J.C. Lagarias
,
A.M. Odlyzko
Journal of Algorithms
8
(2), 1987, June, pp. 173-191
Probabilities for intersecting systems and random subsets of finite sets
P.C. Fishburn
,
P. Frankl
,
D. Freed
,
J.C. Lagarias
,
A.M. Odlyzko
SIAM Journal on Algebraic Discrete Methods
7
, 1986, pp. 73-79
Balloting labelling and personnel assignment
W.D. Wei
,
Y.Z. Cai
,
C.L. Liu
,
A.M. Odlyzko
SIAM Journal on Algebraic Discrete Methods
7
, 1986, pp. 150-158
Solving low-density subset sum problems
J.C. Lagarias
,
A.M. Odlyzko
Journal of the ACM
32
(1), 1985, pp. 229-246
On the number of distinct block sizes in partitions of a set
A.M. Odlyzko
,
L.B. Richmond
Journal of Combinatorial Theory Series A
38
, 1985, pp. 170-181
On the density of sequences of integers the sum of no two of which is a square. II. General sequences
J.C. Lagarias
,
A.M. Odlyzko
,
J.B. Shearer
Journal of Combinatorial Theory Series A
34
, 1983, pp. 123-139
Solving low density subset sum problems
J.C. Lagarias
,
A.M. Odlyzko
Proceedings of the 24th Annual IEEE Symposium on Foundations of Computer Science, FOCS'83 (Tucson, AZ, November 7-9, 1983)
, 1983, pp. 1-10
On the density of sequences of integers the sum of no two of which is a square. I. Arithmetic progressions
J.C. Lagarias
,
A.M. Odlyzko
,
J.B. Shearer
Journal of Combinatorial Theory Series A
33
, 1982, pp. 167-185
Irreducibility testing and factorization of polynomials (extended abstract)
L.M. Adleman
,
A.M. Odlyzko
Proceedings of the 22nd Annual IEEE Symposium on Foundations of Computer Science, FOCS'81 (Nashville, TN, October 28-30, 1981)
, 1981, pp. 409-418
String overlaps, pattern matching, and nontransitive games
L.J. Guibas
,
A.M. Odlyzko
Journal of Combinatorial Theory Series A
30
, 1981, pp. 183-208
A new proof of the linearity of the Boyer-Moore string searching algorithm
L.J. Guibas
,
A.M. Odlyzko
SIAM Journal on Computing
9
(4), 1980, November, pp. 672-682
New bounds on the number of unit spheres that can touch a unit sphere in
n
dimensions
A.M. Odlyzko
,
N.J.A. Sloane
Journal of Combinatorial Theory Series A
26
, 1979, pp. 210-214
Self-dual codes over
GF(4)
F.J. MacWilliams
,
A.M. Odlyzko
,
N.J.A. Sloane
,
H.N. Ward
Journal of Combinatorial Theory Series A
25
, 1978, pp. 288-318
A new proof of the linearity of the Boyer-Moore string searching algorithm
L.J. Guibas
,
A.M. Odlyzko
Proceedings of the 18th Annual IEEE Symposium on Foundations of Computer Science, FOCS'77 (Providence, RI, October 31 - November 2, 1977)
, 1977, pp. 189-195
Pelikán's conjecture and cyclotomic cosets
F.J. MacWilliams
,
A.M. Odlyzko
Journal of Combinatorial Theory Series A
22
, 1977, pp. 110-114
On covering a product of sets with products of their subsets
A.M. Odlyzko
Discrete Mathematics
5
, 1973, pp. 373-380
Disproof of the Mertens conjecture
A.M. Odlyzko
,
H.J.J. te Riele
misc (NM-R8412)