Leslie Ann Goldberg
Leslie Ann Goldberg
Professor of Computer Science, University of Oxford
Dirección de correo verificada de - Página principal
Citado por
Citado por
The relative complexity of approximate counting problems
M Dyer, LA Goldberg, C Greenhill, M Jerrum
Algorithmica 38, 471-500, 2004
Efficient algorithms for listing combinatorial structures
LA Goldberg
KB thesis scanning project 2015, 1991
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
The natural work-stealing algorithm is stable
P Berenbrink, T Friedetzky, LA Goldberg
SIAM Journal on Computing 32 (5), 1260-1279, 2003
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
Computational complexity of weighted threshold games
E Elkind, LA Goldberg, P Goldberg, M Wooldridge
AAAI, 718-723, 2007
Adaptive drift analysis
B Doerr, LA Goldberg
Algorithmica 65, 224-250, 2013
Inapproximability of the Tutte polynomial
LA Goldberg, M Jerrum
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing …, 2007
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
Approximating the partition function of the ferromagnetic Potts model
LA Goldberg, M Jerrum
Journal of the ACM (JACM) 59 (5), 1-31, 2012
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
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
The complexity of ferromagnetic Ising with local fields
LA Goldberg, M Jerrum
Combinatorics, Probability and Computing 16 (1), 43-61, 2007
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
The Complexity of Weighted Boolean #CSP
M Dyer, LA Goldberg, M Jerrum
SIAM Journal on Computing 38 (5), 1970-1986, 2009
Nash equilibria in graphical games on trees revisited
E Elkind, LA Goldberg, P Goldberg
Proceedings of the 7th ACM Conference on Electronic Commerce, 100-109, 2006
On counting homomorphisms to directed acyclic graphs
M Dyer, LA Goldberg, M Paterson
Journal of the ACM (JACM) 54 (6), 27-es, 2007
Contention resolution with constant expected delay
LA Goldberg, PD Mackenzie, M Paterson, A Srinivasan
Journal of the ACM (JACM) 47 (6), 1048-1096, 2000
On the computational complexity of weighted voting games
E Elkind, LA Goldberg, PW Goldberg, M Wooldridge
Annals of Mathematics and Artificial Intelligence 56, 109-131, 2009
Markov chain comparison
M Dyer, LA Goldberg, M Jerrum, R Martin
El sistema no puede realizar la operación en estos momentos. Inténtalo de nuevo más tarde.
Artículos 1–20