Articles with public access mandates - Leslie Ann GoldbergLearn more
Not available anywhere: 1
Evolutionary Dynamics on Graphs: Invited Talk
LA Goldberg
Proceedings of the 2015 ACM Conference on Foundations of Genetic Algorithms …, 2015
Mandates: US Department of Energy, UK Engineering and Physical Sciences Research …
Available somewhere: 54
Stabilizing consensus with the power of two choices
B Doerr, LA Goldberg, L Minder, T Sauerwald, C Scheideler
Proceedings of the twenty-third annual ACM symposium on Parallelism in …, 2011
Mandates: German Research Foundation
A Complexity Dichotomy for Partition Functions with Mixed Signs
LA Goldberg, M Grohe, M Jerrum, M Thurley
SIAM J Comput 39 (7), 3336-3402, 2010
Mandates: German Research Foundation
Approximating fixation probabilities in the generalized moran process
J Díaz, LA Goldberg, GB Mertzios, D Richerby, M Serna, PG Spirakis
Algorithmica 69, 78-91, 2014
Mandates: UK Engineering and Physical Sciences Research Council
The complexity of approximating complex-valued Ising and Tutte partition functions
LA Goldberg, H Guo
computational complexity 26, 765-833, 2017
Mandates: UK Engineering and Physical Sciences Research Council, European Commission
The expressibility of functions on the boolean domain, with applications to counting CSPs
AA Bulatov, M Dyer, LA Goldberg, M Jerrum, C McQuillan
Journal of the ACM (JACM) 60 (5), 1-36, 2013
Mandates: UK Engineering and Physical Sciences Research Council
Amplifiers for the Moran process
A Galanis, A Göbel, LA Goldberg, J Lapinskas, D Richerby
Journal of the ACM (JACM) 64 (1), 1-90, 2017
Mandates: European Commission
Inapproximability of the independent set polynomial in the complex plane
I Bezáková, A Galanis, LA Goldberg, D Štefankovič
Proceedings of the 50th annual ACM SIGACT symposium on theory of computing …, 2018
Mandates: US National Science Foundation, European Commission
# BIS-hardness for 2-spin systems on bipartite bounded degree graphs in the tree non-uniqueness region
JY Cai, A Galanis, LA Goldberg, H Guo, M Jerrum, D Štefankovič, ...
Journal of Computer and System Sciences 82 (5), 690-711, 2016
Mandates: US National Science Foundation, European Commission
Fast algorithms at low temperatures via Markov chains
Z Chen, A Galanis, LA Goldberg, W Perkins, J Stewart, E Vigoda
Random Structures & Algorithms 58 (2), 294-321, 2021
Mandates: US National Science Foundation, European Commission
Approximation via correlation decay when strong spatial mixing fails
I Bezáková, A Galanis, LA Goldberg, H Guo, D Stefankovic
SIAM Journal on Computing 48 (2), 279-349, 2019
Mandates: US National Science Foundation
Absorption time of the Moran process
J Díaz, LA Goldberg, D Richerby, M Serna
Random Structures & Algorithms 49 (1), 137-159, 2016
Mandates: European Commission
The complexity of computing the sign of the Tutte polynomial
LA Goldberg, M Jerrum
SIAM Journal on Computing 43 (6), 1921-1952, 2014
Mandates: UK Engineering and Physical Sciences Research Council, European Commission
The complexity of approximating conservative counting CSPs
X Chen, M Dyer, LA Goldberg, M Jerrum, P Lu, C McQuillan, D Richerby
Journal of Computer and System Sciences 81 (1), 311-329, 2015
Mandates: UK Engineering and Physical Sciences Research Council
Sampling in uniqueness from the Potts and random-cluster models on random regular graphs
A Blanca, A Galanis, LA Goldberg, D Stefankovic, E Vigoda, K Yang
SIAM Journal on Discrete Mathematics 34 (1), 742-793, 2020
Mandates: US National Science Foundation, European Commission
Approximately Counting -Colorings is -Hard
A Galanis, LA Goldberg, M Jerrum
SIAM Journal on Computing 45 (3), 680-711, 2016
Mandates: European Commission
Counting solutions to random CNF formulas
A Galanis, LA Goldberg, H Guo, K Yang
SIAM Journal on Computing 50 (6), 1701-1738, 2021
Mandates: European Commission
A complexity classification of spin systems with an external field
LA Goldberg, M Jerrum
Proceedings of the National Academy of Sciences 112 (43), 13161-13166, 2015
Mandates: UK Engineering and Physical Sciences Research Council, European Commission
Counting homomorphisms to square-free graphs, modulo 2
A Göbel, LA Goldberg, D Richerby
ACM Transactions on Computation Theory (TOCT) 8 (3), 1-29, 2016
Mandates: European Commission
The complexity of counting homomorphisms to cactus graphs modulo 2
A Göbel, LA Goldberg, D Richerby
ACM Transactions on Computation Theory (TOCT) 6 (4), 1-29, 2014
Mandates: UK Engineering and Physical Sciences Research Council, European Commission
Publication and funding information is determined automatically by a computer program