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
[1]
Hilfe
Suche: Author="Frieze, A.M."
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Edge disjoint Hamilton cycles in sparse random graphs of minimum degree at least
k
B. Bollobás
,
C. Cooper
,
T.I. Fenner
,
A.M. Frieze
Journal of Graph Theory
34
(1), 2000, pp. 42-59
Average-case analysis of the merging algorithm of Hwang and Lin
W. Fernandez de la Vega
,
A.M. Frieze
,
M. Santha
Algorithmica
22
(4), 1998, pp. 483-489
On the best case of Heapsort
B. Bollobás
,
T.I. Fenner
,
A.M. Frieze
Journal of Algorithms
20
(2), 1996, pp. 205-217
On the problem of approximating the number of bases of a matroid
Y. Azar
,
A.Z. Broder
,
A.M. Frieze
Information Processing Letters
50
, 1994, pp. 9-11
On the independence and chromatic numbers of random regular graphs
A.M. Frieze
,
T. Łuczak
Journal of Combinatorial Theory Series B
54
, 1992, pp. 123-132
The limiting probability that
\alpha
-in,
\beta
-out is strongly connected
C. Cooper
,
A.M. Frieze
Journal of Combinatorial Theory Series B
48
, 1990, pp. 117-134
On an optimization problem with nested constraints
M.E. Dyer
,
A.M. Frieze
Discrete Applied Mathematics
26
, 1990, pp. 159-173
Probabilistic analysis of graph algorithms
A.M. Frieze
Computing Supplementum
7
, 1990, pp. 209-233
On the number of Hamilton cycles in a random graph
C. Cooper
,
A.M. Frieze
Journal of Graph Theory
13
(6), 1989, pp. 719-735
The solution of some random
NP
-hard problems in polynomial expected time
M.E. Dyer
,
A.M. Frieze
Journal of Algorithms
10
, 1989, pp. 451-489
On random minimum length spanning trees
A.M. Frieze
,
C.J.H. McDiarmid
Combinatorica
9
, 1989, pp. 363-374
Algorithms for assignment problems on an array processor
A.M. Frieze
,
J. Yadegar
,
S. El-Horbaty
,
D. Parkinson
Parallel Computing
11
(2), 1989, pp. 151-162
Survival time of a random graph
A.M. Frieze
Combinatorica
9
, 1989, pp. 133-143
Probabilistic analysis of graph algorithms
A.M. Frieze
misc, 1989, February
On the complexity of computing the volume of a polyhedron
M.E. Dyer
,
A.M. Frieze
SIAM Journal on Computing
17
, 1988, pp. 967-974
Reconstructing truncated integer variables satisfying linear congruences
A.M. Frieze
,
J. Håstad
,
R. Kannan
,
J.C. Lagarias
,
A. Shamir
SIAM Journal on Computing
17
(2), 1988, April, pp. 262-280
Edge-colouring random graphs
A.M. Frieze
,
B. Jackson
,
C.J.H. McDiarmid
,
B. Reed
Journal of Combinatorial Theory Series B
45
, 1988, pp. 135-149
An algorithm for finding hamilton cycles in random directed graphs
A.M. Frieze
Journal of Algorithms
9
(2), 1988, June, pp. 181-204
On the random construction of heaps
A.M. Frieze
Information Processing Letters
27
(2), 1988, February, pp. 103-109
Finding Hamilton cycles in sparse random graphs
A.M. Frieze
Journal of Combinatorial Theory Series B
44
(2), 1988, April, pp. 230-250
An algorithm for finding Hamilton cycles in a random graph
B. Bollobás
,
T.I. Fenner
,
A.M. Frieze
Combinatorica
7
(4), 1987, pp. 327-342
Large holes in sparse random graphs
A.M. Frieze
,
B. Jackson
Combinatorica
7
(3), 1987, pp. 265-274
Large induced trees in sparse random graphs
A.M. Frieze
,
B. Jackson
Journal of Combinatorial Theory Series B
42
(2), 1987, April, pp. 181-195
Parallel algorithms for finding Hamilton cycles in random graphs
A.M. Frieze
Information Processing Letters
25
(2), 1987, May, pp. 111-117
On the exact solution of random travelling salesman problems with medium size integer coefficients
A.M. Frieze
SIAM Journal on Computing
16
(6), 1987, December, pp. 1052-1072
Seiten 1
2
>