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
[j108]Leslie Ann Goldberg, Marc Roth:
Parameterised and Fine-Grained Subgraph Counting, Modulo 2. Algorithmica 86(4): 944-1005 (2024)- [j107]Andreas Göbel
, Leslie Ann Goldberg, Marc Roth:
The Weisfeiler-Leman Dimension of Conjunctive Queries. Proc. ACM Manag. Data 2(2): 86 (2024) - [j106]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) - [j105]Marco Bressan, Leslie Ann Goldberg, Kitty Meeks, Marc Roth:
Counting Subgraphs in Somewhere Dense Graphs. SIAM J. Comput. 53(5): 1409-1438 (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 - 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]Andreas Galanis, Leslie Ann Goldberg, Mark Jerrum:
Approximately Counting H-Colourings is #BIS-Hard. CoRR abs/1502.01335 (2015) - [i49]Andreas Galanis, Leslie Ann Goldberg:
The complexity of approximately counting in 2-spin systems on $k$-uniform bounded-degree hypergraphs. CoRR abs/1505.06146 (2015) - [i48]Leslie Ann Goldberg, Mark Jerrum:
The complexity of Boolean #MaximalCSP. CoRR abs/1509.03543 (2015) - [i47]Ivona Bezáková, Andreas Galanis, Leslie Ann Goldberg, Heng Guo, Daniel Stefankovic:
Approximation via Correlation Decay when Strong Spatial Mixing Fails. CoRR abs/1510.09193 (2015) - [i46]Andreas Galanis, Andreas Göbel, Leslie Ann Goldberg, John Lapinskas, David Richerby:
Amplifiers for the Moran Process. CoRR abs/1512.05632 (2015) - 2014
- [j61]Josep Díaz, Leslie Ann Goldberg, George B. Mertzios, David Richerby, Maria J. Serna, Paul G. Spirakis:
Approximating Fixation Probabilities in the Generalized Moran Process. Algorithmica 69(1): 78-91 (2014) - [j60]Leslie Ann Goldberg, Mark Jerrum:
The Complexity of Computing the Sign of the Tutte Polynomial. SIAM J. Comput. 43(6): 1921-1952 (2014) - [j59]Leslie Ann Goldberg, Mark Jerrum:
The Complexity of Approximately Counting Tree Homomorphisms. ACM Trans. Comput. Theory 6(2): 8:1-8:31 (2014) - [j58]Andreas Göbel, Leslie Ann Goldberg, David Richerby:
The complexity of counting homomorphisms to cactus graphs modulo 2. ACM Trans. Comput. Theory 6(4): 17:1-17:29 (2014) - [c55]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. APPROX-RANDOM 2014: 582-595 - [c54]Josep Díaz, Leslie Ann Goldberg, David Richerby, Maria J. Serna:
Absorption Time of the Moran Process. APPROX-RANDOM 2014: 630-642 - [c53]Andreas Göbel, Leslie Ann Goldberg, Colin McQuillan, David Richerby, Tomoyuki Yamakami:
Counting List Matrix Partitions of Graphs. CCC 2014: 56-65 - [c52]Andreas Göbel, Leslie Ann Goldberg, David Richerby:
Counting Homomorphisms to Cactus Graphs Modulo 2. STACS 2014: 350-361 - [i45]Martin E. Dyer, Leslie Ann Goldberg, David Richerby:
Counting 4×4 Matrix Partitions of Graphs. CoRR abs/1407.7799 (2014) - [i44]Leslie Ann Goldberg, Heng Guo:
The complexity of approximating complex-valued Ising and Tutte partition functions with applications to quantum simulation. CoRR abs/1409.5627 (2014) - [i43]Leslie Ann Goldberg, Rob Gysel, John Lapinskas:
Approximately counting locally-optimal structures. CoRR abs/1411.6829 (2014) - 2013
- [j57]Benjamin Doerr, Leslie Ann Goldberg:
Adaptive Drift Analysis. Algorithmica 65(1): 224-250 (2013) - [j56]Leslie Ann Goldberg:
The EATCS Award 2014 - Call for nominations. Bull. EATCS 111 (2013) - [j55]Andrei A. Bulatov, Martin E. Dyer, Leslie Ann Goldberg, Mark Jerrum, Colin McQuillan:
The expressibility of functions on the boolean domain, with applications to counting CSPs. J. ACM 60(5): 32:1-32:36 (2013) - [j54]Leslie Ann Goldberg, Mark Jerrum:
Approximating the Tutte polynomial of a binary matroid and other related combinatorial polynomials. J. Comput. Syst. Sci. 79(1): 68-78 (2013) - [j53]Leslie Ann Goldberg, Mark Jerrum:
A Polynomial-Time Algorithm for Estimating the Partition Function of the Ferromagnetic Ising Model on a Regular Matroid. SIAM J. Comput. 42(3): 1132-1157 (2013) - [j52]Leslie Ann Goldberg, Paul W. Goldberg, Piotr Krysta, Carmine Ventre:
Ranking games that have competitiveness-based strategies. Theor. Comput. Sci. 476: 24-37 (2013) - [c51]Xi Chen, Martin E. Dyer, Leslie Ann Goldberg, Mark Jerrum, Pinyan Lu, Colin McQuillan, David Richerby:
The complexity of approximating conservative counting CSPs. STACS 2013: 148-159 - [i42]Leslie Ann Goldberg, Paul W. Goldberg, Piotr Krysta, Carmine Ventre:
Ranking Games that have Competitiveness-based Strategies. CoRR abs/1301.5844 (2013) - [i41]Leslie Ann Goldberg, Mark Jerrum:
The Complexity of Approximately Counting Tree Homomorphisms. CoRR abs/1305.6306 (2013) - [i40]Andreas Göbel, Leslie Ann Goldberg, Colin McQuillan, David Richerby, Tomoyuki Yamakami:
Counting list matrix partitions of graphs. CoRR abs/1306.5176 (2013) - [i39]Andreas Göbel, Leslie Ann Goldberg, David Richerby:
The Complexity of Counting Homomorphisms to Cactus Graphs Modulo 2. CoRR abs/1307.0556 (2013) - [i38]Jin-Yi Cai, Leslie Ann Goldberg, Heng Guo, Mark Jerrum:
Approximating the Partition Function of Two-Spin Systems on Bipartite Graphs. CoRR abs/1311.4451 (2013) - [i37]Josep Díaz, Leslie Ann Goldberg, David Richerby, Maria J. Serna:
Absorption Time of the Moran Process. CoRR abs/1311.7631 (2013) - [i36]Peter Bürgisser, Leslie Ann Goldberg, Mark Jerrum, Pascal Koiran:
Computational Counting (Dagstuhl Seminar 13031). Dagstuhl Reports 3(1): 47-66 (2013) - 2012
- [j51]Leslie Ann Goldberg, Mark Jerrum:
Inapproximability of the Tutte polynomial of a planar graph. Comput. Complex. 21(4): 605-642 (2012) - [j50]Martin E. Dyer, Leslie Ann Goldberg, Markus Jalsenius, David Richerby:
The complexity of approximating bounded-degree Boolean #CSP. Inf. Comput. 220: 1-14 (2012) - [j49]Leslie Ann Goldberg, Mark Jerrum:
Approximating the partition function of the ferromagnetic potts model. J. ACM 59(5): 25:1-25:31 (2012) - [j48]Andrei A. Bulatov, Martin E. Dyer, Leslie Ann Goldberg, Markus Jalsenius, Mark Jerrum, David Richerby:
The complexity of weighted and unweighted #CSP. J. Comput. Syst. Sci. 78(2): 681-688 (2012) - [j47]Prasad Chebolu, Leslie Ann Goldberg, Russell Martin:
The complexity of approximately counting stable roommate assignments. J. Comput. Syst. Sci. 78(5): 1579-1605 (2012) - [j46]Prasad Chebolu, Leslie Ann Goldberg, Russell Martin:
The complexity of approximately counting stable matchings. Theor. Comput. Sci. 437: 35-68 (2012) - [c50]Leslie Ann Goldberg, Mark Jerrum:
The Complexity of Computing the Sign of the Tutte Polynomial (and Consequent #P-hardness of Approximation). ICALP (1) 2012: 399-410 - [c49]Josep Díaz, Leslie Ann Goldberg, George B. Mertzios, David Richerby, Maria J. Serna, Paul G. Spirakis:
Approximating fixation probabilities in the generalized Moran process. SODA 2012: 954-960 - [c48]Andrei A. Bulatov, Martin E. Dyer, Leslie Ann Goldberg, Mark Jerrum:
Log-supermodular functions, functional clones and counting CSPs. STACS 2012: 302-313 - [i35]Leslie Ann Goldberg, Mark Jerrum:
The Complexity of Computing the Sign of the Tutte Polynomial (and consequent #P-hardness of Approximation). CoRR abs/1202.0313 (2012) - [i34]Josep Díaz, Leslie Ann Goldberg, George B. Mertzios, David Richerby, Maria J. Serna, Paul G. Spirakis:
Can Fixation be Guaranteed in the Generalized Moran Process? CoRR abs/1202.0436 (2012) - [i33]Xi Chen, Martin E. Dyer, Leslie Ann Goldberg, Mark Jerrum, Pinyan Lu, Colin McQuillan, David Richerby:
The complexity of approximating conservative counting CSPs. CoRR abs/1208.1783 (2012) - [i32]Leslie Ann Goldberg, Mark Jerrum, Colin McQuillan:
Approximating the partition function of planar two-state spin systems. CoRR abs/1208.4987 (2012) - 2011
- [c47]Leslie Ann Goldberg, Mark Jerrum:
A Polynomial-Time Algorithm for Estimating the Partition Function of the Ferromagnetic Ising Model on a Regular Matroid. ICALP (1) 2011: 521-532 - [c46]Benjamin Doerr, Leslie Ann Goldberg, Lorenz Minder, Thomas Sauerwald, Christian Scheideler:
Stabilizing consensus with the power of two choices. SPAA 2011: 149-158 - [e4]Leslie Ann Goldberg, Klaus Jansen, R. Ravi, José D. P. Rolim:
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques - 14th International Workshop, APPROX 2011, and 15th International Workshop, RANDOM 2011, Princeton, NJ, USA, August 17-19, 2011. Proceedings. Lecture Notes in Computer Science 6845, Springer 2011, ISBN 978-3-642-22934-3 [contents] - [i31]Benjamin Doerr, Leslie Ann Goldberg:
Adaptive Drift Analysis. CoRR abs/1108.0295 (2011) - [i30]Andrei A. Bulatov, Martin E. Dyer, Leslie Ann Goldberg, Mark Jerrum:
Log-supermodular functions, functional clones and counting CSPs. CoRR abs/1108.5288 (2011) - [i29]Leslie Ann Goldberg, Mark Jerrum:
A Counterexample to rapid mixing of the Ge-Stefankovic Process. CoRR abs/1109.5242 (2011) - [i28]Josep Díaz, Leslie Ann Goldberg, George B. Mertzios, David Richerby, Maria J. Serna, Paul G. Spirakis:
Approximating Fixation Probabilities in the Generalized Moran Process. CoRR abs/1111.3321 (2011) - 2010
- [j45]Martin E. Dyer, Leslie Ann Goldberg, Mark Jerrum:
A Complexity Dichotomy For Hypergraph Partition Functions. Comput. Complex. 19(4): 605-633 (2010) - [j44]Martin E. Dyer, Leslie Ann Goldberg, Mark Jerrum:
An approximation trichotomy for Boolean #CSP. J. Comput. Syst. Sci. 76(3-4): 267-277 (2010) - [j43]Leslie Ann Goldberg, Mark Jerrum, Marek Karpinski:
The mixing time of Glauber dynamics for coloring regular trees. Random Struct. Algorithms 36(4): 464-476 (2010) - [j42]Leslie Ann Goldberg, Martin Grohe, Mark Jerrum, Marc Thurley:
A Complexity Dichotomy for Partition Functions with Mixed Signs. SIAM J. Comput. 39(7): 3336-3402 (2010) - [c45]Prasad Chebolu, Leslie Ann Goldberg, Russell A. Martin:
The Complexity of Approximately Counting Stable Matchings. APPROX-RANDOM 2010: 81-94 - [c44]Leslie Ann Goldberg, Mark Jerrum:
Approximating the Partition Function of the Ferromagnetic Potts Model. ICALP (1) 2010: 396-407 - [c43]Benjamin Doerr, Leslie Ann Goldberg:
Adaptive Drift Analysis. PPSN (1) 2010: 32-41 - [c42]Benjamin Doerr, Leslie Ann Goldberg:
Drift Analysis with Tail Bounds. PPSN (1) 2010: 174-183 - [c41]Leslie Ann Goldberg, Paul W. Goldberg, Piotr Krysta, Carmine Ventre:
Ranking games that have competitiveness-based strategies. EC 2010: 335-344 - [c40]Martin E. Dyer, Leslie Ann Goldberg, Markus Jalsenius, David Richerby:
The Complexity of Approximating Bounded-Degree Boolean #CSP. STACS 2010: 323-334 - [c39]Benjamin Doerr, Leslie Ann Goldberg, Lorenz Minder, Thomas Sauerwald, Christian Scheideler:
Brief Announcement: Stabilizing Consensus with the Power of Two Choices. DISC 2010: 528-530 - [e3]Peter Bürgisser, Leslie Ann Goldberg, Mark Jerrum:
Computational Counting, 28.11. - 03.12.2010. Dagstuhl Seminar Proceedings 10481, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Germany 2010 [contents] - [i27]Peter Bürgisser, Leslie Ann Goldberg, Mark Jerrum:
10481 Abstracts Collection - Computational Counting. Computational Counting 2010 - [i26]Peter Bürgisser, Leslie Ann Goldberg, Mark Jerrum:
10481 Executive Summary - Computational Counting. Computational Counting 2010 - [i25]Martin E. Dyer, Leslie Ann Goldberg, Markus Jalsenius, David Richerby:
The Complexity of Approximating Bounded-Degree Boolean #CSP (Extended Abstract). CoRR abs/1001.4987 (2010) - [i24]Leslie Ann Goldberg, Mark Jerrum:
Approximating the partition function of the ferromagnetic Potts model. CoRR abs/1002.0986 (2010) - [i23]Prasad Chebolu, Leslie Ann Goldberg, Russell A. Martin:
The Complexity of Approximately Counting Stable Matchings. CoRR abs/1004.1836 (2010) - [i22]Andrei A. Bulatov, Martin E. Dyer, Leslie Ann Goldberg, Markus Jalsenius, Mark Jerrum, David Richerby:
The complexity of weighted and unweighted #CSP. CoRR abs/1005.2678 (2010) - [i21]Leslie Ann Goldberg, Mark Jerrum:
Approximating the Tutte polynomial of a binary matroid and other related combinatorial polynomials. CoRR abs/1006.5234 (2010) - [i20]Leslie Ann Goldberg, Mark Jerrum:
A polynomial-time algorithm for estimating the partition function of the ferromagnetic Ising model on a regular matroid. CoRR abs/1010.6231 (2010) - [i19]Prasad Chebolu, Leslie Ann Goldberg, Russell A. Martin:
The Complexity of Approximately Counting Stable Roommate Assignments. CoRR abs/1012.1237 (2010)
2000 – 2009
- 2009
- [j41]Edith Elkind, Leslie Ann Goldberg, Paul W. Goldberg, Michael J. Wooldridge:
On the computational complexity of weighted voting games. Ann. Math. Artif. Intell. 56(2): 109-131 (2009) - [j40]Edith Elkind, Leslie Ann Goldberg, Paul W. Goldberg, Michael J. Wooldridge:
A Tractable and Expressive Class of Marginal Contribution Nets and Its Applications. Math. Log. Q. 55(4): 362-376 (2009) - [j39]Martin E. Dyer, Leslie Ann Goldberg, Mark Jerrum:
The Complexity of Weighted Boolean #CSP. SIAM J. Comput. 38(5): 1970-1986 (2009) - [j38]Andrei A. Bulatov, Martin E. Dyer, Leslie Ann Goldberg, Markus Jalsenius, David Richerby:
The complexity of weighted Boolean #CSP with mixed signs. Theor. Comput. Sci. 410(38-40): 3949-3961 (2009) - [c38]Leslie Ann Goldberg, Martin Grohe, Mark Jerrum, Marc Thurley:
A Complexity Dichotomy for Partition Functions with Mixed Signs. STACS 2009: 493-504 - [i18]Benjamin Doerr, Leslie Ann Goldberg, Lorenz Minder, Thomas Sauerwald, Christian Scheideler:
Stabilizing Consensus with the Power of Two Choices. Algorithmic Methods for Distributed Cooperative Systems 2009 - [i17]Leslie Ann Goldberg, Mark Jerrum:
Inapproximability of the Tutte polynomial of a planar graph. CoRR abs/0907.1724 (2009) - [i16]Martin E. Dyer, Leslie Ann Goldberg, Markus Jalsenius, David Richerby:
The Complexity of Approximating Bounded-Degree Boolean #CSP. CoRR abs/0907.2663 (2009) - 2008
- [j37]Martin E. Dyer, Leslie Ann Goldberg, Mark Jerrum:
Dobrushin Conditions and Systematic Scan. Comb. Probab. Comput. 17(6): 761-779 (2008) - [j36]Leslie Ann Goldberg, Mark Jerrum:
Inapproximability of the Tutte polynomial. Inf. Comput. 206(7): 908-929 (2008) - [c37]Edith Elkind, Leslie Ann Goldberg, Paul W. Goldberg, Michael J. Wooldridge:
On the Dimensionality of Voting Games. AAAI 2008: 69-74 - [c36]Edith Elkind, Leslie Ann Goldberg, Paul W. Goldberg, Michael J. Wooldridge:
A tractable and expressive class of marginal contribution nets and its applications. AAMAS (2) 2008: 1007-1014 - [e2]Luca Aceto, Ivan Damgård, Leslie Ann Goldberg, Magnús M. Halldórsson, Anna Ingólfsdóttir, Igor Walukiewicz:
Automata, Languages and Programming, 35th International Colloquium, ICALP 2008, Reykjavik, Iceland, July 7-11, 2008, Proceedings, Part I: Tack A: Algorithms, Automata, Complexity, and Games. Lecture Notes in Computer Science 5125, Springer 2008, ISBN 978-3-540-70574-1 [contents] - [e1]Luca Aceto, Ivan Damgård, Leslie Ann Goldberg, Magnús M. Halldórsson, Anna Ingólfsdóttir, Igor Walukiewicz:
Automata, Languages and Programming, 35th International Colloquium, ICALP 2008, Reykjavik, Iceland, July 7-11, 2008, Proceedings, Part II - Track B: Logic, Semantics, and Theory of Programming & Track C: Security and Cryptography Foundations. Lecture Notes in Computer Science 5126, Springer 2008, ISBN 978-3-540-70582-6 [contents] - [i15]Leslie Ann Goldberg, Martin Grohe, Mark Jerrum, Marc Thurley:
A complexity dichotomy for partition functions with mixed signs. CoRR abs/0804.1932 (2008) - [i14]Leslie Ann Goldberg, Mark Jerrum, Marek Karpinski:
The Mixing Time of Glauber Dynamics for Colouring Regular Trees. CoRR abs/0806.0921 (2008) - [i13]Martin E. Dyer, Leslie Ann Goldberg, Mark Jerrum:
A complexity dichotomy for hypergraph partition functions. CoRR abs/0811.0037 (2008) - [i12]Andrei A. Bulatov, Martin E. Dyer, Leslie Ann Goldberg, Markus Jalsenius, David Richerby:
The Complexity of Weighted Boolean #CSP with Mixed Signs. CoRR abs/0812.4171 (2008) - 2007
- [j35]Leslie Ann Goldberg, Mark Jerrum:
The Complexity of Ferromagnetic Ising with Local Fields. Comb. Probab. Comput. 16(1): 43-61 (2007) - [j34]Martin E. Dyer, Leslie Ann Goldberg, Mike Paterson:
On counting homomorphisms to directed acyclic graphs. J. ACM 54(6): 27 (2007) - [j33]Petra Berenbrink, Tom Friedetzky, Leslie Ann Goldberg, Paul W. Goldberg, Zengjian Hu, Russell A. Martin:
Distributed Selfish Load Balancing. SIAM J. Comput. 37(4): 1163-1181 (2007) - [c35]Edith Elkind, Leslie Ann Goldberg, Paul W. Goldberg, Michael J. Wooldridge:
Computational Complexity of Weighted Threshold Games. AAAI 2007: 718-723 - [c34]Edith Elkind, Leslie Ann Goldberg, Paul W. Goldberg:
Computing good nash equilibria in graphical games. EC 2007: 162-171 - [c33]Edith Elkind, Leslie Ann Goldberg, Paul W. Goldberg:
Frugality ratios and improved truthful mechanisms for vertex cover. EC 2007: 336-345 - [c32]Leslie Ann Goldberg, Mark Jerrum:
Inapproximability of the Tutte polynomial. STOC 2007: 459-468 - [i11]Martin E. Dyer, Leslie Ann Goldberg, Mark Jerrum:
The Complexity of Weighted Boolean #CSP. CoRR abs/0704.3683 (2007) - [i10]Martin E. Dyer, Leslie Ann Goldberg, Mark Jerrum:
An approximation trichotomy for Boolean #CSP. CoRR abs/0710.4272 (2007) - [i9]Edith Elkind, Leslie Ann Goldberg, Paul W. Goldberg:
Computing Good Nash Equilibria in Graphical Games. CoRR abs/cs/0703133 (2007) - [i8]Martin E. Dyer, Leslie Ann Goldberg, Mark Jerrum:
Matrix norms and rapid mixing for spin systems. CoRR abs/math/0702744 (2007) - 2006
- [j32]Petra Berenbrink, Leslie Ann Goldberg, Paul W. Goldberg, Russell A. Martin:
Utilitarian resource assignment. J. Discrete Algorithms 4(4): 567-587 (2006) - [j31]Leslie Ann Goldberg, Markus Jalsenius, Russell Martin, Mike Paterson:
Improved Mixing Bounds for the Anti-Ferromagnetic Potts Model on Z2. LMS J. Comput. Math. 9: 1-20 (2006) - [j30]Mary Cryan, Martin E. Dyer, Leslie Ann Goldberg, Mark Jerrum, Russell A. Martin:
Rapidly Mixing Markov Chains for Sampling Contingency Tables with a Constant Number of Rows. SIAM J. Comput. 36(1): 247-278 (2006) - [c31]Martin E. Dyer, Leslie Ann Goldberg, Mark Jerrum:
Dobrushin Conditions and Systematic Scan. APPROX-RANDOM 2006: 327-338 - [c30]Martin E. Dyer, Leslie Ann Goldberg, Mike Paterson:
On Counting Homomorphisms to Directed Acyclic Graphs. ICALP (1) 2006: 38-49 - [c29]Edith Elkind, Leslie Ann Goldberg, Paul W. Goldberg:
Nash equilibria in graphical games on trees revisited. EC 2006: 100-109 - [c28]Petra Berenbrink, Tom Friedetzky, Leslie Ann Goldberg, Paul W. Goldberg, Zengjian Hu, Russell A. Martin:
Distributed selfish load balancing. SODA 2006: 354-363 - [i7]Leslie Ann Goldberg, Mark Jerrum:
Inapproximability of the Tutte polynomial. CoRR abs/cs/0605140 (2006) - [i6]Edith Elkind, Leslie Ann Goldberg, Paul W. Goldberg:
Frugality ratios and improved truthful mechanisms for vertex cover. CoRR abs/cs/0606044 (2006) - [i5]Edith Elkind, Leslie Ann Goldberg, Paul W. Goldberg:
Nash Equilibria in Graphical Games on Trees Revisited. Electron. Colloquium Comput. Complex. TR06 (2006) - 2005
- [j29]Leslie Ann Goldberg, Russell A. Martin, Mike Paterson:
Strong Spatial Mixing with Fewer Colors for Lattice Graphs. SIAM J. Comput. 35(2): 486-517 (2005) - [i4]Petra Berenbrink, Tom Friedetzky, Leslie Ann Goldberg, Paul W. Goldberg, Zengjian Hu, Russell A. Martin:
Distributed Selfish Load Balancing. CoRR abs/cs/0506098 (2005) - [i3]Martin E. Dyer, Leslie Ann Goldberg, Mark Jerrum:
Dobrushin conditions and Systematic Scan. Electron. Colloquium Comput. Complex. TR05 (2005) - [i2]Martin E. Dyer, Leslie Ann Goldberg, Mike Paterson:
On counting homomorphisms to directed acyclic graphs. Electron. Colloquium Comput. Complex. TR05 (2005) - 2004
- [j28]Martin E. Dyer, Leslie Ann Goldberg, Catherine S. Greenhill, Mark Jerrum:
The Relative Complexity of Approximate Counting Problems. Algorithmica 38(3): 471-500 (2004) - [j27]Martin E. Dyer, Leslie Ann Goldberg, Mark Jerrum:
Counting and sampling H-colourings? Inf. Comput. 189(1): 1-16 (2004) - [j26]Leslie Ann Goldberg, Russell A. Martin, Mike Paterson:
Random sampling of 3-colorings in Z2. Random Struct. Algorithms 24(3): 279-302 (2004) - [j25]Leslie Ann Goldberg, Mark Jerrum, Sampath Kannan, Mike Paterson:
A bound on the capacity of backoff and acknowledgment-based protocols. SIAM J. Comput. 33(2): 313-331 (2004) - [j24]Leslie Ann Goldberg, Steven Kelk, Mike Paterson:
The Complexity of Choosing an H-Coloring (Nearly) Uniformly at Random. SIAM J. Comput. 33(2): 416-432 (2004) - [c27]Leslie Ann Goldberg, Russell A. Martin, Mike Paterson:
trong Spatial Mixing for Lattice Graphs with Fewer Colours. FOCS 2004: 562-571 - [i1]Petra Berenbrink, Leslie Ann Goldberg, Paul W. Goldberg, Russell A. Martin:
Utilitarian resource assignment. CoRR cs.GT/0410018 (2004) - 2003
- [j23]Leslie Ann Goldberg, Mark Jerrum, Mike Paterson:
The computational complexity of two-state spin systems. Random Struct. Algorithms 23(2): 133-154 (2003) - [j22]Petra Berenbrink, Tom Friedetzky, Leslie Ann Goldberg:
The Natural Work-Stealing Algorithm is Stable. SIAM J. Comput. 32(5): 1260-1279 (2003) - [c26]Micah Adler, Petra Berenbrink, Tom Friedetzky, Leslie Ann Goldberg, Paul W. Goldberg, Mike Paterson:
A proportionate fair scheduling rule with good worst-case performance. SPAA 2003: 101-108 - 2002
- [j21]Leslie Ann Goldberg, Mark Jerrum:
The "Burnside Process" Converges Slowly. Comb. Probab. Comput. 11(1): 21-34 (2002) - [j20]Martin E. Dyer, Leslie Ann Goldberg, Catherine S. Greenhill, Gabriel Istrate, Mark Jerrum:
Convergence Of The Iterated Prisoner's Dilemma Game. Comb. Probab. Comput. 11(2): 135-147 (2002) - [c25]Mary Cryan, Martin E. Dyer, Leslie Ann Goldberg, Mark Jerrum, Russell A. Martin:
Rapidly Mixing Markov Chains for Sampling Contingency Tables with a Constant Number of Rows. FOCS 2002: 711-720 - [c24]Martin E. Dyer, Leslie Ann Goldberg, Mark Jerrum:
Counting and Sampling H-Colourings. RANDOM 2002: 51-67 - [c23]Leslie Ann Goldberg, Steven Kelk, Mike Paterson:
The complexity of choosing an H-colouring (nearly) uniformly at random. STOC 2002: 53-62 - 2001
- [j19]Leslie Ann Goldberg, Paul W. Goldberg, Mike Paterson, Pavel A. Pevzner, Süleyman Cenk Sahinalp, Elizabeth Sweedyk:
The Complexity of Gene Placement. J. Algorithms 41(2): 225-243 (2001) - [j18]Hesham Al-Ammal, Leslie Ann Goldberg, Philip D. MacKenzie:
An Improved Stability Bound for Binary Exponential Backoff. Theory Comput. Syst. 34(3): 229-244 (2001) - [j17]Mary Cryan, Leslie Ann Goldberg, Paul W. Goldberg:
Evolutionary Trees Can be Learned in Polynomial Time in the Two-State General Markov Model. SIAM J. Comput. 31(2): 375-397 (2001) - [j16]Leslie Ann Goldberg, Mike Paterson, Aravind Srinivasan, Elizabeth Sweedyk:
Better Approximation Guarantees for Job-Shop Scheduling. SIAM J. Discret. Math. 14(1): 67-92 (2001) - [c22]Petra Berenbrink, Tom Friedetzky, Leslie Ann Goldberg:
The Natural Work-Stealing Algorithm is Stable. FOCS 2001: 178-187 - 2000
- [j15]Leslie Ann Goldberg, Philip D. MacKenzie, Mike Paterson, Aravind Srinivasan:
Contention resolution with constant expected delay. J. ACM 47(6): 1048-1096 (2000) - [j14]Leslie Ann Goldberg, Mark Jerrum:
Counting Unlabelled Subtrees of a Tree is #P-complete. LMS J. Comput. Math. 3: 117-124 (2000) - [j13]Martin E. Dyer, Leslie Ann Goldberg, Catherine S. Greenhill, Mark Jerrum, Michael Mitzenmacher:
An Extension of Path Coupling and Its Application to the Glauber Dynamics for Graph Colorings. SIAM J. Comput. 30(6): 1962-1975 (2000) - [c21]Martin E. Dyer, Leslie Ann Goldberg, Catherine S. Greenhill, Mark Jerrum:
On the relative complexity of approximate counting problems. APPROX 2000: 108-119 - [c20]Leslie Ann Goldberg, Mark Jerrum, Sampath Kannan, Mike Paterson:
A Bound on the Capacity of Backoff and Acknowledgement-Based Protocols. ICALP 2000: 705-716 - [c19]Micah Adler, Faith E. Fich, Leslie Ann Goldberg, Mike Paterson:
Tight Size Bounds for Packet Headers in Narrow Meshes. ICALP 2000: 756-767 - [c18]Martin E. Dyer, Leslie Ann Goldberg, Catherine S. Greenhill, Mark Jerrum, Michael Mitzenmacher:
An extension of path coupling and its application to the Glauber dynamics for graph colourings (extended abstract). SODA 2000: 616-624 - [c17]Hesham Al-Ammal, Leslie Ann Goldberg, Philip D. MacKenzie:
Binary Exponential Backoff Is Stable for High Arrival Rates. STACS 2000: 169-180
1990 – 1999
- 1999
- [j12]Mary Cryan, Leslie Ann Goldberg, Cynthia A. Phillips:
Approximation Algorithms for the Fixed-Topology Phylogenetic Number Problem. Algorithmica 25(2-3): 311-329 (1999) - [j11]Leslie Ann Goldberg, Philip D. MacKenzie:
Analysis of Practical Backoff Protocols for Contention Resolution with Multiple Servers. J. Comput. Syst. Sci. 58(1): 232-258 (1999) - [j10]Leslie Ann Goldberg, Yossi Matias, Satish Rao:
An Optical Simulation of Shared Memory. SIAM J. Comput. 28(5): 1829-1847 (1999) - [j9]Leslie Ann Goldberg, Mark Jerrum:
Randomly Sampling Molecules. SIAM J. Comput. 29(3): 834-853 (1999) - [c16]Leslie Ann Goldberg, Paul W. Goldberg, Mike Paterson, Pavel A. Pevzner, Süleyman Cenk Sahinalp, Elizabeth Sweedyk:
The Complexity of Gene Placement. SODA 1999: 386-395 - 1998
- [j8]Leslie Ann Goldberg, Paul W. Goldberg, Cynthia A. Phillips, Gregory B. Sorkin:
Constructing Computer Virus Phylogenies. J. Algorithms 26(1): 188-208 (1998) - [j7]Leslie Ann Goldberg, Mark Jerrum, Philip D. MacKenzie:
An Omega(sqrt{log log n}) Lower Bound for Routing in Optical Networks. SIAM J. Comput. 27(4): 1083-1098 (1998) - [c15]Mary Cryan, Leslie Ann Goldberg, Paul W. Goldberg:
Evolutionary Trees can be Learned in Polynomial Time in the Two-State General Markov Model. FOCS 1998: 436-445 - [c14]Leslie Ann Goldberg, Mark Jerrum:
The "Burnside Process" Converges Slowly. RANDOM 1998: 331-345 - 1997
- [j6]Leslie Ann Goldberg, Mark Jerrum, Frank Thomson Leighton, Satish Rao:
Doubly Logarithmic Communication Algorithms for Optical-Communication Parallel Computers. SIAM J. Comput. 26(4): 1100-1119 (1997) - [c13]Mary Cryan, Leslie Ann Goldberg, Cynthia A. Phillips:
Approximation Algorithms for the Fixed-Topology Phylogenetic Number Problem. CPM 1997: 130-149 - [c12]Leslie Ann Goldberg, Philip D. MacKenzie:
Contention Resolution with Guaranteed Constant Expected Delay. FOCS 1997: 213-222 - [c11]Leslie Ann Goldberg, Mark Jerrum:
Randomly Sampling Molecules. SODA 1997: 183-192 - [c10]Leslie Ann Goldberg, Mike Paterson, Aravind Srinivasan, Elizabeth Sweedyk:
Better Approximation Guarantees for Job-shop Scheduling. SODA 1997: 599-608 - 1996
- [j5]Leslie Ann Goldberg, Paul W. Goldberg, Cynthia A. Phillips, Elizabeth Sweedyk, Tandy J. Warnow:
Minimizing Phylogenetic Number To Find Good Evolutionary Trees. Discret. Appl. Math. 71(1-3): 111-136 (1996) - [c9]Leslie Ann Goldberg:
Analysis of a Simple Learning Algorithm: Learning Foraging Thresholds for Lizards. COLT 1996: 2-9 - [c8]Leslie Ann Goldberg, Paul W. Goldberg, Cynthia A. Phillips, Gregory B. Sorkin:
Constructing Computer Virus Phylogenies. CPM 1996: 253-270 - [c7]Leslie Ann Goldberg, Philip D. MacKenzie:
Analysis of Practical Backoff Protocols for Contention Resolution with Multiple Servers. SODA 1996: 554-563 - 1995
- [c6]Leslie Ann Goldberg, Paul W. Goldberg, Cynthia A. Phillips, Elizabeth Sweedyk, Tandy J. Warnow:
Minimizing Phylogenetic Number to find Good Evolutionary Trees. CPM 1995: 102-127 - 1994
- [j4]Leslie Ann Goldberg:
Listing Graphs That Satisfy First-Order Sentences. J. Comput. Syst. Sci. 49(2): 408-424 (1994) - [c5]Leslie Ann Goldberg:
Routing in Optical networks: The problem of contention. Interconnection Networks and Mapping and Scheduling Parallel Computations 1994: 173-180 - [c4]Leslie Ann Goldberg, Mark Jerrum, Philip D. MacKenzie:
An W(log log n) Lower Bound for Routing in Optical Networks. SPAA 1994: 147-156 - [c3]Leslie Ann Goldberg, Yossi Matias, Satish Rao:
An Optical Simulation of Shared Memory. SPAA 1994: 257-267 - 1993
- [j3]Leslie Ann Goldberg:
Automating Pólya Theory: The Computational Complexity of the Cycle Index Polynomial. Inf. Comput. 105(2): 268-288 (1993) - [c2]Leslie Ann Goldberg, Mark Jerrum, Frank Thomson Leighton, Satish Rao:
A Doubly Logarithmic Communication Algorithm for the Completely Connected Optical Communication Parallel Computer. SPAA 1993: 300-309 - [c1]Leslie Ann Goldberg:
Polynomial space polynomial delay algorithms for listing families of graphs. STOC 1993: 218-225 - 1992
- [j2]Leslie Ann Goldberg:
Efficient Algorithms for Listing Unlabeled Graphs. J. Algorithms 13(1): 128-143 (1992) - 1991
- [b1]Leslie Ann Goldberg:
Efficient algorithms for listing combinatorial structures. University of Edinburgh, UK, 1991 - 1990
- [j1]Leslie A. Henderson, Robert E. Hiromoto, Olaf M. Lubeck, Margaret L. Simmons:
On the use of diagnostic dependence-analysis tools in parallel programming: Experiences using PTOOL. J. Supercomput. 4(1): 83-96 (1990)
Coauthor Index
[j104] [j102] [c88] [i88] [j101] [j100] [j99] [c82] [c81] [i84] [i82] [j98] [j97] [j96] [j92] [j91] [c79] [i79] [i78] [i77] [j88] [j87] [j85] [c76] [c75] [c74] [i76] [i75] [j82] [c73] [c72] [i72] [i70] [c69] [c67] [i68] [i66] [i64] [j76] [j74] [c66] [c65] [i59] [i58] [j72] [j71] [j68] [c63] [c62] [c61] [c60] [i54] [i52] [c58] [i50] [i49] [i47] [i46] [c55]
[j85] [j79] [i63] [j75] [j74] [i59] [i57] [j71] [j68] [j67] [c62] [i56] [i55] [j65] [j64] [j63] [c58] [i50] [i48] [j60] [j59] [c55] [j55] [j54] [j53] [c51] [i41] [i38] [i36] [j51] [j49] [j48] [c50] [c48] [i35] [i33] [i32] [c47] [i30] [i29] [j45] [j44] [j43] [j42] [c44] [e3] [i27] [i26] [i24] [i22] [i21] [i20] [j39] [c38] [i17] [j37] [j36] [i15] [i14] [i13] [j35] [c32] [i11] [i10] [i8] [j30] [c31] [i7] [i3] [j28] [j27] [j25] [j23] [j21] [j20] [c25] [c24] [j14] [j13] [c21] [c20] [c18] [j9] [j7] [c14] [j6] [c11] [c4] [c2]
Russell Martin
aka: Russell A. Martin
aka: Russell A. Martin
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-11-07 21:29 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
