Leslie Ann Goldberg

ORCID

Publication Activity (10 Years)

Years Active: 1992-2024
Publications (10 Years): 111

Top Venues

CoRR

ICALP

ACM Trans. Comput. Theory

J. Comput. Syst. Sci.

University of Edinburgh, UK (PHD)

Education History

University of Edinburgh, UK

PHD

Publications

Andreas Göbel, Leslie Ann Goldberg, Marc Roth
The Weisfeiler-Leman Dimension of Conjunctive Queries. Proc. ACM Manag. Data 2 (2) (2024)
Leslie Ann Goldberg, Marc Roth, Tassilo Constantin Schwarz
Parameterised approximation of the fixation probability of the dominant mutation in the multi-type Moran process. Theor. Comput. Sci. 1016 (2024)
Leslie Ann Goldberg, Marc Roth
Parameterised and Fine-Grained Subgraph Counting, Modulo 2. Algorithmica 86 (4) (2024)
Yumou Fei, Leslie Ann Goldberg, Pinyan Lu
Two-State Spin Systems with Negative Interactions. ITCS (2024)
Ivona Bezáková, Andreas Galanis, Leslie Ann Goldberg, Daniel Stefankovic
Fast Sampling via Spectral Independence Beyond Bounded-degree Graphs. ACM Trans. Algorithms 20 (1) (2024)
Jacob Focke, Leslie Ann Goldberg, Marc Roth, Stanislav Zivný
Counting Answers to Unions of Conjunctive Queries: Natural Tractability Criteria and Meta-Complexity. Proc. ACM Manag. Data 2 (2) (2024)
Leslie Ann Goldberg, Marc Roth, Tassilo Constantin Schwarz
Parameterised Approximation of the Fixation Probability of the Dominant Mutation in the Multi-Type Moran Process. CoRR (2023)
Yumou Fei, Leslie Ann Goldberg, Pinyan Lu
Two-State Spin Systems with Negative Interactions. CoRR (2023)
Andreas Galanis, Leslie Ann Goldberg, Daniel Stefankovic
Implementations and the independent set polynomial below the Shearer threshold. Theor. Comput. Sci. 939 (2023)
Andreas Galanis, Leslie Ann Goldberg, Paulina Smolarova
Sampling from the Random Cluster Model on Random Regular Graphs at All Temperatures via Glauber Dynamics. APPROX/RANDOM (2023)
Leslie Ann Goldberg, Marc Roth
Parameterised and Fine-grained Subgraph Counting, modulo 2. CoRR (2023)
Andreas Göbel, Leslie Ann Goldberg, Marc Roth
The Weisfeiler-Leman Dimension of Existential Conjunctive Queries. CoRR (2023)
Leslie Ann Goldberg, John Lapinskas
Instability of backoff protocols with arbitrary arrival rates. SODA (2023)
Marco Bressan, Leslie Ann Goldberg, Kitty Meeks, Marc Roth
Counting Subgraphs in Somewhere Dense Graphs. ITCS (2023)
Leslie Ann Goldberg, Marc Roth
Parameterised and Fine-Grained Subgraph Counting, Modulo 2. ICALP (2023)
Andreas Galanis, Leslie Ann Goldberg, Paulina Smolarova
Sampling from the random cluster model on random regular graphs at all temperatures via Glauber dynamics. CoRR (2023)
Jacob Focke, Leslie Ann Goldberg, Marc Roth, Stanislav Zivný
Counting Answers to Unions of Conjunctive Queries: Natural Tractability Criteria and Meta-Complexity. CoRR (2023)
Gwendolyn Farach-Colton, Martin Farach-Colton, Leslie Ann Goldberg, Hanna Komlós, John Lapinskas, Reut Levi, Moti Medina, Miguel A. Mosteiro
Graph Ranking and the Cost of Sybil Defense. EC (2023)
Andreas Galanis, Leslie Ann Goldberg, James Stewart
Fast mixing via polymers for random graphs with unbounded degree. Inf. Comput. 285 (Part) (2022)
Leslie Ann Goldberg
Some New (And Old) Results on Contention Resolution (Invited Talk). ICALP (2022)
Andreas Galanis, Leslie Ann Goldberg, Andrés Herrera-Poyatos
The complexity of approximating the complex-valued Potts model. Comput. Complex. 31 (1) (2022)
Andreas Galanis, Leslie Ann Goldberg, Heng Guo, Andrés Herrera-Poyatos
Fast sampling of satisfying assignments from random k-SAT. CoRR (2022)
Marco Bressan, Leslie Ann Goldberg, Kitty Meeks, Marc Roth
Counting Subgraphs in Somewhere Dense Graphs. CoRR (2022)
Leslie Ann Goldberg, John Lapinskas
Instability of backoff protocols with arbitrary arrival rates. CoRR (2022)
Amin Coja-Oghlan, Andreas Galanis, Leslie Ann Goldberg, Jean Bernoulli Ravelomanana, Daniel Stefankovic, Eric Vigoda
Metastability of the Potts Ferromagnet on Random Regular Graphs. ICALP (2022)
Ivona Bezáková, Andreas Galanis, Leslie Ann Goldberg, Daniel Stefankovic
Fast Sampling via Spectral Independence Beyond Bounded-Degree Graphs. ICALP (2022)
Andreas Galanis, Leslie Ann Goldberg, Andrés Herrera-Poyatos
The Complexity of Approximating the Complex-Valued Ising Model on Bounded Degree Graphs. SIAM J. Discret. Math. 36 (3) (2022)
Jacob Focke, Leslie Ann Goldberg, Marc Roth, Stanislav Zivný
Approximately Counting Answers to Conjunctive Queries with Disequalities and Negations. PODS (2022)
Amin Coja-Oghlan, Andreas Galanis, Leslie Ann Goldberg, Jean Bernoulli Ravelomanana, Daniel Stefankovic, Eric Vigoda
Metastability of the Potts ferromagnet on random regular graphs. CoRR (2022)
Andreas Galanis, Leslie Ann Goldberg, James Stewart
Fast mixing via polymers for random graphs with unbounded degree. CoRR (2021)
Ivona Bezáková, Andreas Galanis, Leslie Ann Goldberg, Daniel Stefankovic
The Complexity of Approximating the Matching Polynomial in the Complex Plane. ACM Trans. Comput. Theory 13 (2) (2021)
Andreas Galanis, Leslie Ann Goldberg, Andrés Herrera-Poyatos
The complexity of approximating the complex-valued Ising model on bounded degree graphs. CoRR (2021)
Jacob Focke, Leslie Ann Goldberg, Marc Roth, Stanislav Zivný
Approximately Counting Answers to Conjunctive Queries with Disequalities and Negations. CoRR (2021)
Jacob Focke, Leslie Ann Goldberg, Stanislav Zivný
The Complexity of Approximately Counting Retractions to Square-free Graphs. ACM Trans. Algorithms 17 (3) (2021)
Andreas Galanis, Leslie Ann Goldberg, Heng Guo, Kuan Yang
Counting Solutions to Random CNF Formulas. SIAM J. Comput. 50 (6) (2021)
Zongchen Chen, Andreas Galanis, Leslie Ann Goldberg, Will Perkins, James Stewart, Eric Vigoda
Fast algorithms at low temperatures via Markov chains. Random Struct. Algorithms 58 (2) (2021)
Leslie Ann Goldberg
Approximately Counting Graph Homomorphisms and Retractions (Invited Talk). FSTTCS (2021)
Jacob Focke, Leslie Ann Goldberg, Marc Roth, Stanislav Zivný
-minor-free Graphs, modulo 2. SODA (2021)
Leslie Ann Goldberg, John Lapinskas, David Richerby
Faster exponential-time algorithms for approximately counting independent sets. Theor. Comput. Sci. 892 (2021)
Andreas Galanis, Leslie Ann Goldberg, James Stewart
Fast Mixing via Polymers for Random Graphs with Unbounded Degree. APPROX-RANDOM (2021)
Andreas Galanis, Leslie Ann Goldberg, Kuan Yang
Approximating partition functions of bounded-degree Boolean counting Constraint Satisfaction Problems. J. Comput. Syst. Sci. 115 (2021)
Ivona Bezáková, Andreas Galanis, Leslie Ann Goldberg, Daniel Stefankovic
Fast sampling via spectral independence beyond bounded-degree graphs. CoRR (2021)
Andreas Galanis, Leslie Ann Goldberg, James Stewart
Fast Algorithms for General Spin Systems on Bipartite Expanders. ACM Trans. Comput. Theory 13 (4) (2021)
Jacob Focke, Leslie Ann Goldberg, Marc Roth, Stanislav Zivný
-Minor-Free Graphs, Modulo 2. SIAM J. Discret. Math. 35 (4) (2021)
Leslie Ann Goldberg, John Lapinskas, David Richerby
Phase transitions of the Moran process and algorithmic consequences. Random Struct. Algorithms 56 (3) (2020)
Jacob Focke, Leslie Ann Goldberg, Stanislav Zivný
The Complexity of Approximately Counting Retractions. ACM Trans. Comput. Theory 12 (3) (2020)
Andreas Galanis, Leslie Ann Goldberg, James Stewart
Fast algorithms for general spin systems on bipartite expanders. CoRR (2020)
Antonio Blanca, Andreas Galanis, Leslie Ann Goldberg, Daniel Stefankovic, Eric Vigoda, Kuan Yang
Sampling in Uniqueness from the Potts and Random-Cluster Models on Random Regular Graphs. SIAM J. Discret. Math. 34 (1) (2020)
Andreas Galanis, Leslie Ann Goldberg, Andrés Herrera-Poyatos
The Complexity of Approximating the Complex-Valued Potts Model. MFCS (2020)
Ivona Bezáková, Andreas Galanis, Leslie Ann Goldberg, Daniel Stefankovic
Inapproximability of the Independent Set Polynomial in the Complex Plane. SIAM J. Comput. 49 (5) (2020)
Jacob Focke, Leslie Ann Goldberg, Marc Roth, Stanislav Zivný
-minor-free Graphs, modulo 2. CoRR (2020)
Miriam Backens, Andrei Bulatov, Leslie Ann Goldberg, Colin McQuillan, Stanislav Zivný
Boolean approximate counting CSPs with weak conservativity, and implications for ferromagnetic two-spin. J. Comput. Syst. Sci. 109 (2020)
Andreas Galanis, Leslie Ann Goldberg, Andrés Herrera-Poyatos
The complexity of approximating the complex-valued Potts model. CoRR (2020)
Miriam Backens, Leslie Ann Goldberg
Holant Clones and the Approximability of Conservative Holant Problems. ACM Trans. Algorithms 16 (2) (2020)
Andreas Galanis, Leslie Ann Goldberg, James Stewart
Fast Algorithms for General Spin Systems on Bipartite Expanders. MFCS (2020)
Leslie Ann Goldberg, John Lapinskas, David Richerby
Faster Exponential-time Algorithms for Approximately Counting Independent Sets. CoRR (2020)
Martin E. Dyer, Andreas Galanis, Leslie Ann Goldberg, Mark Jerrum, Eric Vigoda
Random Walks on Small World Networks. ACM Trans. Algorithms 16 (3) (2020)
Andreas Galanis, Leslie Ann Goldberg, Heng Guo, Kuan Yang
Counting Solutions to Random CNF Formulas. ICALP (2020)
Andreas Galanis, Leslie Ann Goldberg, James Stewart
A note on the high-fugacity hard-core model on bounded-degree bipartite expander graphs. CoRR (2019)
Leslie Ann Goldberg, John Lapinskas, Johannes Lengler, Florian Meier, Konstantinos Panagiotou, Pascal Pfister
Asymptotically optimal amplifiers for the Moran process. Theor. Comput. Sci. 758 (2019)
Radu Curticapean, Holger Dell, Fedor V. Fomin, Leslie Ann Goldberg, John Lapinskas
A Fixed-Parameter Perspective on #BIS. Algorithmica 81 (10) (2019)
Ivona Bezáková, Andreas Galanis, Leslie Ann Goldberg, Heng Guo, Daniel Stefankovic
Approximation via Correlation Decay When Strong Spatial Mixing Fails. SIAM J. Comput. 48 (2) (2019)
Leslie Ann Goldberg
Computational Complexity and Partition Functions (Invited Talk). STACS (2019)
Ivona Bezáková, Andreas Galanis, Leslie Ann Goldberg, Daniel Stefankovic
The Complexity of Approximating the Matching Polynomial in the Complex Plane. ICALP (2019)
Leslie Ann Goldberg, Mark Jerrum
Approximating Pairwise Correlations in the Ising Model. ACM Trans. Comput. Theory 11 (4) (2019)
Jacob Focke, Leslie Ann Goldberg, Stanislav Zivný
The Complexity of Approximately Counting Retractions. SODA (2019)
Andreas Galanis, Leslie Ann Goldberg, Heng Guo, Kuan Yang
Counting solutions to random CNF formulas. CoRR (2019)
Zongchen Chen, Andreas Galanis, Leslie Ann Goldberg, Will Perkins, James Stewart, Eric Vigoda
Fast Algorithms at Low Temperatures via Markov Chains. APPROX-RANDOM (2019)
Jacob Focke, Leslie Ann Goldberg, Stanislav Zivný
The Complexity of Counting Surjective Homomorphisms and Compactions. SIAM J. Discret. Math. 33 (2) (2019)
Jacob Focke, Leslie Ann Goldberg, Stanislav Zivný
The Complexity of Approximately Counting Retractions to Square-Free Graphs. CoRR (2019)
Miriam Backens, Leslie Ann Goldberg
Holant clones and the approximability of conservative holant problems. CoRR (2018)
Jacob Focke, Leslie Ann Goldberg, Stanislav Zivný
The Complexity of Approximately Counting Retractions. CoRR (2018)
Antonio Blanca, Andreas Galanis, Leslie Ann Goldberg, Daniel Stefankovic, Eric Vigoda, Kuan Yang
Sampling in Uniqueness from the Potts and Random-Cluster Models on Random Regular Graphs. CoRR (2018)
Leslie Ann Goldberg, Mark Jerrum
Approximating Pairwise Correlations in the Ising Model. CoRR (2018)
Andreas Galanis, Leslie Ann Goldberg, Kuan Yang
Uniqueness for the 3-State Antiferromagnetic Potts Model on the Tree. CoRR (2018)
Antonio Blanca, Andreas Galanis, Leslie Ann Goldberg, Daniel Stefankovic, Eric Vigoda, Kuan Yang
Sampling in Uniqueness from the Potts and Random-Cluster Models on Random Regular Graphs. APPROX-RANDOM (2018)
Leslie Ann Goldberg, John Lapinskas, David Richerby
Phase Transitions of the Moran Process and Algorithmic Consequences. CoRR (2018)
Ivona Bezáková, Andreas Galanis, Leslie Ann Goldberg, Daniel Stefankovic
The complexity of approximating the matching polynomial in the complex plane. CoRR (2018)
Ivona Bezáková, Andreas Galanis, Leslie Ann Goldberg, Daniel Stefankovic
Inapproximability of the independent set polynomial in the complex plane. STOC (2018)
Miriam Backens, Andrei Bulatov, Leslie Ann Goldberg, Colin McQuillan, Stanislav Zivný
Boolean approximate counting CSPs with weak conservativity, and implications for ferromagnetic two-spin. CoRR (2018)
Jacob Focke, Leslie Ann Goldberg, Stanislav Zivný
The Complexity of Counting Surjective Homomorphisms and Compactions. SODA (2018)
Andreas Galanis, Leslie Ann Goldberg, Kuan Yang
Approximating Partition Functions of Bounded-Degree Boolean Counting Constraint Satisfaction Problems. ICALP (2017)
Radu Curticapean, Holger Dell, Fedor V. Fomin, Leslie Ann Goldberg, John Lapinskas
A Fixed-Parameter Perspective on #BIS. IPEC (2017)
Jacob Focke, Leslie Ann Goldberg, Stanislav Zivný
The Complexity of Counting Surjective Homomorphisms and Compactions. CoRR (2017)
Andreas Galanis, Leslie Ann Goldberg, Mark Jerrum
-Colorings. ACM Trans. Comput. Theory 9 (2) (2017)
Andrei Bulatov, Leslie Ann Goldberg, Mark Jerrum, David Richerby, Stanislav Zivný
Functional clones and expressibility of partition functions. Theor. Comput. Sci. 687 (2017)
Martin E. Dyer, Andreas Galanis, Leslie Ann Goldberg, Mark Jerrum, Eric Vigoda
Random Walks on Small World Networks. CoRR (2017)
Radu Curticapean, Holger Dell, Fedor V. Fomin, Leslie Ann Goldberg, John Lapinskas
A Fixed-Parameter Perspective on #BIS. CoRR (2017)
Andreas Galanis, Andreas Göbel, Leslie Ann Goldberg, John Lapinskas, David Richerby
Amplifiers for the Moran Process. J. ACM 64 (1) (2017)
Ivona Bezáková, Leslie Ann Goldberg, Mark Jerrum
Computational Counting (Dagstuhl Seminar 18341). Dagstuhl Reports 7 (8) (2017)
Paul G. Spirakis, Leslie Ann Goldberg, Antonín Kucera, Giuseppe Persiano
Statement from EATCS President and vice Presidents about the recent US travel restrictions to foreigners. Bull. EATCS 121 (2017)
Leslie Ann Goldberg, Heng Guo
The Complexity of Approximating complex-valued Ising and Tutte partition functions. Comput. Complex. 26 (4) (2017)
Ivona Bezáková, Andreas Galanis, Leslie Ann Goldberg, Daniel Stefankovic
Inapproximability of the independent set polynomial in the complex plane. CoRR (2017)
Andreas Galanis, Leslie Ann Goldberg, Daniel Stefankovic
Inapproximability of the Independent Set Polynomial Below the Shearer Threshold. ICALP (2017)
Andreas Galanis, Leslie Ann Goldberg, Kuan Yang
Approximating partition functions of bounded-degree Boolean counting Constraint Satisfaction Problems. CoRR (2016)
Andreas Galanis, Leslie Ann Goldberg
The complexity of approximately counting in 2-spin systems on k-uniform bounded-degree hypergraphs. Inf. Comput. 251 (2016)
Andreas Galanis, Leslie Ann Goldberg, Mark Jerrum
Approximately Counting H-Colorings is $\#\mathrm{BIS}$-Hard. SIAM J. Comput. 45 (3) (2016)
Leslie Ann Goldberg, Mark Jerrum
A complexity trichotomy for approximately counting list H-colourings. CoRR (2016)
Andreas Galanis, Leslie Ann Goldberg, Mark Jerrum
A Complexity Trichotomy for Approximately Counting List H-Colourings. ICALP (2016)
Leslie Ann Goldberg, Mark Jerrum
The complexity of counting locally maximal satisfying assignments of Boolean CSPs. Theor. Comput. Sci. 634 (2016)

Leslie Ann Goldberg.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Leslie Ann Goldberg