Google
Google Scholar
MS Academic
CiteSeerX
CORE
Semantic ScholarLeslie Ann Goldberg
Leslie A. Henderson
Person information
- affiliation: University of Oxford
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
showing all ?? records
2010 – today
- 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 Zivny:
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 - [i68]Leslie Ann Goldberg, John Lapinskas, David Richerby:
Phase Transitions of the Moran Process and Algorithmic Consequences. CoRR abs/1804.02293 (2018) - [i67]Andreas Galanis, Leslie Ann Goldberg, Kuan Yang:
Uniqueness for the 3-State Antiferromagnetic Potts Model on the Tree. CoRR abs/1804.03514 (2018) - [i66]Miriam Backens, Andrei Bulatov, Leslie Ann Goldberg, Colin McQuillan, Stanislav Zivny:
Boolean approximate counting CSPs with weak conservativity, and implications for ferromagnetic two-spin. CoRR abs/1804.04993 (2018) - [i65]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) - [i64]Jacob Focke, Leslie Ann Goldberg, Stanislav Zivny:
The Complexity of Approximately Counting Retractions. CoRR abs/1807.00590 (2018) - [i63]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) - [i62]Leslie Ann Goldberg, Mark Jerrum:
Approximating Pairwise Correlations in the Ising Model. CoRR abs/1810.05830 (2018) - 2017
- [j75]Leslie Ann Goldberg, Heng Guo:
The Complexity of Approximating complex-valued Ising and Tutte partition functions. Computational Complexity 26(4): 765-833 (2017) - [j74]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. Bulletin of the EATCS 121 (2017) - [j73]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) - [j72]Andrei Bulatov, Leslie Ann Goldberg, Mark Jerrum, David Richerby, Stanislav Zivny:
Functional clones and expressibility of partition functions. Theor. Comput. Sci. 687: 11-39 (2017) - [j71]Andreas Galanis, Leslie Ann Goldberg, Mark Jerrum:
A Complexity Trichotomy for Approximately Counting List H-Colorings. TOCT 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 Zivny:
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
- [j70]Martin E. Dyer, Leslie Ann Goldberg, David Richerby:
Counting 4×4 matrix partitions of graphs. Discrete Applied Mathematics 213: 76-92 (2016) - [j69]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) - [j68]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) - [j67]Leslie Ann Goldberg, Rob Gysel, John Lapinskas:
Approximately counting locally-optimal structures. J. Comput. Syst. Sci. 82(6): 1144-1160 (2016) - [j66]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) - [j65]Andreas Galanis, Leslie Ann Goldberg, Mark Jerrum:
Approximately Counting H-Colorings is $\#\mathrm{BIS}$-Hard. SIAM J. Comput. 45(3): 680-711 (2016) - [j64]Leslie Ann Goldberg, Mark Jerrum:
The complexity of counting locally maximal satisfying assignments of Boolean CSPs. Theor. Comput. Sci. 634: 35-46 (2016) - [j63]Andreas Göbel, Leslie Ann Goldberg, David Richerby:
Counting Homomorphisms to Square-Free Graphs, Modulo 2. TOCT 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 Zivny:
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
- [j62]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) - [j61]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) - [j60]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]
- [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]
- [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
- [j59]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) - [j58]Leslie Ann Goldberg, Mark Jerrum:
The Complexity of Computing the Sign of the Tutte Polynomial. SIAM J. Comput. 43(6): 1921-1952 (2014) - [j57]Leslie Ann Goldberg, Mark Jerrum:
The Complexity of Approximately Counting Tree Homomorphisms. TOCT 6(2): 8:1-8:31 (2014) - [j56]Andreas Göbel, Leslie Ann Goldberg, David Richerby:
The complexity of counting homomorphisms to cactus graphs modulo 2. TOCT 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. IEEE Conference on Computational Complexity 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
- [j55]
- [j54]
- [j53]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) - [j52]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) - [j51]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) - [j50]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
- [j49]Leslie Ann Goldberg, Mark Jerrum:
Inapproximability of the Tutte polynomial of a planar graph. Computational Complexity 21(4): 605-642 (2012) - [j48]Martin E. Dyer, Leslie Ann Goldberg, Markus Jalsenius, David Richerby:
The complexity of approximating bounded-degree Boolean #CSP. Inf. Comput. 220: 1-14 (2012) - [j47]Leslie Ann Goldberg, Mark Jerrum:
Approximating the partition function of the ferromagnetic potts model. J. ACM 59(5): 25:1-25:31 (2012) - [j46]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) - [j45]Prasad Chebolu, Leslie Ann Goldberg, Russell Martin:
The complexity of approximately counting stable roommate assignments. J. Comput. Syst. Sci. 78(5): 1579-1605 (2012) - [j44]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]
- [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
- [j43]Martin E. Dyer, Leslie Ann Goldberg, Mark Jerrum:
A Complexity Dichotomy For Hypergraph Partition Functions. Computational Complexity 19(4): 605-633 (2010) - [j42]Martin E. Dyer, Leslie Ann Goldberg, Mark Jerrum:
An approximation trichotomy for Boolean #CSP. J. Comput. Syst. Sci. 76(3-4): 267-277 (2010) - [j41]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) - [j40]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]
- [c42]
- [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
- [j39]Edith Elkind, Leslie Ann Goldberg, Paul W. Goldberg, Michael Wooldridge:
On the computational complexity of weighted voting games. Ann. Math. Artif. Intell. 56(2): 109-131 (2009) - [j38]Edith Elkind, Leslie Ann Goldberg, Paul W. Goldberg, Michael Wooldridge:
A Tractable and Expressive Class of Marginal Contribution Nets and Its Applications. Math. Log. Q. 55(4): 362-376 (2009) - [j37]Martin E. Dyer, Leslie Ann Goldberg, Mark Jerrum:
The Complexity of Weighted Boolean #CSP. SIAM J. Comput. 38(5): 1970-1986 (2009) - [j36]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
- [j35]Martin E. Dyer, Leslie Ann Goldberg, Mark Jerrum:
Dobrushin Conditions and Systematic Scan. Combinatorics, Probability & Computing 17(6): 761-779 (2008) - [j34]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 Wooldridge:
On the Dimensionality of Voting Games. AAAI 2008: 69-74 - [c36]Edith Elkind, Leslie Ann Goldberg, Paul W. Goldberg, Michael Wooldridge:
A tractable and expressive class of marginal contribution nets and its applications. AAMAS (2) 2008: 1007-1014 - [e2]