| 2024 | FOCS | O(1) Insertion for Random Walk d-ary Cuckoo Hashing up to the Load Threshold. | Tolson Bell, Alan M. Frieze |
| 2023 | SODA | Subexponential mixing for partition chains on grid-like graphs. | Alan M. Frieze, Wesley Pegden |
| 2021 | COCOON | The Concentration of the Maximum Degree in the Duplication-Divergence Models. | Alan M. Frieze, Krzysztof Turowski, Wojciech Szpankowski |
| 2020 | SODA | A randomly weighted minimum spanning tree with a random cost constraint. | Alan M. Frieze, Tomasz Tkocz |
| 2020 | WG | Degree Distribution for Duplication-Divergence Graphs: Large Deviations. | Alan M. Frieze, Krzysztof Turowski, Wojciech Szpankowski |
| 2019 | SODA | On the rank of a random binary matrix. | Colin Cooper, Alan M. Frieze, Wesley Pegden |
| 2018 | AofA | The Cover Time of a Biased Random Walk on a Random Cubic Graph. | Colin Cooper, Alan M. Frieze, Tony Johansson |
| 2017 | SODA | On the insertion time of random walk cuckoo hashing. | Alan M. Frieze, Tony Johansson |
| 2016 | ICALP | Discordant Voting Processes on Finite Graphs. | Colin Cooper, Martin E. Dyer, Alan M. Frieze, Nicolas Rivera |
| 2016 | STOC | Separating subadditive euclidean functionals. | Alan M. Frieze, Wesley Pegden |
| 2013 | KDD | Algorithmic techniques for modeling and mining large graphs (AMAzING). | Alan M. Frieze, Aristides Gionis, Charalampos E. Tsourakakis |
| 2012 | WAW | Some Typical Properties of the Spatial Preferred Attachment Model. | Colin Cooper, Alan M. Frieze, Pawel Pralat |
| 2012 | WAW | On Certain Properties of Random Apollonian Networks. | Alan M. Frieze, Charalampos E. Tsourakakis |
| 2011 | SODA | Component structure of the vacant set induced by a random walk on a random graph. | Colin Cooper, Alan M. Frieze |
| 2011 | SODA | Packing tight Hamilton cycles in 3-uniform hypergraphs. | Alan M. Frieze, Michael Krivelevich, Po-Shen Loh |
| 2011 | SIROCCO | The Cover Times of Random Walks on Hypergraphs. | Colin Cooper, Alan M. Frieze, Tomasz Radzik |
| 2009 | ICALP | Multiple Random Walks and Interacting Particle Systems. | Colin Cooper, Alan M. Frieze, Tomasz Radzik |
| 2009 | SODA | An efficient sparse regularity concept. | Amin Coja-Oghlan, Colin Cooper, Alan M. Frieze |
| 2009 | SODA | On smoothed | Amin Coja-Oghlan, Uriel Feige, Alan M. Frieze, Michael Krivelevich, Dan Vilenchik |
| 2009 | SODA | The cover time of random geometric graphs. | Colin Cooper, Alan M. Frieze |
| 2008 | ICALP | Finding a Maximum Matching in a Sparse Random Graph in O(n) Expected Time. | Prasad Chebolu, Alan M. Frieze, Pll Melsted |
| 2008 | STOC | Logconcave random graphs. | Alan M. Frieze, Santosh S. Vempala, Juan Vera |
| 2007 | ISAAC | Separating Populations with Wide Data: A Spectral Analysis. | Avrim Blum, Amin Coja-Oghlan, Alan M. Frieze, Shuheng Zhou |
| 2007 | SODA | Line-of-sight networks. | Alan M. Frieze, Jon M. Kleinberg, R. Ravi, Warren Debany |
| 2007 | WAW | A Geometric Preferential Attachment Model of Networks II. | Abraham D. Flaxman, Alan M. Frieze, Juan Vera |
| 2006 | SODA | Random graphs. | Alan M. Frieze |
| 2005 | ISIT | Identifying codes in random networks. | Alan M. Frieze, Ryan R. Martin, Julien Moncel, Mikls Ruszink, Cliff Smyth |
| 2005 | SODA | The influence of search engines on preferential attachment. | Soumen Chakrabarti, Alan M. Frieze, Juan Vera |
| 2005 | SODA | The cover time of two classes of random graphs. | Colin Cooper, Alan M. Frieze |
| 2005 | SODA | On the random 2-stage minimum spanning tree. | Abraham D. Flaxman, Alan M. Frieze, Michael Krivelevich |
| 2005 | SODA | Adversarial deletion in a scale free random graph process. | Abraham Flaxman, Alan M. Frieze, Juan Vera |
| 2005 | STOC | On the average case performance of some greedy approximation algorithms for the uncapacitated facility location problem. | Abraham Flaxman, Alan M. Frieze, Juan Carlos Vera |
| 2004 | FOCS | Randomly Coloring Constant Degree Graphs. | Martin E. Dyer, Alan M. Frieze, Thomas P. Hayes, Eric Vigoda |
| 2004 | WAW | A Geometric Preferential Attachment Model of Networks. | Abraham Flaxman, Alan M. Frieze, Juan Vera |
| 2003 | SODA | The cover time of sparse random graphs. | Colin Cooper, Alan M. Frieze |
| 2003 | SODA | Perfect matchings in random graphs with prescribed minimal degree. | Alan M. Frieze, Boris G. Pittel |
| 2002 | FOCS | On Random Symmetric Travelling Salesman Problems. | Alan M. Frieze |
| 2002 | SODA | A note on random 2-SAT with prescribed literal degrees. | Colin Cooper, Alan M. Frieze, Gregory B. Sorkin |
| 2002 | SODA | Balls and bins models with feedback. | Eleni Drinea, Alan M. Frieze, Michael Mitzenmacher |
| 2002 | STOC | Crawling on web graphs. | Colin Cooper, Alan M. Frieze |
| 2001 | ESA | A General Model of Undirected Web Graphs. | Colin Cooper, Alan M. Frieze |
| 2001 | FOCS | Arc-Disjoint Paths in Expander Digraphs. | Tom Bohman, Alan M. Frieze |
| 2001 | FOCS | Randomly Colouring Graphs with Lower Bounds on Girth and Maximum Degree. | Martin E. Dyer, Alan M. Frieze |
| 2001 | RECOMB | Optimal sequencing by hybridization in rounds. | Alan M. Frieze, Bjarni V. Halldrsson |
| 2001 | SODA | The probabilistic relationship between the assignment and asymmetric traveling salesman problems. | Alan M. Frieze, Gregory B. Sorkin |
| 2000 | SODA | Edge-disjoint paths in expander graphs. | Alan M. Frieze |
| 1999 | FOCS | Torpid Mixing of Some Monte Carlo Markov Chain Algorithms in Statistical Physics. | Christian Borgs, Jennifer T. Chayes, Alan M. Frieze, Jeong Han Kim, Prasad Tetali, Eric Vigoda, Van H. Vu |
| 1999 | FOCS | On Counting Independent Sets in Sparse Graphs. | Martin E. Dyer, Alan M. Frieze, Mark Jerrum |
| 1999 | RECOMB | On the power of universal bases in sequencing by hybridization. | Franco P. Preparata, Alan M. Frieze, Eli Upfal |
| 1999 | SODA | Clustering in Large Graphs and Matrices. | Petros Drineas, Alan M. Frieze, Ravi Kannan, Santosh S. Vempala, V. Vinay |
| 1999 | SODA | Optimal Construction of Edge-Disjoint Paths in Random Regular Graphs. | Alan M. Frieze, Lei Zhao |
| 1998 | FOCS | Fast Monte-Carlo Algorithms for Finding Low-Rank Approximations. | Alan M. Frieze, Ravi Kannan, Santosh S. Vempala |
| 1998 | LATIN | Dynamic Packet Routing on Arrays with Bounded Buffers. | Andrei Z. Broder, Alan M. Frieze, Eli Upfal |
| 1998 | STOC | Min-Wise Independent Permutations (Extended Abstract). | Andrei Z. Broder, Moses Charikar, Alan M. Frieze, Michael Mitzenmacher |
| 1997 | STOC | Static and Dynamic Path Selection on Expander Graphs: A Random Walk Approach (Preliminary Version). | Andrei Z. Broder, Alan M. Frieze, Eli Upfal |
| 1996 | ESA | Greedy Algorithms for the Shortest Common Superstring that are Asmtotically Optimal. | Alan M. Frieze, Wojciech Szpankowski |
| 1996 | FOCS | A New Rounding Procedure for the Assignment Problem with Applications to Dense Graph Arrangement Problems. | Sanjeev Arora, Alan M. Frieze, Haim Kaplan |
| 1996 | FOCS | A Polynomial-Time Algorithm for Learning Noisy Linear Threshold Functions. | Avrim Blum, Alan M. Frieze, Ravi Kannan, Santosh S. Vempala |
| 1996 | FOCS | A General Approach to Dynamic Packet Routing with Bounded Buffers (extended abstract). | Andrei Z. Broder, Alan M. Frieze, Eli Upfal |
| 1996 | FOCS | Learning Linear Transformations. | Alan M. Frieze, Mark Jerrum, Ravi Kannan |
| 1996 | FOCS | The Regularity Lemma and Approximation Schemes for Dense Problems. | Alan M. Frieze, Ravi Kannan |
| 1996 | IPCO | Coloring Bipartite Hypergraphs. | Hui Chen, Alan M. Frieze |
| 1996 | SODA | An Efficient Algorithm for the Vertex-Disjoint Paths Problem in Random Graphs. | Andrei Z. Broder, Alan M. Frieze, Stephen Suen, Eli Upfal |
| 1995 | IPCO | Improved Approximation Algorithms for MAX | Alan M. Frieze, Mark Jerrum |
| 1994 | FOCS | Polynomial time randomised approxmiation schemes for the Tutte polynomial of dense graphs | Noga Alon, Alan M. Frieze, Dominic Welsh |
| 1994 | SODA | On the Greedy Heuristic for Matchings. | Jonathan Aronson, Martin E. Dyer, Alan M. Frieze, Stephen Suen |
| 1994 | SODA | Optimal Construction of Edge-Disjoint Paths in Random Graphs. | Andrei Z. Broder, Alan M. Frieze, Stephen Suen, Eli Upfal |
| 1994 | SODA | Approximately Counting Hamilton Cycles in Dense Graphs. | Martin E. Dyer, Alan M. Frieze, Mark Jerrum |
| 1993 | SODA | On the Satisfiability and Maximum Satisfiability of Random 3-CNF Formulas. | Andrei Z. Broder, Alan M. Frieze, Eli Upfal |
| 1993 | SODA | Analysis of a Simple Greedy Matching Algorithm on Random Cubic Graphs. | Alan M. Frieze, A. J. Radcliffe, Stephen Suen |
| 1992 | ICALP | Near-perfect Token Distribution. | Andrei Z. Broder, Alan M. Frieze, Eli Shamir, Eli Upfal |
| 1992 | IPCO | Random Walks, Totally Unimodular Matrices and a Randomised Dual Simplex Algorithm. | Martin E. Dyer, Alan M. Frieze |
| 1992 | IPCO | When is the Assignment Bound Tight for the Asymmetric Traveling Salesman Problem? | Alan M. Frieze, Richard M. Karp, Bruce A. Reed |
| 1992 | STOC | Existence and Construction of Edge Disjoint Paths on Expander Graphs | Andrei Z. Broder, Alan M. Frieze, Eli Upfal |
| 1992 | SPAA | Separator Based Parallel Divide and Conquer in Computational Geometry. | Alan M. Frieze, Gary L. Miller, Shang-Hua Teng |
| 1991 | STOC | Finding Hidden Hamiltonian Cycles (Extended Abstract) | Andrei Z. Broder, Alan M. Frieze, Eli Shamir |
| 1990 | IPCO | Probabilistic Analysis of the Generalised Assignment Problem. | Martin E. Dyer, Alan M. Frieze |
| 1989 | STOC | A Random Polynomial Time Algorithm for Approximating the Volume of Convex Bodies | Martin E. Dyer, Alan M. Frieze, Ravi Kannan |
| 1986 | FOCS | Fast Solution of Some Random NP-Hard Problems | Martin E. Dyer, Alan M. Frieze |
| 1985 | STOC | An Algorithm for Finding Hamilton Cycles in a Random Graph | Bla Bollobs, Trevor I. Fenner, Alan M. Frieze |
| 1984 | FOCS | Linear Congruential Generators Do Not Produce Random Sequences | Alan M. Frieze, Ravi Kannan, J. C. Lagarias |