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."
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
A polynomial-time algorithm for learning noisy linear threshold functions
A. Blum
,
A. Frieze
,
R. Kannan
,
S. Vempala
Algorithmica
22
(1-2), 1998, pp. 35-52
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
Greedy algorithms for the shortest common superstring that are asymptotically optimal
A. Frieze
,
W. Szpankowski
Algorithmica
21
(1), 1998, pp. 21-36
Improved approximation algorithms for MAX
k
-Cut and MAX BISECTION
A. Frieze
,
M. Jerrum
Algorithmica
18
(1), 1997, pp. 67-81
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
A random polynomial time algorithm for approximating the volume of convex bodies
M. Dyer
,
A. Frieze
,
R. Kannan
Journal of the ACM
38
(1), 1991, January, pp. 1-17
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
Seiten 1
2
>