| 2026 | STACS | Planting and MCMC Sampling from the Potts Model. | Andreas Galanis, Leslie Ann Goldberg, Paulina Smolarova |
| 2025 | ICALP | Low-Temperature Sampling on Sparse Random Graphs. | Andreas Galanis, Leslie Ann Goldberg, Paulina Smolarova |
| 2025 | ICALP | One-Shot Learning for k-SAT. | Andreas Galanis, Leslie Ann Goldberg, Xusheng Zhang |
| 2023 | ICALP | Parameterised and Fine-Grained Subgraph Counting, Modulo 2. | Leslie Ann Goldberg, Marc Roth |
| 2023 | SODA | Instability of backoff protocols with arbitrary arrival rates. | Leslie Ann Goldberg, John Lapinskas |
| 2022 | ICALP | Fast Sampling via Spectral Independence Beyond Bounded-Degree Graphs. | Ivona Bezkov, Andreas Galanis, Leslie Ann Goldberg, Daniel Stefankovic |
| 2022 | ICALP | Metastability of the Potts Ferromagnet on Random Regular Graphs. | Amin Coja-Oghlan, Andreas Galanis, Leslie Ann Goldberg, Jean Bernoulli Ravelomanana, Daniel Stefankovic, Eric Vigoda |
| 2022 | ICALP | Some New (And Old) Results on Contention Resolution (Invited Talk). | Leslie Ann Goldberg |
| 2022 | PODS | Approximately Counting Answers to Conjunctive Queries with Disequalities and Negations. | Jacob Focke, Leslie Ann Goldberg, Marc Roth, Stanislav Zivn |
| 2021 | SODA | Counting Homomorphisms to | Jacob Focke, Leslie Ann Goldberg, Marc Roth, Stanislav Zivn |
| 2020 | ICALP | Counting Solutions to Random CNF Formulas. | Andreas Galanis, Leslie Ann Goldberg, Heng Guo, Kuan Yang |
| 2020 | MFCS | The Complexity of Approximating the Complex-Valued Potts Model. | Andreas Galanis, Leslie Ann Goldberg, Andrs Herrera-Poyatos |
| 2020 | MFCS | Fast Algorithms for General Spin Systems on Bipartite Expanders. | Andreas Galanis, Leslie Ann Goldberg, James Stewart |
| 2019 | ICALP | The Complexity of Approximating the Matching Polynomial in the Complex Plane. | Ivona Bezkov, Andreas Galanis, Leslie Ann Goldberg, Daniel Stefankovic |
| 2019 | SODA | The Complexity of Approximately Counting Retractions. | Jacob Focke, Leslie Ann Goldberg, Stanislav Zivn |
| 2019 | STACS | Computational Complexity and Partition Functions (Invited Talk). | Leslie Ann Goldberg |
| 2018 | SODA | The Complexity of Counting Surjective Homomorphisms and Compactions. | Jacob Focke, Leslie Ann Goldberg, Stanislav Zivn |
| 2018 | STOC | Inapproximability of the independent set polynomial in the complex plane. | Ivona Bezkov, Andreas Galanis, Leslie Ann Goldberg, Daniel Stefankovic |
| 2017 | ICALP | Inapproximability of the Independent Set Polynomial Below the Shearer Threshold. | Andreas Galanis, Leslie Ann Goldberg, Daniel Stefankovic |
| 2017 | ICALP | Approximating Partition Functions of Bounded-Degree Boolean Counting Constraint Satisfaction Problems. | Andreas Galanis, Leslie Ann Goldberg, Kuan Yang |
| 2016 | ICALP | Approximation via Correlation Decay When Strong Spatial Mixing Fails. | Ivona Bezkov, Andreas Galanis, Leslie Ann Goldberg, Heng Guo, Daniel Stefankovic |
| 2016 | ICALP | Amplifiers for the Moran Process. | Andreas Galanis, Andreas Gbel, Leslie Ann Goldberg, John Lapinskas, David Richerby |
| 2016 | ICALP | A Complexity Trichotomy for Approximately Counting List H-Colourings. | Andreas Galanis, Leslie Ann Goldberg, Mark Jerrum |
| 2016 | SODA | The complexity of approximately counting in 2-spin systems on | Andreas Galanis, Leslie Ann Goldberg |
| 2015 | FOGA | Evolutionary Dynamics on Graphs: Invited Talk. | Leslie Ann Goldberg |
| 2015 | ICALP | Counting Homomorphisms to Square-Free Graphs, Modulo 2. | Andreas Gbel, Leslie Ann Goldberg, David Richerby |
| 2015 | ICALP | Approximately Counting H-Colourings is #\mathrm BIS # BIS -Hard. | Andreas Galanis, Leslie Ann Goldberg, Mark Jerrum |
| 2015 | ICALP | Approximately Counting Locally-Optimal Structures. | Leslie Ann Goldberg, Rob Gysel, John Lapinskas |
| 2014 | STACS | Counting Homomorphisms to Cactus Graphs Modulo 2. | Andreas Gbel, Leslie Ann Goldberg, David Richerby |
| 2013 | STACS | The complexity of approximating conservative counting CSPs. | Xi Chen, Martin E. Dyer, Leslie Ann Goldberg, Mark Jerrum, Pinyan Lu, Colin McQuillan, David Richerby |
| 2012 | ICALP | The Complexity of Computing the Sign of the Tutte Polynomial (and Consequent #P-hardness of Approximation). | Leslie Ann Goldberg, Mark Jerrum |
| 2012 | SODA | Approximating fixation probabilities in the generalized Moran process. | Josep Daz, Leslie Ann Goldberg, George B. Mertzios, David Richerby, Maria J. Serna, Paul G. Spirakis |
| 2012 | STACS | Log-supermodular functions, functional clones and counting CSPs. | Andrei A. Bulatov, Martin E. Dyer, Leslie Ann Goldberg, Mark Jerrum |
| 2011 | ICALP | A Polynomial-Time Algorithm for Estimating the Partition Function of the Ferromagnetic Ising Model on a Regular Matroid. | Leslie Ann Goldberg, Mark Jerrum |
| 2011 | SPAA | Stabilizing consensus with the power of two choices. | Benjamin Doerr, Leslie Ann Goldberg, Lorenz Minder, Thomas Sauerwald, Christian Scheideler |
| 2010 | ICALP | Approximating the Partition Function of the Ferromagnetic Potts Model. | Leslie Ann Goldberg, Mark Jerrum |
| 2010 | PPSN | Adaptive Drift Analysis. | Benjamin Doerr, Leslie Ann Goldberg |
| 2010 | PPSN | Drift Analysis with Tail Bounds. | Benjamin Doerr, Leslie Ann Goldberg |
| 2010 | STACS | The Complexity of Approximating Bounded-Degree Boolean #CSP. | Martin E. Dyer, Leslie Ann Goldberg, Markus Jalsenius, David Richerby |
| 2009 | STACS | A Complexity Dichotomy for Partition Functions with Mixed Signs. | Leslie Ann Goldberg, Martin Grohe, Mark Jerrum, Marc Thurley |
| 2008 | AAAI | On the Dimensionality of Voting Games. | Edith Elkind, Leslie Ann Goldberg, Paul W. Goldberg, Michael J. Wooldridge |
| 2007 | AAAI | Computational Complexity of Weighted Threshold Games. | Edith Elkind, Leslie Ann Goldberg, Paul W. Goldberg, Michael J. Wooldridge |
| 2007 | STOC | Inapproximability of the Tutte polynomial. | Leslie Ann Goldberg, Mark Jerrum |
| 2006 | ICALP | On Counting Homomorphisms to Directed Acyclic Graphs. | Martin E. Dyer, Leslie Ann Goldberg, Mike Paterson |
| 2006 | SODA | Distributed selfish load balancing. | Petra Berenbrink, Tom Friedetzky, Leslie Ann Goldberg, Paul W. Goldberg, Zengjian Hu, Russell A. Martin |
| 2004 | FOCS | trong Spatial Mixing for Lattice Graphs with Fewer Colours. | Leslie Ann Goldberg, Russell A. Martin, Mike Paterson |
| 2003 | SPAA | A proportionate fair scheduling rule with good worst-case performance. | Micah Adler, Petra Berenbrink, Tom Friedetzky, Leslie Ann Goldberg, Paul W. Goldberg, Mike Paterson |
| 2002 | FOCS | Rapidly Mixing Markov Chains for Sampling Contingency Tables with a Constant Number of Rows. | Mary Cryan, Martin E. Dyer, Leslie Ann Goldberg, Mark Jerrum, Russell A. Martin |
| 2002 | STOC | The complexity of choosing an H-colouring (nearly) uniformly at random. | Leslie Ann Goldberg, Steven Kelk, Mike Paterson |
| 2001 | FOCS | The Natural Work-Stealing Algorithm is Stable. | Petra Berenbrink, Tom Friedetzky, Leslie Ann Goldberg |
| 2000 | ICALP | Tight Size Bounds for Packet Headers in Narrow Meshes. | Micah Adler, Faith E. Fich, Leslie Ann Goldberg, Mike Paterson |
| 2000 | ICALP | A Bound on the Capacity of Backoff and Acknowledgement-Based Protocols. | Leslie Ann Goldberg, Mark Jerrum, Sampath Kannan, Mike Paterson |
| 2000 | SODA | An extension of path coupling and its application to the Glauber dynamics for graph colourings (extended abstract). | Martin E. Dyer, Leslie Ann Goldberg, Catherine S. Greenhill, Mark Jerrum, Michael Mitzenmacher |
| 2000 | STACS | Binary Exponential Backoff Is Stable for High Arrival Rates. | Hesham Al-Ammal, Leslie Ann Goldberg, Philip D. MacKenzie |
| 1999 | SODA | The Complexity of Gene Placement. | Leslie Ann Goldberg, Paul W. Goldberg, Mike Paterson, Pavel A. Pevzner, Sleyman Cenk Sahinalp, Elizabeth Sweedyk |
| 1998 | FOCS | Evolutionary Trees can be Learned in Polynomial Time in the Two-State General Markov Model. | Mary Cryan, Leslie Ann Goldberg, Paul W. Goldberg |
| 1997 | CPM | Approximation Algorithms for the Fixed-Topology Phylogenetic Number Problem. | Mary Cryan, Leslie Ann Goldberg, Cynthia A. Phillips |
| 1997 | FOCS | Contention Resolution with Guaranteed Constant Expected Delay. | Leslie Ann Goldberg, Philip D. MacKenzie |
| 1997 | SODA | Randomly Sampling Molecules. | Leslie Ann Goldberg, Mark Jerrum |
| 1997 | SODA | Better Approximation Guarantees for Job-shop Scheduling. | Leslie Ann Goldberg, Mike Paterson, Aravind Srinivasan, Elizabeth Sweedyk |
| 1996 | COLT | Analysis of a Simple Learning Algorithm: Learning Foraging Thresholds for Lizards. | Leslie Ann Goldberg |
| 1996 | CPM | Constructing Computer Virus Phylogenies. | Leslie Ann Goldberg, Paul W. Goldberg, Cynthia A. Phillips, Gregory B. Sorkin |
| 1996 | SODA | Analysis of Practical Backoff Protocols for Contention Resolution with Multiple Servers. | Leslie Ann Goldberg, Philip D. MacKenzie |
| 1995 | CPM | Minimizing Phylogenetic Number to find Good Evolutionary Trees. | Leslie Ann Goldberg, Paul W. Goldberg, Cynthia A. Phillips, Elizabeth Sweedyk, Tandy J. Warnow |
| 1994 | SPAA | An W(log log n) Lower Bound for Routing in Optical Networks. | Leslie Ann Goldberg, Mark Jerrum, Philip D. MacKenzie |
| 1994 | SPAA | An Optical Simulation of Shared Memory. | Leslie Ann Goldberg, Yossi Matias, Satish Rao |
| 1993 | STOC | Polynomial space polynomial delay algorithms for listing families of graphs. | Leslie Ann Goldberg |
| 1993 | SPAA | A Doubly Logarithmic Communication Algorithm for the Completely Connected Optical Communication Parallel Computer. | Leslie Ann Goldberg, Mark Jerrum, Frank Thomson Leighton, Satish Rao |