AAAAAA
Results:
1-21
|
Results: 21
Authors:
ARONSON J
FRIEZE A
PITTEL BG
Citation: J. Aronson et al., MAXIMUM MATCHINGS IN SPARSE RANDOM GRAPHS - KARP-SIPSER REVISITED, Random structures & algorithms, 12(2), 1998, pp. 111-177
Authors:
BLUM A
FRIEZE A
KANNAN R
VEMPALA S
Citation: A. Blum et al., A POLYNOMIAL-TIME ALGORITHM FOR LEARNING NOISY LINEAR THRESHOLD FUNCTIONS, Algorithmica, 22(1-2), 1998, pp. 35-52
Authors:
FRIEZE A
SZPANKOWSKI W
Citation: A. Frieze et W. Szpankowski, GREEDY ALGORITHMS FOR THE SHORTEST COMMON SUPERSTRING THAT ARE ASYMPTOTICALLY OPTIMAL, Algorithmica, 21(1), 1998, pp. 21-36
Authors:
DYER M
FRIEZE A
JERRUM M
Citation: M. Dyer et al., APPROXIMATELY COUNTING HAMILTON PATHS AND CYCLES IN DENSE GRAPHS, SIAM journal on computing, 27(5), 1998, pp. 1262-1272
Authors:
FRIEZE A
MCDIARMID C
Citation: A. Frieze et C. Mcdiarmid, ALGORITHMIC THEORY OF RANDOM GRAPHS, Random structures & algorithms, 10(1-2), 1997, pp. 5-42
Authors:
FRIEZE A
JERRUM M
Citation: A. Frieze et M. Jerrum, IMPROVED APPROXIMATION ALGORITHMS FOR MAX K-CUT AND MAX BISECTION, Algorithmica, 18(1), 1997, pp. 67-81
Authors:
FRIEZE A
JERRUM M
MOLLOY M
ROBINSON R
WORMALD N
Citation: A. Frieze et al., GENERATING AND COUNTING HAMILTON CYCLES IN RANDOM REGULAR GRAPHS, Journal of algorithms, 21(1), 1996, pp. 176-198
Authors:
FRIEZE A
SUEN S
Citation: A. Frieze et S. Suen, ANALYSIS OF 2 SIMPLE HEURISTICS ON A RANDOM INSTANCE OF K-SAT, Journal of algorithms, 20(2), 1996, pp. 312-355
Authors:
FRIEZE A
JANSON S
Citation: A. Frieze et S. Janson, PERFECT MATCHINGS IN RANDOM S-UNIFORM HYPERGRAPHS, Random structures & algorithms, 7(1), 1995, pp. 41-57
Authors:
ALON N
FRIEZE A
WELSH D
Citation: N. Alon et al., POLYNOMIAL-TIME RANDOMIZED APPROXIMATION SCHEMES FOR TUTTE-GROTHENDIECK INVARIANTS - THE DENSE CASE, Random structures & algorithms, 6(4), 1995, pp. 459-478
Authors:
ARONSON J
DYER M
FRIEZE A
SUEN S
Citation: J. Aronson et al., RANDOMIZED GREEDY MATCHING .2., Random structures & algorithms, 6(1), 1995, pp. 55-73
Authors:
DYER M
FENNER T
FRIEZE A
THOMASON A
Citation: M. Dyer et al., ON KEY STORAGE IN SECURE NETWORKS, Journal of cryptology, 8(4), 1995, pp. 189-200
Authors:
FRIEZE A
KARP RM
REED B
Citation: A. Frieze et al., WHEN IS THE ASSIGNMENT BOUND TIGHT FOR THE ASYMMETRIC TRAVELING-SALESMAN PROBLEM, SIAM journal on computing, 24(3), 1995, pp. 484-493
Authors:
BRODER AZ
FRIEZE A
LUND C
PHILLIPS S
REINGOLD N
Citation: Az. Broder et al., BALANCED ALLOCATIONS FOR TREE-LIKE INPUTS, Information processing letters, 55(6), 1995, pp. 329-332
Authors:
FRIEZE A
MOLLOY M
Citation: A. Frieze et M. Molloy, BROADCASTING IN RANDOM GRAPHS, Discrete applied mathematics, 54(1), 1994, pp. 77-79
Authors:
FRIEZE A
SUEN S
Citation: A. Frieze et S. Suen, ON THE INDEPENDENCE NUMBER OF RANDOM CUBIC GRAPHS, Random structures & algorithms, 5(5), 1994, pp. 649-664
Authors:
FRIEZE A
JANSON S
LUCZAK T
Citation: A. Frieze et al., SPECIAL ISSUE - PROCEEDINGS OF THE 5TH INTERNATIONAL SEMINAR ON RANDOM GRAPHS AND PROBABILISTIC METHODS IN COMBINATORICS AND COMPUTER-SCIENCE, RANDOM GRAPHS 91, HELD AUGUST 5-9, 1991 IN POZNAN, POLAND - INTRODUCTION, Random structures & algorithms, 5(1), 1994, pp. 1-1
Authors:
FRIEZE A
MCKAY BD
Citation: A. Frieze et Bd. Mckay, MULTICOLORED TREES IN RANDOM GRAPHS, Random structures & algorithms, 5(1), 1994, pp. 45-56
Authors:
COOPER C
FRIEZE A
Citation: C. Cooper et A. Frieze, HAMILTON CYCLES IN A CLASS OF RANDOM DIRECTED-GRAPHS, J COMB TH B, 62(1), 1994, pp. 151-163
Authors:
DYER M
FRIEZE A
Citation: M. Dyer et A. Frieze, RANDOM-WALKS, TOTALLY UNIMODULAR MATRICES, AND A RANDOMIZED DUAL SIMPLEX ALGORITHM, Mathematical programming, 64(1), 1994, pp. 1-16
Authors:
FRIEZE A
REED B
Citation: A. Frieze et B. Reed, POLYCHROMATIC HAMILTON CYCLES, Discrete mathematics, 118(1-3), 1993, pp. 69-74
Risultati:
1-21
|