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
Journal Article Average-case analysis of the merging algorithm of Hwang and Lin 1998 • Algorithmica • 22(4):483-489 de la Vega WF, Frieze AM, Santha M
Conference Disjoint paths in expander graphs via random walks: A short survey 1998 • Lecture Notes in Computer Science • 1518:1-14 Frieze AM
Conference Dynamic packet routing on arrays with bounded buffers 1998 • Lecture Notes in Computer Science • 1380:273-281 Broder AZ, Frieze AM, Upfal E
Conference Fast Monte-Carlo algorithms for finding low-rank approximations 1998 • Annual Symposium on Foundations of Computer Science • 370-378 Frieze A, Kannan R, Vempala S
Journal Article Greedy algorithms for the shortest common superstring that are asymptotically optimal 1998 • Algorithmica • 21(1):21-36 Frieze A, Szpankowski W
Journal Article Maximum matchings in sparse random graphs: Karp-Sipser revisited 1998 • Random structures & algorithms (Print) • 12(2):111-177 Aronson J, Frieze A, Pittel BG
Conference Min-wise independent permutations 1998 • Conference Proceedings of the Annual ACM Symposium on Theory of Computing • 327-336 Broder AZ, Charikar M, Frieze AM, Mitzenmacher M
Conference On balls and bins with deletions 1998 • Lecture Notes in Computer Science • 1518:145-158 Cole R, Frieze A, Maggs BM, Mitzenmacher M, Richa AW, Sitaraman R, Upfal E
Journal Article Optimal construction of edge-disjoint paths in random graphs 1998 • SIAM journal on computing (Print) • 28(2):542-574 Broder AZ, Frieze AM, Suen S, Upfal E
Journal Article Random minimum length spanning trees in regular graphs 1998 • Combinatorica • 18(3):311-333 Beveridge A, Frieze A, McDiarmid C
Journal Article Algorithmic theory of random graphs 1997 • Random structures & algorithms (Print) • 10(1-2):5-42 Frieze A, McDiarmid C
Conference Average-case complexity of shortest-paths problems in the vertex-potential model 1997 • Lecture Notes in Computer Science • 1269:15-26 Cooper C, Frieze A, Mehlhorn K, Priebe V
Conference Greedy algorithms for the shortest common superstring that are asymptotically optimal 1997 • IEEE International Symposium on Information Theory - Proceedings • 39 Frieze A, Szpankowski W
Journal Article Improved approximation algorithms for MAX k-CUT and MAX BISECTION 1997 • Algorithmica • 18(1):67-81 Frieze A, Jerrum M
Conference Static and dynamic path selection on expander graphs: A random walk approach 1997 • Conference Proceedings of the Annual ACM Symposium on Theory of Computing • 531-539 Broder AZ, Frieze AM, Upfal E
Conference A general approach to dynamic packet routing with bounded buffers 1996 • Annual Symposium on Foundations of Computer Science • 390-399 Broder AZ, Frieze AM, Upfal E
Conference A new rounding procedure for the assignment problem with applications to dense graph arrangement problems 1996 • Annual Symposium on Foundations of Computer Science • 21-30 Arora S, Frieze A, Kaplan H
Conference A polynomial-time algorithm for learning noisy linear threshold functions 1996 • Annual Symposium on Foundations of Computer Science • 330-338 Blum A, Frieze A, Kannan R, Vempala S
Journal Article Analysis of parallel algorithms for finding a maximal independent set in a random hypergraph 1996 • Random structures & algorithms (Print) • 9(4):359-377 Chen H, Frieze AM
Journal Article Analysis of two simple heuristics on a random instance of k-SAT 1996 • Journal of Algorithms in Cognition, Informatics and Logic • 20(2):312-355 Frieze A, Suen S
Conference Coloring bipartite hypergraphs 1996 • Lecture Notes in Computer Science • 1084:345-358 Chen H, Frieze A
Conference Efficient algorithm for the vertex disjoint paths problem in random graphs 1996 • Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms • 261-268 Broder AZ, Frieze AM, Suen S, Upfal E
