Leslie Ann Goldberg
TitleCited byYear
The relative complexity of approximate counting problems
M Dyer, LA Goldberg, C Greenhill, M Jerrum
Algorithmica 38 (3), 471-500, 2004
176*2004
Efficient algorithms for listing combinatorial structures
LA Goldberg
Cambridge University Press, 2009
1532009
Distributed selfish load balancing
P Berenbrink, T Friedetzky, LA Goldberg, PW Goldberg, Z Hu, R Martin
SIAM Journal on Computing 37 (4), 1163-1181, 2007
1242007
Computational complexity of weighted threshold games
E Elkind, LA Goldberg, P Goldberg, M Wooldridge
Proceedings of the national conference on artificial intelligence 22 (1), 718, 2007
1102007
The natural work-stealing algorithm is stable
P Berenbrink, T Friedetzky, LA Goldberg
SIAM Journal on Computing 32 (5), 1260-1279, 2003
1072003
Doubly logarithmic communication algorithms for optical-communication parallel computers
LA Goldberg, M Jerrum, T Leighton, S Rao
SIAM Journal on Computing 26 (4), 1100-1119, 1997
100*1997
Inapproximability of the Tutte polynomial
LA Goldberg, M Jerrum
Information and Computation 206 (7), 908-929, 2008
972008
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
932010
The Complexity of Weighted Boolean #CSP
M Dyer, LA Goldberg, M Jerrum
SIAM Journal on Computing 38 (5), 1970-1986, 2009
872009
Adaptive drift analysis
B Doerr, LA Goldberg
Algorithmica 65 (1), 224-250, 2013
842013
On counting homomorphisms to directed acyclic graphs
M Dyer, LA Goldberg, M Paterson
Journal of the ACM (JACM) 54 (6), 27-es, 2007
832007
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
822011
Evolutionary trees can be learned in polynomial time in the two-state general Markov model
M Cryan, LA Goldberg, PW Goldberg
SIAM Journal on Computing 31 (2), 375-397, 2001
802001
Better approximation guarantees for job-shop scheduling
LA Goldberg, M Paterson, A Srinivasan, E Sweedyk
SIAM Journal on Discrete Mathematics 14 (1), 67-92, 2001
792001
The complexity of ferromagnetic Ising with local fields
LA Goldberg, M Jerrum
Combinatorics, Probability and Computing 16 (1), 43-61, 2007
742007
An optical simulation of shared memory
LA Goldberg, Y Matias, S Rao
SIAM Journal on Computing 28 (5), 1829-1847, 1999
671999
Approximating the partition function of the ferromagnetic Potts model
LA Goldberg, M Jerrum
Journal of the ACM (JACM) 59 (5), 1-31, 2012
642012
Contention resolution with constant expected delay
LA Goldberg, PD Mackenzie, M Paterson, A Srinivasan
Journal of the ACM (JACM) 47 (6), 1048-1096, 2000
642000
Analysis of practical backoff protocols for contention resolution with multiple servers
LA Goldberg, PD MacKenzie
Journal of Computer and System Sciences 58 (1), 232-258, 1999
641999
An approximation trichotomy for Boolean# CSP
M Dyer, LA Goldberg, M Jerrum
Journal of Computer and System Sciences 76 (3-4), 267-277, 2010
622010
The system can't perform the operation now. Try again later.
Articles 1–20