The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Alan M. Frieze: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Martin E. Dyer, Alan M. Frieze, Ravi Kannan
    A Random Polynomial Time Algorithm for Approximating the Volume of Convex Bodies. [Citation Graph (2, 0)][DBLP]
    J. ACM, 1991, v:38, n:1, pp:1-17 [Journal]
  2. Alan M. Frieze, Ravi Kannan, Santosh Vempala
    Fast Monte-Carlo Algorithms for Finding Low-Rank Approximations. [Citation Graph (1, 0)][DBLP]
    FOCS, 1998, pp:370-378 [Conf]
  3. Andrei Z. Broder, Alan M. Frieze, Eli Upfal
    On the Satisfiability and Maximum Satisfiability of Random 3-CNF Formulas. [Citation Graph (1, 0)][DBLP]
    SODA, 1993, pp:322-330 [Conf]
  4. Andrei Z. Broder, Moses Charikar, Alan M. Frieze, Michael Mitzenmacher
    Min-Wise Independent Permutations (Extended Abstract). [Citation Graph (1, 0)][DBLP]
    STOC, 1998, pp:327-336 [Conf]
  5. Martin E. Dyer, Alan M. Frieze
    On the Complexity of Computing the Volume of a Polyhedron. [Citation Graph (1, 0)][DBLP]
    SIAM J. Comput., 1988, v:17, n:5, pp:967-974 [Journal]
  6. Abraham Flaxman, Alan M. Frieze
    The Diameter of Randomly Perturbed Digraphs and Some Applications.. [Citation Graph (0, 0)][DBLP]
    APPROX-RANDOM, 2004, pp:345-356 [Conf]
  7. Colin Cooper, Alan M. Frieze
    A General Model of Undirected Web Graphs. [Citation Graph (0, 0)][DBLP]
    ESA, 2001, pp:500-511 [Conf]
  8. Alan M. Frieze, Wojciech Szpankowski
    Greedy Algorithms for the Shortest Common Superstring that are Asmtotically Optimal. [Citation Graph (0, 0)][DBLP]
    ESA, 1996, pp:194-207 [Conf]
  9. Noga Alon, Alan M. Frieze, Dominic Welsh
    Polynomial time randomised approxmiation schemes for the Tutte polynomial of dense graphs [Citation Graph (0, 0)][DBLP]
    FOCS, 1994, pp:24-35 [Conf]
  10. Sanjeev Arora, Alan M. Frieze, Haim Kaplan
    A New Rounding Procedure for the Assignment Problem with Applications to Dense Graph Arrangement Problems. [Citation Graph (0, 0)][DBLP]
    FOCS, 1996, pp:21-30 [Conf]
  11. Avrim Blum, Alan M. Frieze, Ravi Kannan, Santosh Vempala
    A Polynomial-Time Algorithm for Learning Noisy Linear Threshold Functions. [Citation Graph (0, 0)][DBLP]
    FOCS, 1996, pp:330-338 [Conf]
  12. Tom Bohman, Alan M. Frieze
    Arc-Disjoint Paths in Expander Digraphs. [Citation Graph (0, 0)][DBLP]
    FOCS, 2001, pp:558-567 [Conf]
  13. Christian Borgs, Jennifer T. Chayes, Alan M. Frieze, Jeong Han Kim, Prasad Tetali, Eric Vigoda, Van H. Vu
    Torpid Mixing of Some Monte Carlo Markov Chain Algorithms in Statistical Physics. [Citation Graph (0, 0)][DBLP]
    FOCS, 1999, pp:218-229 [Conf]
  14. Andrei Z. Broder, Alan M. Frieze, Eli Upfal
    A General Approach to Dynamic Packet Routing with Bounded Buffers (extended abstract). [Citation Graph (0, 0)][DBLP]
    FOCS, 1996, pp:390-399 [Conf]
  15. Martin E. Dyer, Alan M. Frieze
    Randomly Colouring Graphs with Lower Bounds on Girth and Maximum Degree. [Citation Graph (0, 0)][DBLP]
    FOCS, 2001, pp:579-587 [Conf]
  16. Martin E. Dyer, Alan M. Frieze
    Fast Solution of Some Random NP-Hard Problems [Citation Graph (0, 0)][DBLP]
    FOCS, 1986, pp:331-336 [Conf]
  17. Martin E. Dyer, Alan M. Frieze, Thomas P. Hayes, Eric Vigoda
    Randomly Coloring Constant Degree Graphs. [Citation Graph (0, 0)][DBLP]
    FOCS, 2004, pp:582-589 [Conf]
  18. Martin E. Dyer, Alan M. Frieze, Mark Jerrum
    On Counting Independent Sets in Sparse Graphs. [Citation Graph (0, 0)][DBLP]
    FOCS, 1999, pp:210-217 [Conf]
  19. Alan M. Frieze
    On Random Symmetric Travelling Salesman Problems. [Citation Graph (0, 0)][DBLP]
    FOCS, 2002, pp:789-798 [Conf]
  20. Alan M. Frieze, Mark Jerrum, Ravi Kannan
    Learning Linear Transformations. [Citation Graph (0, 0)][DBLP]
    FOCS, 1996, pp:359-368 [Conf]
  21. Alan M. Frieze, Ravi Kannan
    The Regularity Lemma and Approximation Schemes for Dense Problems. [Citation Graph (0, 0)][DBLP]
    FOCS, 1996, pp:12-20 [Conf]
  22. Alan M. Frieze, Ravi Kannan, J. C. Lagarias
    Linear Congruential Generators Do Not Produce Random Sequences [Citation Graph (0, 0)][DBLP]
    FOCS, 1984, pp:480-484 [Conf]
  23. Andrei Z. Broder, Alan M. Frieze, Eli Shamir, Eli Upfal
    Near-perfect Token Distribution. [Citation Graph (0, 0)][DBLP]
    ICALP, 1992, pp:308-317 [Conf]
  24. Hui Chen, Alan M. Frieze
    Coloring Bipartite Hypergraphs. [Citation Graph (0, 0)][DBLP]
    IPCO, 1996, pp:345-358 [Conf]
  25. Martin E. Dyer, Alan M. Frieze
    Probabilistic Analysis of the Generalised Assignment Problem. [Citation Graph (0, 0)][DBLP]
    IPCO, 1990, pp:189-200 [Conf]
  26. Martin E. Dyer, Alan M. Frieze
    Random Walks, Totally Unimodular Matrices and a Randomised Dual Simplex Algorithm. [Citation Graph (0, 0)][DBLP]
    IPCO, 1992, pp:72-84 [Conf]
  27. Alan M. Frieze, Mark Jerrum
    Improved Approximation Algorithms for MAX k-CUT and MAX BISECTION. [Citation Graph (0, 0)][DBLP]
    IPCO, 1995, pp:1-13 [Conf]
  28. Alan M. Frieze, Richard M. Karp, Bruce A. Reed
    When is the Assignment Bound Tight for the Asymmetric Traveling Salesman Problem? [Citation Graph (0, 0)][DBLP]
    IPCO, 1992, pp:453-461 [Conf]
  29. Andrei Z. Broder, Alan M. Frieze, Eli Upfal
    Dynamic Packet Routing on Arrays with Bounded Buffers. [Citation Graph (0, 0)][DBLP]
    LATIN, 1998, pp:273-281 [Conf]
  30. Richard Cole, Alan M. Frieze, Bruce M. Maggs, Michael Mitzenmacher, Andréa W. Richa, Ramesh K. Sitaraman, Eli Upfal
    On Balls and Bins with Deletions. [Citation Graph (0, 0)][DBLP]
    RANDOM, 1998, pp:145-158 [Conf]
  31. Colin Cooper, Alan M. Frieze, Kurt Mehlhorn, Volker Priebe
    Average-Case Complexity of Shortest-Paths Problems in the Vertex-Potential Model. [Citation Graph (0, 0)][DBLP]
    RANDOM, 1997, pp:15-26 [Conf]
  32. Abraham Flaxman, Alan M. Frieze, Trevor I. Fenner
    High Degree Vertices and Eigenvalues in the Preferential Attachment Graph. [Citation Graph (0, 0)][DBLP]
    RANDOM-APPROX, 2003, pp:264-274 [Conf]
  33. Alan M. Frieze
    Disjoint Paths in Expander Graphs via Random Walks: A Short Survey. [Citation Graph (0, 0)][DBLP]
    RANDOM, 1998, pp:1-14 [Conf]
  34. Alan M. Frieze, Michael Molloy
    The Satisfiability Threshold for Randomly Generated Binary Constraint Satisfaction Problems. [Citation Graph (0, 0)][DBLP]
    RANDOM-APPROX, 2003, pp:275-289 [Conf]
  35. Alan M. Frieze, Bjarni V. Halldórsson
    Optimal sequencing by hybridization in rounds. [Citation Graph (0, 0)][DBLP]
    RECOMB, 2001, pp:141-148 [Conf]
  36. Franco P. Preparata, Alan M. Frieze, Eli Upfal
    On the power of universal bases in sequencing by hybridization. [Citation Graph (0, 0)][DBLP]
    RECOMB, 1999, pp:295-301 [Conf]
  37. Jonathan Aronson, Martin E. Dyer, Alan M. Frieze, Stephen Suen
    On the Greedy Heuristic for Matchings. [Citation Graph (0, 0)][DBLP]
    SODA, 1994, pp:141-149 [Conf]
  38. Andrei Z. Broder, Alan M. Frieze, Stephen Suen, Eli Upfal
    Optimal Construction of Edge-Disjoint Paths in Random Graphs. [Citation Graph (0, 0)][DBLP]
    SODA, 1994, pp:603-612 [Conf]
  39. Andrei Z. Broder, Alan M. Frieze, Stephen Suen, Eli Upfal
    An Efficient Algorithm for the Vertex-Disjoint Paths Problem in Random Graphs. [Citation Graph (0, 0)][DBLP]
    SODA, 1996, pp:261-268 [Conf]
  40. Soumen Chakrabarti, Alan M. Frieze, Juan Vera
    The influence of search engines on preferential attachment. [Citation Graph (0, 0)][DBLP]
    SODA, 2005, pp:293-300 [Conf]
  41. Colin Cooper, Alan M. Frieze
    The cover time of sparse random graphs. [Citation Graph (0, 0)][DBLP]
    SODA, 2003, pp:140-147 [Conf]
  42. Colin Cooper, Alan M. Frieze
    The cover time of two classes of random graphs. [Citation Graph (0, 0)][DBLP]
    SODA, 2005, pp:961-970 [Conf]
  43. Colin Cooper, Alan M. Frieze, Gregory B. Sorkin
    A note on random 2-SAT with prescribed literal degrees. [Citation Graph (0, 0)][DBLP]
    SODA, 2002, pp:316-320 [Conf]
  44. Eleni Drinea, Alan M. Frieze, Michael Mitzenmacher
    Balls and bins models with feedback. [Citation Graph (0, 0)][DBLP]
    SODA, 2002, pp:308-315 [Conf]
  45. Petros Drineas, Alan M. Frieze, Ravi Kannan, Santosh Vempala, V. Vinay
    Clustering in Large Graphs and Matrices. [Citation Graph (0, 0)][DBLP]
    SODA, 1999, pp:291-299 [Conf]
  46. Martin E. Dyer, Alan M. Frieze, Mark Jerrum
    Approximately Counting Hamilton Cycles in Dense Graphs. [Citation Graph (0, 0)][DBLP]
    SODA, 1994, pp:336-343 [Conf]
  47. Abraham D. Flaxman, Alan M. Frieze, Michael Krivelevich
    On the random 2-stage minimum spanning tree. [Citation Graph (0, 0)][DBLP]
    SODA, 2005, pp:919-926 [Conf]
  48. Abraham Flaxman, Alan M. Frieze, Juan Vera
    Adversarial deletion in a scale free random graph process. [Citation Graph (0, 0)][DBLP]
    SODA, 2005, pp:287-292 [Conf]
  49. Alan M. Frieze
    Edge-disjoint paths in expander graphs. [Citation Graph (0, 0)][DBLP]
    SODA, 2000, pp:717-725 [Conf]
  50. Alan M. Frieze
    Random graphs. [Citation Graph (0, 0)][DBLP]
    SODA, 2006, pp:960- [Conf]
  51. Alan M. Frieze, Boris Pittel
    Perfect matchings in random graphs with prescribed minimal degree. [Citation Graph (0, 0)][DBLP]
    SODA, 2003, pp:148-157 [Conf]
  52. Alan M. Frieze, A. J. Radcliffe, Stephen Suen
    Analysis of a Simple Greedy Matching Algorithm on Random Cubic Graphs. [Citation Graph (0, 0)][DBLP]
    SODA, 1993, pp:341-351 [Conf]
  53. Alan M. Frieze, Gregory B. Sorkin
    The probabilistic relationship between the assignment and asymmetric traveling salesman problems. [Citation Graph (0, 0)][DBLP]
    SODA, 2001, pp:652-660 [Conf]
  54. Alan M. Frieze, Lei Zhao
    Optimal Construction of Edge-Disjoint Paths in Random Regular Graphs. [Citation Graph (0, 0)][DBLP]
    SODA, 1999, pp:346-355 [Conf]
  55. Alan M. Frieze, Gary L. Miller, Shang-Hua Teng
    Separator Based Parallel Divide and Conquer in Computational Geometry. [Citation Graph (0, 0)][DBLP]
    SPAA, 1992, pp:420-429 [Conf]
  56. Béla Bollobás, Trevor I. Fenner, Alan M. Frieze
    An Algorithm for Finding Hamilton Cycles in a Random Graph [Citation Graph (0, 0)][DBLP]
    STOC, 1985, pp:430-439 [Conf]
  57. Andrei Z. Broder, Alan M. Frieze, Eli Shamir
    Finding Hidden Hamiltonian Cycles (Extended Abstract) [Citation Graph (0, 0)][DBLP]
    STOC, 1991, pp:182-189 [Conf]
  58. Andrei Z. Broder, Alan M. Frieze, Eli Upfal
    Existence and Construction of Edge Disjoint Paths on Expander Graphs [Citation Graph (0, 0)][DBLP]
    STOC, 1992, pp:140-149 [Conf]
  59. Andrei Z. Broder, Alan M. Frieze, Eli Upfal
    Static and Dynamic Path Selection on Expander Graphs: A Random Walk Approach (Preliminary Version). [Citation Graph (0, 0)][DBLP]
    STOC, 1997, pp:531-539 [Conf]
  60. Colin Cooper, Alan M. Frieze
    Crawling on web graphs. [Citation Graph (0, 0)][DBLP]
    STOC, 2002, pp:419-427 [Conf]
  61. Martin E. Dyer, Alan M. Frieze, Ravi Kannan
    A Random Polynomial Time Algorithm for Approximating the Volume of Convex Bodies [Citation Graph (0, 0)][DBLP]
    STOC, 1989, pp:375-381 [Conf]
  62. Abraham Flaxman, Alan M. Frieze, Juan C. Vera
    On the average case performance of some greedy approximation algorithms for the uncapacitated facility location problem. [Citation Graph (0, 0)][DBLP]
    STOC, 2005, pp:441-449 [Conf]
  63. Abraham Flaxman, Alan M. Frieze, Juan Vera
    A Geometric Preferential Attachment Model of Networks. [Citation Graph (0, 0)][DBLP]
    WAW, 2004, pp:44-55 [Conf]
  64. Avrim Blum, Alan M. Frieze, Ravi Kannan, Santosh Vempala
    A Polynomial-Time Algorithm for Learning Noisy Linear Threshold Functions. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1998, v:22, n:1/2, pp:35-52 [Journal]
  65. Alan M. Frieze, Mark Jerrum
    Improved Approximation Algorithms for MAX k-CUT and MAX BISECTION. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1997, v:18, n:1, pp:67-81 [Journal]
  66. Alan M. Frieze, Wojciech Szpankowski
    Greedy Algorithms for the Shortest Common Superstring That Are Asymptotically Optimal. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1998, v:21, n:1, pp:21-36 [Journal]
  67. Wenceslas Fernandez de la Vega, Alan M. Frieze, Miklos Santha
    Average-Case Analysis of the Merging Algorithm of Hwang and Lin. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1998, v:22, n:4, pp:483-489 [Journal]
  68. Trevor I. Fenner, Alan M. Frieze
    An Algorithm for Finding a Matroid Basis which Maximizes the Products of the Weights of the Elements. [Citation Graph (0, 0)][DBLP]
    BIT, 1985, v:25, n:3, pp:434-438 [Journal]
  69. Alan M. Frieze, Shang-Hua Teng
    On the Complexity of Computing the Diameter of a Polytope. [Citation Graph (0, 0)][DBLP]
    Computational Complexity, 1994, v:4, n:, pp:207-219 [Journal]
  70. Andrew Beveridge, Alan M. Frieze, Colin McDiarmid
    Random Minimum Length Spanning Trees in Regular Graphs. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1998, v:18, n:3, pp:311-333 [Journal]
  71. Tom Bohman, Alan M. Frieze, Miklós Ruszinkó, Lubos Thoma
    Vertex Covers by Edge Disjoint Cliques. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 2001, v:21, n:2, pp:171-197 [Journal]
  72. Béla Bollobás, Trevor I. Fenner, Alan M. Frieze
    An algorithm for finding Hamilton cycles in a random graph. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1987, v:7, n:4, pp:327-341 [Journal]
  73. Trevor I. Fenner, Alan M. Frieze
    On the connectivity of random m-orientable graphs and digraphs. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1982, v:2, n:4, pp:347-359 [Journal]
  74. Alan M. Frieze
    Survival time of a random graph. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1989, v:9, n:2, pp:133-143 [Journal]
  75. Alan M. Frieze, B. Jackson
    Large holes in sparse random graphs. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1987, v:7, n:3, pp:265-274 [Journal]
  76. Alan M. Frieze, Mark Jerrum
    An Analysis of a Monte Carlo Algorithm for Estimating the Permanent. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1995, v:15, n:1, pp:67-83 [Journal]
  77. Alan M. Frieze, Ravi Kannan
    Quick Approximation to Matrices and Applications. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1999, v:19, n:2, pp:175-220 [Journal]
  78. Alan M. Frieze, Colin J. H. McDiarmid
    On random minimum lenght spanning trees. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1989, v:9, n:4, pp:363-374 [Journal]
  79. Alan M. Frieze, Bruce A. Reed
    Covering the Edges of a Random Graph by Cliques. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1995, v:15, n:4, pp:489-497 [Journal]
  80. Alan M. Frieze, Nicholas C. Wormald
    Random k-Sat: A Tight Threshold For Moderately Growing k. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 2005, v:25, n:3, pp:297-305 [Journal]
  81. Tom Bohman, Colin Cooper, Alan M. Frieze
    Min-Wise Independent Linear Permutations. [Citation Graph (0, 0)][DBLP]
    Electr. J. Comb., 2000, v:7, n:, pp:- [Journal]
  82. Tom Bohman, Colin Cooper, Alan M. Frieze, Ryan Martin, Miklós Ruszinkó
    On Randomly Generated Intersecting Hypergraphs. [Citation Graph (0, 0)][DBLP]
    Electr. J. Comb., 2003, v:10, n:, pp:- [Journal]
  83. Tom Bohman, Alan M. Frieze, Miklós Ruszinkó, Lubos Thoma
    Note on Sparse Random Graphs and Cover Graphs. [Citation Graph (0, 0)][DBLP]
    Electr. J. Comb., 2000, v:7, n:, pp:- [Journal]
  84. Michael H. Albert, Alan M. Frieze, Bruce A. Reed
    Multicoloured Hamilton Cycles. [Citation Graph (0, 0)][DBLP]
    Electr. J. Comb., 1995, v:2, n:, pp:- [Journal]
  85. Colin Cooper, Alan M. Frieze
    Multicoloured Hamilton cycles in random graphs; an anti-Ramsey threshold. [Citation Graph (0, 0)][DBLP]
    Electr. J. Comb., 1995, v:2, n:, pp:- [Journal]
  86. Alan M. Frieze
    On the Number of Perfect Matchings and Hamilton Cycles in e-Regular Non-bipartite Graphs. [Citation Graph (0, 0)][DBLP]
    Electr. J. Comb., 2000, v:7, n:, pp:- [Journal]
  87. Alan M. Frieze, Ravi Kannan
    A Simple Algorithm for Constructing Szemere'di's Regularity Partition. [Citation Graph (0, 0)][DBLP]
    Electr. J. Comb., 1999, v:6, n:, pp:- [Journal]
  88. Alan M. Frieze, Miklós Ruszinkó, Lubos Thoma
    A Note on Random Minimum Length Spanning Trees. [Citation Graph (0, 0)][DBLP]
    Electr. J. Comb., 2000, v:7, n:, pp:- [Journal]
  89. Neil J. Calkin, Alan M. Frieze, Brendan D. McKay
    On Subgraph Sizes in Random Graphs. [Citation Graph (0, 0)][DBLP]
    Combinatorics, Probability & Computing, 1992, v:1, n:, pp:123-134 [Journal]
  90. Colin Cooper, Alan M. Frieze
    Multi-Coloured Hamilton Cycles In Random Edge-Coloured Graphs. [Citation Graph (0, 0)][DBLP]
    Combinatorics, Probability & Computing, 2002, v:11, n:2, pp:- [Journal]
  91. Geoffrey Atkinson, Alan M. Frieze
    On the b-Independence Number of Sparse Random Graphs. [Citation Graph (0, 0)][DBLP]
    Combinatorics, Probability & Computing, 2004, v:13, n:3, pp:295-309 [Journal]
  92. Colin Cooper, Alan M. Frieze
    The Size of the Largest Strongly Connected Component of a Random Digraph with a Given Degree Sequence. [Citation Graph (0, 0)][DBLP]
    Combinatorics, Probability & Computing, 2004, v:13, n:3, pp:319-337 [Journal]
  93. Colin Cooper, Alan M. Frieze
    On the Connectivity of Random k-th Nearest Neighbour Graphs. [Citation Graph (0, 0)][DBLP]
    Combinatorics, Probability & Computing, 1995, v:4, n:, pp:343-362 [Journal]
  94. Colin Cooper, Alan M. Frieze, Michael Molloy
    Hamilton Cycles in Random Regular Digraphs. [Citation Graph (0, 0)][DBLP]
    Combinatorics, Probability & Computing, 1994, v:3, n:, pp:39-49 [Journal]
  95. Colin Cooper, Alan M. Frieze, Michael Molloy, Bruce A. Reed
    Perfect Matchings in Random r-regular, s-uniform Hypergraphs. [Citation Graph (0, 0)][DBLP]
    Combinatorics, Probability & Computing, 1996, v:5, n:, pp:1-14 [Journal]
  96. Colin Cooper, Alan M. Frieze, Bruce A. Reed
    Random Regular Graphs Of Non-Constant Degree: Connectivity And Hamiltonicity. [Citation Graph (0, 0)][DBLP]
    Combinatorics, Probability & Computing, 2002, v:11, n:3, pp:- [Journal]
  97. Colin Cooper, Alan M. Frieze, Bruce A. Reed, Oliver Riordan
    Random Regular Graphs Of Non-Constant Degree: Independence And Chromatic Number. [Citation Graph (0, 0)][DBLP]
    Combinatorics, Probability & Computing, 2002, v:11, n:4, pp:- [Journal]
  98. Tom Bohman, Alan M. Frieze, Miklós Ruszinkó, Lubos Thoma
    G-Intersecting Families. [Citation Graph (0, 0)][DBLP]
    Combinatorics, Probability & Computing, 2001, v:10, n:5, pp:- [Journal]
  99. Martin E. Dyer, Alan M. Frieze, Ravi Kannan, Ajai Kapoor, Ljubomir Perkovic, Umesh V. Vazirani
    A Mildly Exponential Time Algorithm for Approximating the Number of Solutions to a Multidimensional Knapsack Problem. [Citation Graph (0, 0)][DBLP]
    Combinatorics, Probability & Computing, 1993, v:2, n:, pp:271-284 [Journal]
  100. Alan M. Frieze, A. J. Radcliffe, Stephen Suen
    Analysis of a Simple Greedy Matching Algorithm on Random Cubic Graphs. [Citation Graph (0, 0)][DBLP]
    Combinatorics, Probability & Computing, 1995, v:4, n:, pp:47-66 [Journal]
  101. Alan M. Frieze, Lei Zhao
    Optimal Construction Of Edge-Disjoint Paths In Random Regular Graphs. [Citation Graph (0, 0)][DBLP]
    Combinatorics, Probability & Computing, 2000, v:9, n:3, pp:- [Journal]
  102. Alan M. Frieze, Michael Molloy
    Broadcasting in Random Graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1994, v:54, n:1, pp:77-79 [Journal]
  103. Alan M. Frieze, Michael Krivelevich
    Hamilton cycles in random subgraphs of pseudo-random graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2002, v:256, n:1-2, pp:137-150 [Journal]
  104. Alan Frieze, Ryan Martin, Julien Moncel, Miklós Ruszinkó, Cliff Smyth
    Codes identifying sets of vertices in random networks. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2007, v:307, n:9-10, pp:1094-1107 [Journal]
  105. Martin E. Dyer, Alan M. Frieze, Thomas P. Hayes, Eric Vigoda
    Randomly coloring constant degree graphs [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2004, v:, n:009, pp:- [Journal]
  106. Noga Alon, Alan M. Frieze, Dominic Welsh
    Polynomial Time Randomised Approximation Schemes for Tutte-Gröthendieck Invariants: The Dense Case [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 1994, v:1, n:5, pp:- [Journal]
  107. K. Burgin, P. Chebolu, Colin Cooper, Alan M. Frieze
    Hamilton cycles in random lifts of graphs. [Citation Graph (0, 0)][DBLP]
    Eur. J. Comb., 2006, v:27, n:8, pp:1282-1293 [Journal]
  108. Yossi Azar, Andrei Z. Broder, Alan M. Frieze
    On the Problem of Approximating the Number of Bases of a Matroid. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1994, v:50, n:1, pp:9-11 [Journal]
  109. Andrei Z. Broder, Martin E. Dyer, Alan M. Frieze, Prabhakar Raghavan, Eli Upfal
    The Worst-Case Running Time of the Random Simplex Algorithm is Exponential in the Height. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1995, v:56, n:2, pp:79-81 [Journal]
  110. Andrei Z. Broder, Alan M. Frieze, Carsten Lund, Steven Phillips, Nick Reingold
    Balanced Allocations for Tree-Like Inputs. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1995, v:55, n:6, pp:329-332 [Journal]
  111. Martin E. Dyer, Alan M. Frieze
    A Partitioning Algorithm for Minimum Weighted Euclidean Matching. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1984, v:18, n:2, pp:59-62 [Journal]
  112. Alan M. Frieze
    Parallel Algorithms for Finding Hamilton Cycles in Random Graphs. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1987, v:25, n:2, pp:111-117 [Journal]
  113. Alan M. Frieze
    On the Random Construction of Heaps. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1988, v:27, n:2, pp:103-109 [Journal]
  114. Andrei Z. Broder, Alan M. Frieze, Eli Upfal
    A general approach to dynamic packet routing with bounded buffers. [Citation Graph (0, 0)][DBLP]
    J. ACM, 2001, v:48, n:2, pp:324-349 [Journal]
  115. Alan M. Frieze, Ravi Kannan, Santosh Vempala
    Fast monte-carlo algorithms for finding low-rank approximations. [Citation Graph (0, 0)][DBLP]
    J. ACM, 2004, v:51, n:6, pp:1025-1041 [Journal]
  116. Béla Bollobás, Trevor I. Fenner, Alan M. Frieze
    On the Best Case of Heapsort. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1996, v:20, n:2, pp:205-217 [Journal]
  117. Colin Cooper, Martin E. Dyer, Alan M. Frieze
    On Markov Chains for Randomly H-Coloring a Graph. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 2001, v:39, n:1, pp:117-134 [Journal]
  118. Martin E. Dyer, Alan M. Frieze
    Planar 3DM is NP-Complete. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1986, v:7, n:2, pp:174-184 [Journal]
  119. Martin E. Dyer, Alan M. Frieze
    The Solution of Some Random NP-Hard Problems in Polynomial Expected Time. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1989, v:10, n:4, pp:451-489 [Journal]
  120. Abraham Flaxman, Alan M. Frieze, Eli Upfal
    Efficient communication in an ad-hoc network. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 2004, v:52, n:1, pp:1-7 [Journal]
  121. Alan M. Frieze
    An Algorithm for Finding Hamilton Cycles in Random Directed Graphs. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1988, v:9, n:2, pp:181-204 [Journal]
  122. Alan M. Frieze, Mark Jerrum, Michael Molloy, Robert W. Robinson, Nicholas C. Wormald
    Generating and Counting Hamilton Cycles in Random Regular Graphs. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1996, v:21, n:1, pp:176-198 [Journal]
  123. Alan M. Frieze, Michael Molloy
    Splitting an Expander Graph. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1999, v:33, n:1, pp:166-172 [Journal]
  124. Alan M. Frieze, Stephen Suen
    Analysis of Two Simple Heuristics on a Random Instance of k-SAT. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1996, v:20, n:2, pp:312-355 [Journal]
  125. Martin E. Dyer, Alan M. Frieze, Stephen Suen
    Ordering Clone Libraries in Computational Biology. [Citation Graph (0, 0)][DBLP]
    Journal of Computational Biology, 1995, v:2, n:2, pp:207-218 [Journal]
  126. Alan M. Frieze, Bjarni V. Halldórsson
    Optimal Sequencing by Hybridization in Rounds. [Citation Graph (0, 0)][DBLP]
    Journal of Computational Biology, 2002, v:9, n:2, pp:355-369 [Journal]
  127. Alan M. Frieze, Franco P. Preparata, Eli Upfal
    Optimal Reconstruction of a Sequence from its Probes. [Citation Graph (0, 0)][DBLP]
    Journal of Computational Biology, 1999, v:6, n:3/4, pp:- [Journal]
  128. Andrei Z. Broder, Moses Charikar, Alan M. Frieze, Michael Mitzenmacher
    Min-Wise Independent Permutations. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 2000, v:60, n:3, pp:630-659 [Journal]
  129. Colin Cooper, Alan M. Frieze
    The limiting probability that alpha-in, ß-out is strongly connected. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1990, v:48, n:1, pp:117-134 [Journal]
  130. Colin Cooper, Alan M. Frieze
    Hamilton Cycles in a Class of Random Directed Graphs. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1994, v:62, n:1, pp:151-163 [Journal]
  131. Trevor I. Fenner, Alan M. Frieze
    Hamiltonian cycles in random regular graphs. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1984, v:37, n:2, pp:103-112 [Journal]
  132. Alan M. Frieze
    Maximum matchings in a class of random graphs. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1986, v:40, n:2, pp:196-212 [Journal]
  133. Alan M. Frieze
    Finding hamilton cycles in sparse random graphs. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1988, v:44, n:2, pp:230-250 [Journal]
  134. Alan M. Frieze, B. Jackson
    Large induced trees in sparse random graphs. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1987, v:42, n:2, pp:181-195 [Journal]
  135. Alan M. Frieze, B. Jackson, Colin J. H. McDiarmid, Bruce A. Reed
    Edge-colouring random graphs. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1988, v:45, n:2, pp:135-149 [Journal]
  136. Alan M. Frieze, Michael Krivelevich
    On packing Hamilton cycles in ?-regular graphs. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 2005, v:94, n:1, pp:159-172 [Journal]
  137. Alan M. Frieze, Tomasz Luczak
    On the independence and chromatic numbers of random regular graphs. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1992, v:54, n:1, pp:123-132 [Journal]
  138. Martin E. Dyer, Trevor I. Fenner, Alan M. Frieze, Andrew Thomason
    On Key Storage in Secure Networks. [Citation Graph (0, 0)][DBLP]
    J. Cryptology, 1995, v:8, n:4, pp:189-200 [Journal]
  139. Petros Drineas, Alan M. Frieze, Ravi Kannan, Santosh Vempala, V. Vinay
    Clustering Large Graphs via the Singular Value Decomposition. [Citation Graph (0, 0)][DBLP]
    Machine Learning, 2004, v:56, n:1-3, pp:9-33 [Journal]
  140. Alan M. Frieze
    On Random Symmetric Travelling Salesman Problems. [Citation Graph (0, 0)][DBLP]
    Math. Oper. Res., 2004, v:29, n:4, pp:878-890 [Journal]
  141. Martin E. Dyer, Alan M. Frieze
    On Patching Algorithms for Random Asymmetric Travelling Salesman Problems. [Citation Graph (0, 0)][DBLP]
    Math. Program., 1990, v:46, n:, pp:361-378 [Journal]
  142. Martin E. Dyer, Alan M. Frieze
    Probabilistic analysis of the generalised assignment problem. [Citation Graph (0, 0)][DBLP]
    Math. Program., 1992, v:55, n:, pp:169-181 [Journal]
  143. Martin E. Dyer, Alan M. Frieze
    Random walks, totally unimodular matrices, and a randomised dual simplex algorithm. [Citation Graph (0, 0)][DBLP]
    Math. Program., 1994, v:64, n:, pp:1-16 [Journal]
  144. Alan M. Frieze, J. Yadegar, S. El-Horbaty, D. Parkinson
    Algorithms for assignment problems on an array processor. [Citation Graph (0, 0)][DBLP]
    Parallel Computing, 1989, v:11, n:2, pp:151-162 [Journal]
  145. Tom Bohman, Alan M. Frieze
    Avoiding a giant component. [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 2001, v:19, n:1, pp:75-85 [Journal]
  146. Tom Bohman, Alan M. Frieze
    Addendum to avoiding a giant component. [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 2002, v:20, n:1, pp:126-130 [Journal]
  147. Tom Bohman, Alan M. Frieze, Michael Krivelevich, Ryan Martin
    Adding random edges to dense graphs. [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 2004, v:24, n:2, pp:105-117 [Journal]
  148. Tom Bohman, Alan M. Frieze, Ryan Martin
    How many random edges make a dense graph hamiltonian? [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 2003, v:22, n:1, pp:33-42 [Journal]
  149. Tom Bohman, Alan M. Frieze, Nicholas C. Wormald
    Avoidance of a giant component in half the edge set of a random graph. [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 2004, v:25, n:4, pp:432-449 [Journal]
  150. Noga Alon, Alan M. Frieze, Dominic Welsh
    Polynomial Time Randomized Approximation Schemes for Tutte-Gröthendieck Invariants: The Dense Case. [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 1995, v:6, n:4, pp:459-478 [Journal]
  151. Béla Bollobás, Alan M. Frieze
    Spanning Maximal Planar Subgraphs of Random Graphs. [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 1991, v:2, n:2, pp:225-232 [Journal]
  152. Jonathan Aronson, Martin E. Dyer, Alan M. Frieze, Stephen Suen
    Randomized Greedy Matching II. [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 1995, v:6, n:1, pp:55-74 [Journal]
  153. Jonathan Aronson, Alan M. Frieze, Boris Pittel
    Maximum matchings in sparse random graphs: Karp-Sipser revisited. [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 1998, v:12, n:2, pp:111-177 [Journal]
  154. Andrei Z. Broder, Alan M. Frieze, Eli Shamir
    Finding Hidden Hamiltonian Cycles. [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 1994, v:5, n:3, pp:395-411 [Journal]
  155. Andrei Z. Broder, Alan M. Frieze, Eli Shamir, Eli Upfal
    Near-perfect Token Distribution. [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 1994, v:5, n:4, pp:559-572 [Journal]
  156. Andrei Z. Broder, Alan M. Frieze, Eli Upfal
    Static and Dynamic Path Selection on Expander Graphs: A Random Walk Approach. [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 1999, v:14, n:1, pp:87-109 [Journal]
  157. Neil J. Calkin, Alan M. Frieze
    Probabilistic Analysis of a Parallel Algorithm for Finding Maximal Independent Sets. [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 1990, v:1, n:1, pp:39-50 [Journal]
  158. Neil J. Calkin, Alan M. Frieze, Ludek Kucera
    On the Expected Performance of a Parallel Algorithm for Finding Maximal Independent Subsets of a Random Graph. [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 1992, v:3, n:2, pp:215-222 [Journal]
  159. Hui Chen, Alan M. Frieze
    Analysis of parallel algorithms for finding a maximal independent set in a random hypergraph. [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 1996, v:9, n:4, pp:359-377 [Journal]
  160. Colin Cooper, Alan M. Frieze
    Hamilton cycles in random graphs and directed graphs. [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 2000, v:16, n:4, pp:369-401 [Journal]
  161. Colin Cooper, Alan M. Frieze
    A general model of web graphs. [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 2003, v:22, n:3, pp:311-335 [Journal]
  162. Colin Cooper, Alan M. Frieze
    Mixing properties of the Swendsen-Wang process on classes of graphs. [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 1999, v:15, n:3-4, pp:242-261 [Journal]
  163. Colin Cooper, Alan M. Frieze, Kurt Mehlhorn, Volker Priebe
    Average-case complexity of shortest-paths problems in the vertex-potential model. [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 2000, v:16, n:1, pp:33-46 [Journal]
  164. Martin E. Dyer, Alan M. Frieze
    Randomly coloring graphs with lower bounds on girth and maximum degree. [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 2003, v:23, n:2, pp:167-179 [Journal]
  165. Martin E. Dyer, Alan M. Frieze
    Randomized Greedy Matching. [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 1991, v:2, n:1, pp:29-46 [Journal]
  166. Martin E. Dyer, Alan M. Frieze
    Probabilistic Analysis of a Parallel Algorithm for Finding the Lexicographically First Depth First Search Tree in a Dense Random Graph. [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 1991, v:2, n:2, pp:233-240 [Journal]
  167. Martin E. Dyer, Abraham D. Flaxman, Alan M. Frieze, Eric Vigoda
    Randomly coloring sparse random graphs with fewer colors than the maximum degree. [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 2006, v:29, n:4, pp:450-465 [Journal]
  168. Abraham D. Flaxman, Alan M. Frieze, Michael Krivelevich
    On the random 2-stage minimum spanning tree. [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 2006, v:28, n:1, pp:24-36 [Journal]
  169. Alan M. Frieze
    Hamilton cycles in the union of random permutations. [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 2001, v:18, n:1, pp:83-94 [Journal]
  170. Alan M. Frieze
    Perfect matchings in random bipartite graphs with minimal degree at least 2. [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 2005, v:26, n:3, pp:319-358 [Journal]
  171. Alan M. Frieze, Svante Janson
    Perfect Matchings in Random s-Uniform Hypergraphs. [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 1995, v:7, n:1, pp:41-58 [Journal]
  172. Alan M. Frieze, Svante Janson, Tomasz Luczak
    Introduction. [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 1994, v:5, n:1, pp:1-3 [Journal]
  173. Alan M. Frieze, Michael Krivelevich
    Almost universal graphs. [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 2006, v:28, n:4, pp:499-510 [Journal]
  174. Alan M. Frieze, Michael Krivelevich, Ryan Martin
    The emergence of a giant component in random subgraphs of pseudo-random graphs. [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 2004, v:24, n:1, pp:42-50 [Journal]
  175. Alan M. Frieze, Michael Molloy
    The satisfiability threshold for randomly generated binary constraint satisfaction problems. [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 2006, v:28, n:3, pp:323-339 [Journal]
  176. Alan M. Frieze, Brendan D. McKay
    Multicolored Trees in Random Graphs. [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 1994, v:5, n:1, pp:45-56 [Journal]
  177. Alan M. Frieze, Colin McDiarmid
    Algorithmic theory of random graphs. [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 1997, v:10, n:1-2, pp:5-42 [Journal]
  178. Alan M. Frieze, Stephen Suen
    Counting the Number of Hamilton Cycles in Random Digraphs. [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 1992, v:3, n:3, pp:235-242 [Journal]
  179. Alan M. Frieze, Stephen Suen
    On the Independence Number of Random Cubic Graphs. [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 1994, v:5, n:5, pp:649-664 [Journal]
  180. Tom Bohman, Alan M. Frieze
    Arc-Disjoint Paths in Expander Digraphs. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2003, v:32, n:2, pp:326-344 [Journal]
  181. Andrei Z. Broder, Alan M. Frieze, Stephen Suen, Eli Upfal
    Optimal Construction of Edge-Disjoint Paths in Random Graphs. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1998, v:28, n:2, pp:541-573 [Journal]
  182. Andrei Z. Broder, Alan M. Frieze, Eli Upfal
    Existence and Construction of Edge-Disjoint Paths on Expander Graphs. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1994, v:23, n:5, pp:976-989 [Journal]
  183. Martin E. Dyer, Alan M. Frieze, Mark Jerrum
    On Counting Independent Sets in Sparse Graphs. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2002, v:31, n:5, pp:1527-1541 [Journal]
  184. Martin E. Dyer, Alan M. Frieze, Mark Jerrum
    Approximately Counting Hamilton Paths and Cycles in Dense Graphs. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1998, v:27, n:5, pp:1262-1272 [Journal]
  185. Alan M. Frieze
    Edge-Disjoint Paths in Expander Graphs. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2000, v:30, n:6, pp:1790-1801 [Journal]
  186. Alan M. Frieze
    On the Lagarias-Odlyzko Algorithm for the Subset Sum Problem. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1986, v:15, n:2, pp:536-539 [Journal]
  187. Alan M. Frieze
    On the Exact Solution of Random Travelling Salesman Problems with Medium Size Integer Coefficients. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1987, v:16, n:6, pp:1052-1072 [Journal]
  188. Alan M. Frieze, Johan Håstad, Ravi Kannan, J. C. Lagarias, Adi Shamir
    Reconstructing Truncated Integer Variables Satisfying Linear Congruences. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1988, v:17, n:2, pp:262-280 [Journal]
  189. Alan M. Frieze, Richard M. Karp, Bruce A. Reed
    When is the Assignment Bound Tight for the Asymmetric Traveling-Salesman Problem? [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1995, v:24, n:3, pp:484-493 [Journal]
  190. Alan M. Frieze, Colin McDiarmid, Bruce A. Reed
    Greedy Matching on the Line. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1990, v:19, n:4, pp:666-672 [Journal]
  191. Colin Cooper, Alan M. Frieze
    The Cover Time of Random Regular Graphs. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 2005, v:18, n:4, pp:728-740 [Journal]
  192. Alan M. Frieze, Michael Krivelevich, Benny Sudakov
    The Strong Chromatic Index of Random Graphs. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 2005, v:19, n:3, pp:719-727 [Journal]
  193. Alan M. Frieze, Michal Karonski, Lubos Thoma
    On Perfect Matchings and Hamilton Cycles in Sums of Random Trees. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 1999, v:12, n:2, pp:208-216 [Journal]
  194. Martin E. Dyer, Alan M. Frieze, Michael Molloy
    A probabilistic analysis of randomly generated binary constraint satisfaction problems. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:290, n:3, pp:1815-1828 [Journal]
  195. Colin Cooper, Alan Frieze
    The Cover Time of Random Digraphs. [Citation Graph (0, 0)][DBLP]
    APPROX-RANDOM, 2007, pp:422-435 [Conf]
  196. Alan Frieze, Jon M. Kleinberg, R. Ravi, Warren Debany
    Line-of-sight networks. [Citation Graph (0, 0)][DBLP]
    SODA, 2007, pp:968-977 [Conf]
  197. Abraham D. Flaxman, Alan M. Frieze, Juan Vera
    A Geometric Preferential Attachment Model of Networks II. [Citation Graph (0, 0)][DBLP]
    WAW, 2007, pp:41-55 [Conf]
  198. Colin Cooper, Alan Frieze, Gregory B. Sorkin
    Random 2-SAT with Prescribed Literal Degrees. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2007, v:48, n:3, pp:249-265 [Journal]
  199. Alan M. Frieze
    On large matchings and cycles in sparse random graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1986, v:59, n:3, pp:243-256 [Journal]
  200. Alan M. Frieze
    Partitioning random graphs into large cycles. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1988, v:70, n:2, pp:149-158 [Journal]
  201. Trevor I. Fenner, Alan M. Frieze
    On the existence of Hamiltonian cycles in a class of random graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1983, v:45, n:2-3, pp:301-305 [Journal]
  202. Alan M. Frieze
    On the independence number of random graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1990, v:81, n:2, pp:171-175 [Journal]
  203. Michael H. Albert, Alan M. Frieze
    Occupancy problems and random algebras. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1991, v:87, n:1, pp:1-8 [Journal]
  204. Alan Frieze, Bruce Reed
    Polychromatic Hamilton cycles. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1993, v:118, n:1-3, pp:69-74 [Journal]
  205. Alan Frieze, Juan Vera
    On randomly colouring locally sparse graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics & Theoretical Computer Science, 2006, v:8, n:1, pp:121-128 [Journal]

  206. Average-Case Analyses of Vickrey Costs. [Citation Graph (, )][DBLP]


  207. An Analysis of Random-Walk Cuckoo Hashing. [Citation Graph (, )][DBLP]


  208. A new approach to the planted clique problem. [Citation Graph (, )][DBLP]


  209. Finding a Maximum Matching in a Sparse Random Graph in O(n) Expected Time. [Citation Graph (, )][DBLP]


  210. Multiple Random Walks and Interacting Particle Systems. [Citation Graph (, )][DBLP]


  211. Separating Populations with Wide Data: A Spectral Analysis. [Citation Graph (, )][DBLP]


  212. On smoothed k-CNF formulas and the Walksat algorithm. [Citation Graph (, )][DBLP]


  213. The cover time of random geometric graphs. [Citation Graph (, )][DBLP]


  214. An efficient sparse regularity concept. [Citation Graph (, )][DBLP]


  215. Logconcave random graphs. [Citation Graph (, )][DBLP]


  216. Random Walks on Random Graphs. [Citation Graph (, )][DBLP]


  217. Randomly colouring simple hypergraphs [Citation Graph (, )][DBLP]


  218. Maximum Matchings in Random Bipartite Graphs and the Space Utilization of Cuckoo Hashtables [Citation Graph (, )][DBLP]


  219. Average case performance of heuristics for multi-dimensional assignment problems [Citation Graph (, )][DBLP]


  220. A note on the random greedy triangle-packing algorithm [Citation Graph (, )][DBLP]


  221. Component structure induced by a random walk on a random graph [Citation Graph (, )][DBLP]


  222. Average-case performance of heuristics for three-dimensional assignment problems [Citation Graph (, )][DBLP]


  223. First-Order Definability of Trees and Sparse Random Graphs. [Citation Graph (, )][DBLP]


  224. On the Chromatic Number of Random Graphs with a Fixed Degree Sequence. [Citation Graph (, )][DBLP]


  225. Adversarial Deletion in a Scale-Free Random Graph Process. [Citation Graph (, )][DBLP]


  226. On the Average Case Performance of Some Greedy Approximation Algorithms For the Uncapacitated Facility Location Problem. [Citation Graph (, )][DBLP]


  227. Line-of-Sight Networks. [Citation Graph (, )][DBLP]


  228. On an optimization problem with nested constraints. [Citation Graph (, )][DBLP]


Search in 0.019secs, Finished in 0.030secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002