default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDLeslie Ann Goldberg
Leslie A. Henderson
Person information
- affiliation: University of Oxford, UK
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j109]Leslie Ann Goldberg, Marc Roth:
Parameterised and Fine-Grained Subgraph Counting, Modulo 2. Algorithmica 86(4): 944-1005 (2024)- [j108]Andreas Göbel
, Leslie Ann Goldberg, Marc Roth:
The Weisfeiler-Leman Dimension of Conjunctive Queries. Proc. ACM Manag. Data 2(2): 86 (2024) - [j107]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): 113 (2024) - [j106]Marco Bressan, Leslie Ann Goldberg, Kitty Meeks, Marc Roth:
Counting Subgraphs in Somewhere Dense Graphs. SIAM J. Comput. 53(5): 1409-1438 (2024) - [j105]Zongchen Chen, Andreas Galanis, Leslie Ann Goldberg, Heng Guo, Andrés Herrera-Poyatos, Nitya Mani, Ankur Moitra:
Fast Sampling of Satisfying Assignments from Random \(\boldsymbol{k}\)-SAT with Applications to Connectivity. SIAM J. Discret. Math. 38(4): 2750-2811 (2024) - [j104]Ivona Bezáková, Andreas Galanis, Leslie Ann Goldberg, Daniel Stefankovic:
Fast Sampling via Spectral Independence Beyond Bounded-degree Graphs. ACM Trans. Algorithms 20(1): 7:1-7:26 (2024) - [j103]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: 114785 (2024) - [c89]Yumou Fei, Leslie Ann Goldberg, Pinyan Lu:
Two-State Spin Systems with Negative Interactions. ITCS 2024: 45:1-45:13 - [i91]Andreas Galanis, Leslie Ann Goldberg, Paulina Smolarova:
Planting and MCMC Sampling from the Potts model. CoRR abs/2410.14409 (2024) - 2023
- [j102]Andreas Galanis, Leslie Ann Goldberg, Daniel Stefankovic:
Implementations and the independent set polynomial below the Shearer threshold. Theor. Comput. Sci. 939: 194-215 (2023) - [c88]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: 64:1-64:12 - [c87]Leslie Ann Goldberg, Marc Roth:
Parameterised and Fine-Grained Subgraph Counting, Modulo 2. ICALP 2023: 68:1-68:17 - [c86]Marco Bressan, Leslie Ann Goldberg, Kitty Meeks, Marc Roth:
Counting Subgraphs in Somewhere Dense Graphs. ITCS 2023: 27:1-27:14 - [c85]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: 586-625 - [c84]Leslie Ann Goldberg, John Lapinskas:
Instability of backoff protocols with arbitrary arrival rates. SODA 2023: 3426-3436 - [i90]Leslie Ann Goldberg, Marc Roth:
Parameterised and Fine-grained Subgraph Counting, modulo 2. CoRR abs/2301.01696 (2023) - [i89]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 abs/2303.08118 (2023) - [i88]Andreas Galanis, Leslie Ann Goldberg, Paulina Smolarova:
Sampling from the random cluster model on random regular graphs at all temperatures via Glauber dynamics. CoRR abs/2305.13239 (2023) - [i87]Yumou Fei, Leslie Ann Goldberg, Pinyan Lu:
Two-State Spin Systems with Negative Interactions. CoRR abs/2309.04735 (2023) - [i86]Andreas Göbel, Leslie Ann Goldberg, Marc Roth:
The Weisfeiler-Leman Dimension of Existential Conjunctive Queries. CoRR abs/2310.19006 (2023) - [i85]Jacob Focke, Leslie Ann Goldberg, Marc Roth, Stanislav Zivný:
Counting Answers to Unions of Conjunctive Queries: Natural Tractability Criteria and Meta-Complexity. CoRR abs/2311.10634 (2023) - 2022
- [j101]Andreas Galanis, Leslie Ann Goldberg, Andrés Herrera-Poyatos:
The complexity of approximating the complex-valued Potts model. Comput. Complex. 31(1): 2 (2022) - [j100]Andreas Galanis, Leslie Ann Goldberg, James Stewart:
Fast mixing via polymers for random graphs with unbounded degree. Inf. Comput. 285(Part): 104894 (2022) - [j99]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): 2159-2204 (2022) - [c83]Leslie Ann Goldberg:
Some New (And Old) Results on Contention Resolution (Invited Talk). ICALP 2022: 3:1-3:3 - [c82]Ivona Bezáková, Andreas Galanis, Leslie Ann Goldberg, Daniel Stefankovic:
Fast Sampling via Spectral Independence Beyond Bounded-Degree Graphs. ICALP 2022: 21:1-21:16 - [c81]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: 45:1-45:20 - [c80]Jacob Focke, Leslie Ann Goldberg, Marc Roth, Stanislav Zivný:
Approximately Counting Answers to Conjunctive Queries with Disequalities and Negations. PODS 2022: 315-324 - [i84]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 abs/2202.05777 (2022) - [i83]Leslie Ann Goldberg, John Lapinskas:
Instability of backoff protocols with arbitrary arrival rates. CoRR abs/2203.17144 (2022) - [i82]Andreas Galanis, Leslie Ann Goldberg, Heng Guo, Andrés Herrera-Poyatos:
Fast sampling of satisfying assignments from random k-SAT. CoRR abs/2206.15308 (2022) - [i81]Marco Bressan, Leslie Ann Goldberg, Kitty Meeks, Marc Roth:
Counting Subgraphs in Somewhere Dense Graphs. CoRR abs/2209.03402 (2022) - 2021
- [j98]Andreas Galanis, Leslie Ann Goldberg, Kuan Yang:
Approximating partition functions of bounded-degree Boolean counting Constraint Satisfaction Problems. J. Comput. Syst. Sci. 115: 187-213 (2021) - [j97]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): 294-321 (2021) - [j96]Andreas Galanis, Leslie Ann Goldberg, Heng Guo, Kuan Yang:
Counting Solutions to Random CNF Formulas. SIAM J. Comput. 50(6): 1701-1738 (2021) - [j95]Jacob Focke, Leslie Ann Goldberg, Marc Roth, Stanislav Zivný:
Counting Homomorphisms to K4-Minor-Free Graphs, Modulo 2. SIAM J. Discret. Math. 35(4): 2749-2814 (2021) - [j94]Jacob Focke, Leslie Ann Goldberg, Stanislav Zivný:
The Complexity of Approximately Counting Retractions to Square-free Graphs. ACM Trans. Algorithms 17(3): 22:1-22:51 (2021) - [j93]Leslie Ann Goldberg, John Lapinskas, David Richerby:
Faster exponential-time algorithms for approximately counting independent sets. Theor. Comput. Sci. 892: 48-84 (2021) - [j92]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): 13:1-13:37 (2021) - [j91]Andreas Galanis, Leslie Ann Goldberg, James Stewart:
Fast Algorithms for General Spin Systems on Bipartite Expanders. ACM Trans. Comput. Theory 13(4): 25:1-25:18 (2021) - [c79]Andreas Galanis, Leslie Ann Goldberg, James Stewart:
Fast Mixing via Polymers for Random Graphs with Unbounded Degree. APPROX-RANDOM 2021: 36:1-36:13 - [c78]Leslie Ann Goldberg:
Approximately Counting Graph Homomorphisms and Retractions (Invited Talk). FSTTCS 2021: 3:1-3:1 - [c77]Jacob Focke, Leslie Ann Goldberg, Marc Roth, Stanislav Zivný:
Counting Homomorphisms to K4-minor-free Graphs, modulo 2. SODA 2021: 2303-2314 - [i80]Jacob Focke, Leslie Ann Goldberg, Marc Roth, Stanislav Zivný:
Approximately Counting Answers to Conjunctive Queries with Disequalities and Negations. CoRR abs/2103.12468 (2021) - [i79]Andreas Galanis, Leslie Ann Goldberg, Andrés Herrera-Poyatos:
The complexity of approximating the complex-valued Ising model on bounded degree graphs. CoRR abs/2105.00287 (2021) - [i78]Andreas Galanis, Leslie Ann Goldberg, James Stewart:
Fast mixing via polymers for random graphs with unbounded degree. CoRR abs/2105.00524 (2021) - [i77]Ivona Bezáková, Andreas Galanis, Leslie Ann Goldberg, Daniel Stefankovic:
Fast sampling via spectral independence beyond bounded-degree graphs. CoRR abs/2111.04066 (2021) - 2020
- [j90]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: 95-125 (2020) - [j89]Leslie Ann Goldberg, John Lapinskas, David Richerby:
Phase transitions of the Moran process and algorithmic consequences. Random Struct. Algorithms 56(3): 597-647 (2020) - [j88]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) - [j87]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): 742-793 (2020) - [j86]Miriam Backens, Leslie Ann Goldberg:
Holant Clones and the Approximability of Conservative Holant Problems. ACM Trans. Algorithms 16(2): 23:1-23:55 (2020) - [j85]Martin E. Dyer, Andreas Galanis, Leslie Ann Goldberg, Mark Jerrum, Eric Vigoda:
Random Walks on Small World Networks. ACM Trans. Algorithms 16(3): 37:1-37:33 (2020) - [j84]Jacob Focke, Leslie Ann Goldberg, Stanislav Zivný:
The Complexity of Approximately Counting Retractions. ACM Trans. Comput. Theory 12(3): 15:1-15:43 (2020) - [c76]Andreas Galanis, Leslie Ann Goldberg, Heng Guo, Kuan Yang:
Counting Solutions to Random CNF Formulas. ICALP 2020: 53:1-53:14 - [c75]Andreas Galanis, Leslie Ann Goldberg, Andrés Herrera-Poyatos:
The Complexity of Approximating the Complex-Valued Potts Model. MFCS 2020: 36:1-36:14 - [c74]Andreas Galanis, Leslie Ann Goldberg, James Stewart:
Fast Algorithms for General Spin Systems on Bipartite Expanders. MFCS 2020: 37:1-37:14 - [i76]Andreas Galanis, Leslie Ann Goldberg, James Stewart:
Fast algorithms for general spin systems on bipartite expanders. CoRR abs/2004.13442 (2020) - [i75]Andreas Galanis, Leslie Ann Goldberg, Andrés Herrera-Poyatos:
The complexity of approximating the complex-valued Potts model. CoRR abs/2005.01076 (2020) - [i74]Leslie Ann Goldberg, John Lapinskas, David Richerby:
Faster Exponential-time Algorithms for Approximately Counting Independent Sets. CoRR abs/2005.05070 (2020) - [i73]Jacob Focke, Leslie Ann Goldberg, Marc Roth, Stanislav Zivný:
Counting Homomorphisms to K4-minor-free Graphs, modulo 2. CoRR abs/2006.16632 (2020)
2010 – 2019
- 2019
- [j83]Radu Curticapean, Holger Dell, Fedor V. Fomin, Leslie Ann Goldberg, John Lapinskas:
A Fixed-Parameter Perspective on #BIS. Algorithmica 81(10): 3844-3864 (2019) - [j82]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): 279-349 (2019) - [j81]Jacob Focke, Leslie Ann Goldberg, Stanislav Zivný:
The Complexity of Counting Surjective Homomorphisms and Compactions. SIAM J. Discret. Math. 33(2): 1006-1043 (2019) - [j80]Leslie Ann Goldberg, John Lapinskas, Johannes Lengler, Florian Meier, Konstantinos Panagiotou, Pascal Pfister:
Asymptotically optimal amplifiers for the Moran process. Theor. Comput. Sci. 758: 73-93 (2019) - [j79]Leslie Ann Goldberg, Mark Jerrum:
Approximating Pairwise Correlations in the Ising Model. ACM Trans. Comput. Theory 11(4): 23:1-23:20 (2019) - [c73]Zongchen Chen, Andreas Galanis, Leslie Ann Goldberg, Will Perkins, James Stewart, Eric Vigoda:
Fast Algorithms at Low Temperatures via Markov Chains. APPROX-RANDOM 2019: 41:1-41:14 - [c72]Ivona Bezáková, Andreas Galanis, Leslie Ann Goldberg, Daniel Stefankovic:
The Complexity of Approximating the Matching Polynomial in the Complex Plane. ICALP 2019: 22:1-22:13 - [c71]Jacob Focke, Leslie Ann Goldberg, Stanislav Zivný:
The Complexity of Approximately Counting Retractions. SODA 2019: 2205-2215 - [c70]Leslie Ann Goldberg:
Computational Complexity and Partition Functions (Invited Talk). STACS 2019: 1:1-1:3 - [i72]Andreas Galanis, Leslie Ann Goldberg, James Stewart:
A note on the high-fugacity hard-core model on bounded-degree bipartite expander graphs. CoRR abs/1901.06653 (2019) - [i71]Jacob Focke, Leslie Ann Goldberg, Stanislav Zivný:
The Complexity of Approximately Counting Retractions to Square-Free Graphs. CoRR abs/1907.02319 (2019) - [i70]Andreas Galanis, Leslie Ann Goldberg, Heng Guo, Kuan Yang:
Counting solutions to random CNF formulas. CoRR abs/1911.07020 (2019) - 2018
- [c69]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: 33:1-33:15 - [c68]Jacob Focke, Leslie Ann Goldberg, Stanislav Zivný:
The Complexity of Counting Surjective Homomorphisms and Compactions. SODA 2018: 1772-1781 - [c67]Ivona Bezáková, Andreas Galanis, Leslie Ann Goldberg, Daniel Stefankovic:
Inapproximability of the independent set polynomial in the complex plane. STOC 2018: 1234-1240 - [i69]Leslie Ann Goldberg, John Lapinskas, David Richerby:
Phase Transitions of the Moran Process and Algorithmic Consequences. CoRR abs/1804.02293 (2018) - [i68]Andreas Galanis, Leslie Ann Goldberg, Kuan Yang:
Uniqueness for the 3-State Antiferromagnetic Potts Model on the Tree. CoRR abs/1804.03514 (2018) - [i67]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 abs/1804.04993 (2018) - [i66]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 abs/1804.08111 (2018) - [i65]Jacob Focke, Leslie Ann Goldberg, Stanislav Zivný:
The Complexity of Approximately Counting Retractions. CoRR abs/1807.00590 (2018) - [i64]Ivona Bezáková, Andreas Galanis, Leslie Ann Goldberg, Daniel Stefankovic:
The complexity of approximating the matching polynomial in the complex plane. CoRR abs/1807.04930 (2018) - [i63]Leslie Ann Goldberg, Mark Jerrum:
Approximating Pairwise Correlations in the Ising Model. CoRR abs/1810.05830 (2018) - [i62]Miriam Backens, Leslie Ann Goldberg:
Holant clones and the approximability of conservative holant problems. CoRR abs/1811.00817 (2018) - 2017
- [j78]Leslie Ann Goldberg, Heng Guo:
The Complexity of Approximating complex-valued Ising and Tutte partition functions. Comput. Complex. 26(4): 765-833 (2017) - [j77]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) - [j76]Andreas Galanis, Andreas Göbel, Leslie Ann Goldberg, John Lapinskas, David Richerby:
Amplifiers for the Moran Process. J. ACM 64(1): 5:1-5:90 (2017) - [j75]Andrei Bulatov, Leslie Ann Goldberg, Mark Jerrum, David Richerby, Stanislav Zivný:
Functional clones and expressibility of partition functions. Theor. Comput. Sci. 687: 11-39 (2017) - [j74]Andreas Galanis, Leslie Ann Goldberg, Mark Jerrum:
A Complexity Trichotomy for Approximately Counting List H-Colorings. ACM Trans. Comput. Theory 9(2): 9:1-9:22 (2017) - [c66]Andreas Galanis, Leslie Ann Goldberg, Kuan Yang:
Approximating Partition Functions of Bounded-Degree Boolean Counting Constraint Satisfaction Problems. ICALP 2017: 27:1-27:14 - [c65]Andreas Galanis, Leslie Ann Goldberg, Daniel Stefankovic:
Inapproximability of the Independent Set Polynomial Below the Shearer Threshold. ICALP 2017: 28:1-28:13 - [c64]Radu Curticapean, Holger Dell, Fedor V. Fomin, Leslie Ann Goldberg, John Lapinskas:
A Fixed-Parameter Perspective on #BIS. IPEC 2017: 13:1-13:13 - [i61]Radu Curticapean, Holger Dell, Fedor V. Fomin, Leslie Ann Goldberg, John Lapinskas:
A Fixed-Parameter Perspective on #BIS. CoRR abs/1702.05543 (2017) - [i60]Jacob Focke, Leslie Ann Goldberg, Stanislav Zivný:
The Complexity of Counting Surjective Homomorphisms and Compactions. CoRR abs/1706.08786 (2017) - [i59]Martin E. Dyer, Andreas Galanis, Leslie Ann Goldberg, Mark Jerrum, Eric Vigoda:
Random Walks on Small World Networks. CoRR abs/1707.02467 (2017) - [i58]Ivona Bezáková, Andreas Galanis, Leslie Ann Goldberg, Daniel Stefankovic:
Inapproximability of the independent set polynomial in the complex plane. CoRR abs/1711.00282 (2017) - [i57]Ivona Bezáková, Leslie Ann Goldberg, Mark Jerrum:
Computational Counting (Dagstuhl Seminar 18341). Dagstuhl Reports 7(8): 23-44 (2017) - 2016
- [j73]Martin E. Dyer, Leslie Ann Goldberg, David Richerby:
Counting 4×4 matrix partitions of graphs. Discret. Appl. Math. 213: 76-92 (2016) - [j72]Andreas Galanis, Leslie Ann Goldberg:
The complexity of approximately counting in 2-spin systems on k-uniform bounded-degree hypergraphs. Inf. Comput. 251: 36-66 (2016) - [j71]Jin-Yi Cai, Andreas Galanis, Leslie Ann Goldberg, Heng Guo, Mark Jerrum, Daniel Stefankovic, Eric Vigoda:
#BIS-hardness for 2-spin systems on bipartite bounded degree graphs in the tree non-uniqueness region. J. Comput. Syst. Sci. 82(5): 690-711 (2016) - [j70]Leslie Ann Goldberg, Rob Gysel, John Lapinskas:
Approximately counting locally-optimal structures. J. Comput. Syst. Sci. 82(6): 1144-1160 (2016) - [j69]Josep Díaz, Leslie Ann Goldberg, David Richerby, Maria J. Serna:
Absorption time of the Moran process. Random Struct. Algorithms 49(1): 137-159 (2016) - [j68]Andreas Galanis, Leslie Ann Goldberg, Mark Jerrum:
Approximately Counting H-Colorings is $\#\mathrm{BIS}$-Hard. SIAM J. Comput. 45(3): 680-711 (2016) - [j67]Leslie Ann Goldberg, Mark Jerrum:
The complexity of counting locally maximal satisfying assignments of Boolean CSPs. Theor. Comput. Sci. 634: 35-46 (2016) - [j66]Andreas Göbel, Leslie Ann Goldberg, David Richerby:
Counting Homomorphisms to Square-Free Graphs, Modulo 2. ACM Trans. Comput. Theory 8(3): 12:1-12:29 (2016) - [c63]Ivona Bezáková, Andreas Galanis, Leslie Ann Goldberg, Heng Guo, Daniel Stefankovic:
Approximation via Correlation Decay When Strong Spatial Mixing Fails. ICALP 2016: 45:1-45:13 - [c62]Andreas Galanis, Leslie Ann Goldberg, Mark Jerrum:
A Complexity Trichotomy for Approximately Counting List H-Colourings. ICALP 2016: 46:1-46:13 - [c61]Andreas Galanis, Andreas Göbel, Leslie Ann Goldberg, John Lapinskas, David Richerby:
Amplifiers for the Moran Process. ICALP 2016: 62:1-62:13 - [c60]Andreas Galanis, Leslie Ann Goldberg:
The complexity of approximately counting in 2-spin systems on k-uniform bounded-degree hypergraphs. SODA 2016: 458-468 - [i56]Leslie Ann Goldberg, Mark Jerrum:
A complexity trichotomy for approximately counting list H-colourings. CoRR abs/1602.03985 (2016) - [i55]Andrei A. Bulatov, Leslie Ann Goldberg, Mark Jerrum, David Richerby, Stanislav Zivný:
Functional Clones and Expressibility of Partition Functions. CoRR abs/1609.07377 (2016) - [i54]Andreas Galanis, Leslie Ann Goldberg, Kuan Yang:
Approximating partition functions of bounded-degree Boolean counting Constraint Satisfaction Problems. CoRR abs/1610.04055 (2016) - [i53]Leslie Ann Goldberg, John Lapinskas, Johannes Lengler, Florian Meier, Konstantinos Panagiotou, Pascal Pfister:
Asymptotically Optimal Amplifiers for the Moran Process. CoRR abs/1611.04209 (2016) - [i52]Andreas Galanis, Leslie Ann Goldberg, Daniel Stefankovic:
Inapproximability of the independent set polynomial below the Shearer threshold. CoRR abs/1612.05832 (2016) - 2015
- [j65]Xi Chen, Martin E. Dyer, Leslie Ann Goldberg, Mark Jerrum, Pinyan Lu, Colin McQuillan, David Richerby:
The complexity of approximating conservative counting CSPs. J. Comput. Syst. Sci. 81(1): 311-329 (2015) - [j64]Leslie Ann Goldberg, Mark Jerrum, Colin McQuillan:
Approximating the partition function of planar two-state spin systems. J. Comput. Syst. Sci. 81(1): 330-358 (2015) - [j63]Leslie Ann Goldberg, Mark Jerrum:
A complexity classification of spin systems with an external field. Proc. Natl. Acad. Sci. USA 112(43): 13161-13166 (2015) - [j62]Andreas Göbel, Leslie Ann Goldberg, Colin McQuillan, David Richerby, Tomoyuki Yamakami:
Counting List Matrix Partitions of Graphs. SIAM J. Comput. 44(4): 1089-1118 (2015) - [c59]Leslie Ann Goldberg:
Evolutionary Dynamics on Graphs: Invited Talk. FOGA 2015: 1-2 - [c58]Andreas Galanis, Leslie Ann Goldberg, Mark Jerrum:
Approximately Counting H-Colourings is #\mathrm BIS # BIS -Hard. ICALP (1) 2015: 529-541 - [c57]Andreas Göbel, Leslie Ann Goldberg, David Richerby:
Counting Homomorphisms to Square-Free Graphs, Modulo 2. ICALP (1) 2015: 642-653 - [c56]Leslie Ann Goldberg, Rob Gysel, John Lapinskas:
Approximately Counting Locally-Optimal Structures. ICALP (1) 2015: 654-665 - [i51]Andreas Göbel, Leslie Ann Goldberg, David Richerby:
Counting Homomorphisms to Square-Free Graphs, Modulo 2. CoRR abs/1501.07539 (2015) - [i50]