Journal Article Hamilton Cycles in Random Regular Digraphs 1994 • Combinatorics Probability and Computing • 3(1):39-49 Cooper C, Frieze A, Molloy M
Journal Article MULTICOLORED TREES IN RANDOM GRAPHS 1994 • Random structures & algorithms (Print) • 5(1):45-56 FRIEZE A, MCKAY BD
Journal Article NEAR-PERFECT TOKEN DISTRIBUTION 1994 • Random structures & algorithms (Print) • 5(4):559-572 BRODER AZ, FRIEZE AM, SHAMIR E, UPFAL E
Journal Article On the complexity of computing the diameter of a polytope 1994 • Computational Complexity • 4(3):207-219 Frieze AM, Teng S-H
Conference ON THE GREEDY HEURISTIC FOR MATCHINGS 1994 • PROCEEDINGS OF THE FIFTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS • 141-149 ARONSON J, DYER M, FRIEZE A, SUEN S
Journal Article ON THE INDEPENDENCE NUMBER OF RANDOM CUBIC GRAPHS 1994 • Random structures & algorithms (Print) • 5(5):649-664 FRIEZE A, SUEN S
Journal Article ON THE PROBLEM OF APPROXIMATING THE NUMBER OF BASES OF A MATROID 1994 • Information Processing Letters • 50(1):9-11 AZAR Y, BRODER AZ, FRIEZE AM
Conference OPTIMAL CONSTRUCTION OF EDGE-DISJOINT PATHS IN RANDOM GRAPHS 1994 • PROCEEDINGS OF THE FIFTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS • 603-612 BRODER AA, FRIEZE AM, SUEN S, UPFAL E
Conference POLYNOMIAL TIME RANDOMISED APPROXIMATION SCHEMES FOR THE TUTTE POLYNOMIAL OF DENSE GRAPHS 1994 • Annual Symposium on Foundations of Computer Science • 24-35 ALON N, FRIEZE A, WELSH D
Journal Article RANDOM-WALKS, TOTALLY UNIMODULAR MATRICES, AND A RANDOMIZED DUAL SIMPLEX ALGORITHM 1994 • Mathematical programming • 64(1):1-16 DYER M, FRIEZE A
Journal Article SAMPLING FROM LOG-CONCAVE DISTRIBUTIONS 1994 • The Annals of Applied Probability • 4(3):812-837 Frieze A, Kannan R, Polson N
Journal Article SAMPLING FROM LOG-CONCAVE DISTRIBUTIONS (vol 3, pg 812, 1994) 1994 • The Annals of Applied Probability • 4(4):1255-1255 Frieze A, Kannan R, Polson N
Journal Article 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 1994 • Random structures & algorithms (Print) • 5(1):1-1 FRIEZE A, JANSON S, LUCZAK T
Journal Article The Probability of Unique Solutions of Sequencing by Hybridization 1994 • Journal of Computational Biology • 1(2):105-110 Dyer M, Frieze A, Suen S
Journal Article A Mildly Exponential Time Algorithm for Approximating the Number of Solutions to a Multidimensional Knapsack Problem 1993 • Combinatorics Probability and Computing • 2(3):271-284 Dyer M, Frieze A, Kannan R, Kapoor A, Perkovic L, Vazirani U
Conference ANALYSIS OF A SIMPLE GREEDY MATCHING ALGORITHM ON RANDOM CUBIC GRAPHS 1993 • PROCEEDINGS OF THE FOURTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS • 341-351 FRIEZE A, RADCLIFFE AJ, SUEN S
Conference ON THE SATISFIABILITY AND MAXIMUM SATISFIABILITY OF RANDOM 3-CNF FORMULAS 1993 • PROCEEDINGS OF THE FOURTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS • 322-330 BRODER AZ, FRIEZE AM, UPFAL E
Journal Article POLYCHROMATIC HAMILTON CYCLES 1993 • Discrete Mathematics • 118(1-3):69-74 FRIEZE A, REED B
Journal Article COUNTING THE NUMBER OF HAMILTON CYCLES IN RANDOM DIGRAPHS 1992 • Random structures & algorithms (Print) • 3(3):235-241 FRIEZE A, SUEN S
Conference Existence and construction of edge disjoint paths on expander graphs 1992 • Annual ACM Symposium on Theory of Computing • 140-149 Broder AZ, Frieze AM, Upfal E
Conference NEAR-PERFECT TOKEN DISTRIBUTION 1992 • Lecture Notes in Computer Science • 623:308-317 BRODER AZ, FRIEZE AM, SHAMIR E, UPFAL E
Journal Article NEAR-PERFECT TOKEN DISTRIBUTION 1992 • Lecture Notes in Computer Science • 623:308-317 BRODER AZ, FRIEZE AM, SHAMIR E, UPFAL E
Journal Article ON A CONJECTURE OF BONDY AND FAN 1992 • Ars Combinatoria • 33:329-336 FRIEZE A, MCDIARMID C, REED B
Journal Article On Subgraph Sizes in Random Graphs 1992 • Combinatorics Probability and Computing • 1(2):123-134 Calkin N, Frieze A, McKay BD
Journal Article ON THE EXPECTED PERFORMANCE OF A PARALLEL ALGORITHM FOR FINDING MAXIMAL INDEPENDENT SUBSETS OF A RANDOM GRAPH 1992 • Random structures & algorithms (Print) • 3(2):215-221 CALKIN NJ, FRIEZE AM, KUCERA L
