Journal Article A note on sparse random graphs and cover graphs 2000 • Electronic Journal of Combinatorics • 7(1 R):1-9 Bohman T, Frieze A, Ruszinkó M, Thoma L
Conference Average-case complexity of shortest-paths problems in the vertex-potential model 2000 • Random structures & algorithms (Print) • 16(1):33-46 Cooper C, Frieze A, Mehlhorn K, Priebe V
Journal Article Edge disjoint Hamilton cycles in sparse random graphs of minimum degree at least <i>k</i> 2000 • Journal of Graph Theory • 34(1):42-59 Bollobás B, Cooper C, Fenner TI, Frieze AM
Conference Edge-disjoint paths in expander graphs 2000 • Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms • 717-725 Frieze AM
Journal Article Hamilton cycles in random graphs and directed graphs 2000 • Random structures & algorithms (Print) • 16(4):369-401 Cooper C, Frieze A
Journal Article Min-wise independent linear permutations 2000 • Electronic Journal of Combinatorics • 7(1 R):1-6 Bohman T, Cooper C, Frieze A
Journal Article Min-wise independent permutations 2000 • Journal of Computer and System Sciences • 60(3):630-659 Broder AZ, Charikar M, Frieze AM, Mitzenmacher M
Journal Article Mixing properties of the Swendsen-Wang process on the complete graph and narrow grids 2000 • Journal of Mathematical Physics • 41(3):1499-1527 Cooper C, Dyer ME, Frieze AM, Rue R
Journal Article On the number of perfect matchings and Hamilton cycles in ε-regular non-bipartite graphs 2000 • Electronic Journal of Combinatorics • 7(1 R):1-11 Frieze A
Journal Article Optimal construction of edge-disjoint paths in random regular graphs 2000 • Combinatorics Probability and Computing • 9(3):241-263 Frieze AM, Zhao L
Journal Article A simple algorithm for constructing Szemerédi's Regularity Partition 1999 • Electronic Journal of Combinatorics • 6(1): Frieze A, Kannan R
Conference Clustering in large graphs and matrices 1999 • Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms • 291-299 Drineas P, Frieze A, Kannan R, Vempala S, Vinay V
Conference Counting independent sets in sparse graphs 1999 • Annual Symposium on Foundations of Computer Science • 210-217 Dyer M, Frieze A, Jerrum M
Journal Article Log-Sobolev inequalities and sampling from log-concave distributions 1999 • The Annals of Applied Probability • 9(1):14-26 Frieze A, Kannan R
Journal Article Mixing properties of the Swendsen-Wang process an classes of graphs 1999 • Random structures & algorithms (Print) • 15(3-4):242-261 Cooper C, Frieze AM
Journal Article On perfect matchings and Hamilton cycles in sums of random trees 1999 • SIAM Journal on Discrete Mathematics • 12(2):208-216 Frieze A, Karonski M, Thoma L
Journal Article On the power of universal bases in sequencing by hybridization 1999 • Proceedings of the Annual International Conference on Computational Molecular Biology, RECOMB • 295-301 Preparata FP, Frieze AM, Upfal E
Conference Optimal construction of edge-disjoint paths in random regular graphs 1999 • Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms • 346-355 Frieze AM, Zhao L
Journal Article Optimal reconstruction of a sequence from its probes 1999 • Journal of Computational Biology • 6(3-4):361-368 Frieze AM, Preparata FP, Upfal E
Journal Article Quick approximation to matrices and applications 1999 • Combinatorica • 19(2):175-220 Frieze A, Kannan R
Journal Article Splitting an expander graph 1999 • Journal of Algorithms in Cognition, Informatics and Logic • 33(1):166-172 Frieze AM, Molloy M
Journal Article Static and dynamic path selection on expander graphs: A random walk approach 1999 • Random structures & algorithms (Print) • 14(1):87-109 Broder AZ, Frieze AM, Upfal E
Conference Torpid mixing of some Monte Carlo Markov chain algorithms in statistical physics 1999 • Annual Symposium on Foundations of Computer Science • 218-229 Borgs C, Chayes JT, Frieze A, Kim JH, Tetali P, Vigoda E, Vu VH
Journal Article A polynomial-time algorithm for learning noisy linear threshold functions 1998 • Algorithmica • 22(1-2):35-52 Blum A, Frieze A, Kannan R, Vempala S
Journal Article Approximately counting Hamilton paths and cycles in dense graphs 1998 • SIAM journal on computing (Print) • 27(5):1262-1272 Dyer M, Frieze A, Jerrum M
