New Address: I am moving to Oxford University on 1 July 2013. I will not maintain this
web page after that, but you will be able to find my new web page and email address using google.
B. Doerr, L.A. Goldberg,
L. Minder, T. Sauerwald and C. Scheideler,
Brief Announcement: Stabilizing Consensus With the Power of Two Choices,
Distributed Computing, Lecture Notes in Computer Science Vol 6343
pages 528--530 (2010)
http://dx.doi.org/10.1007/978-3-642-15763-9_50
L.A. Goldberg and M. Jerrum,
Approximating the partition function of the ferromagnetic Potts model,
Proceedings of
ICALP 2010, 396-407.
(This paper won the "Best Paper Prize" for Track A:
Algorithms, Automata, Complexity and Games. See the journal version)
B. Doerr and L.A. Goldberg, Adaptive Drift Analysis,
Proceedings of
PPSN 2010, 32-41. (see the
journal version)
B. Doerr and L.A. Goldberg, Drift Analysis with Tail Bounds, Proceedings
of
PPSN 2010, 174-183. (This material is included in the journal
paper Adaptive Drift Analysis)
L.A. Goldberg, P.W. Goldberg, P. Krysta, and C. Ventre,
Ranking games that have competitiveness-based strategies,
Proceedings of
EC 2010, 335-344. (see the
journal version)
E. Elkind, L.A. Goldberg, P. Goldberg and M. Wooldridge,
A tractable and expressive class of marginal contribution nets
and its applications.
AAMAS 2008. (see the journal version)
L.A. Goldberg and M. Jerrum, Inapproximability of the
Tutte polynomial, Proceedings of the Thirty-Ninth Annual ACM
Symposium on theory of Computing (San Diego, California, USA, June
11 - 13, 2007). STOC '07. ACM Press, New York, NY, 459-468.
http://doi.acm.org/10.1145/1250790.1250858
(see the journal version)
P. Berenbrink, T. Friedetzky, L.A. Goldberg, P. Goldberg, Z. Hu and R.
Martin,
Distributed Selfish Load Balancing, Proceedings of SODA 2006.
(see the journal version)
M. Dyer, L.A. Goldberg, and M. Jerrum,
Dobrushin conditions and Systematic Scan, Proc. 10th
International Workshop on Randomization and
Computation (RANDOM), Lecture Notes in Computer Science 4110, Springer,
2006, pp. 327-338
(see the journal version)
M. Dyer, L.A. Goldberg, M. Jerrum and R. Martin,
Markov chain comparison, Probability Surveys 3 (2006) 89-111.
M. Dyer, L.A. Goldberg and M. Paterson,
On counting
homomorphisms to directed acyclic graphs,
Proceedings of 33rd ICALP 2006, pages
38-49.
(This paper won the "Best Paper Prize" for Track A:
Algorithms, Automata, Complexity and Games. The journal version is
here)
L.A. Goldberg, R. Martin and M. Paterson,
Strong
Spatial Mixing for Lattice Graphs with Fewer Colours,
Proceedings of FOCS 2004.
(see the journal version)
M. Cryan, M. Dyer, L.A. Goldberg, M. Jerrum and R. Martin, Rapidly
Mixing Markov Chains for Sampling Contingency Tables with a Constant Number of
Rows, Proceedings of FOCS 2002
(see the journal version)
M. Dyer, L.A. Goldberg, C. Greenhill, G. Istrate and M. Jerrum, Convergence
of the Iterated Prisoner's Dilemma game, Combinatorics, Probability and
Computing (11) 135-147, 2002, copyright Cambridge University Press.
M. Dyer, L.A. Goldberg, and M. Jerrum, Counting
and Sampling H-colourings, Proceedings of RANDOM 2002
(see the journal version)
L.A. Goldberg, S.Kelk and M.Paterson, The
complexity of choosing an H-colouring (nearly) uniformly at random,
Proceedings of STOC (2002) (see the journal
version)
H. Al-Ammal, L.A. Goldberg and P. MacKenzie,
Binary exponential backoff is stable for high arrival rates,
Proceedings of STACS 17, Lecture Notes in Computer Science 1770 (2000)
169-180
(see the journal version)
M. Dyer, L.A. Goldberg, C. Greenhill and M. Jerrum, On
the relative complexity of approximate counting problems, Proceedings of APPROX
2000 (see the journal version)
M. Dyer, L.A. Goldberg, C. Greenhill, M. Jerrum and M. Mitzenmacher, An
extension of path coupling and its application to the Glauber dynamics for
graph colourings, Proceedings of SODA 11 (2000) 616-624
(see the journal version)
L.A. Goldberg, M. Jerrum, S. Kannan and M. Paterson, A
bound on the capacity of backoff and acknowledgement-based protocols,
Proceedings of ICALP 27 Lecture Notes in Computer Science 1853
705-716 (2000)
(see the journal version)
L.A. Goldberg, P. W. Goldberg, M. Paterson, P. Pevzner,
S.C. Sahinalp and E. Sweedyk, The
Complexity of Gene Placement, Proceedings of SODA 10 (1999) 386-395
(see the journal version)
M. Cryan, L.A. Goldberg and P.W. Goldberg, Evolutionary
Trees can be Learned in Polynomial Time in the Two-State General Markov
Model, Proceedings of FOCS 39 (1998) 436-445
(see the journal version)
L.A. Goldberg and M. Jerrum, The
"Burnside Process" Converges Slowly,
Proceedings of RANDOM 2, Springer Lecture Notes in Computer Science 1518 (1998)
331-345
(see the journal version)
M. Cryan, L.A. Goldberg and C.A. Phillips,
Approximation Algorithms for the Fixed-Topology Phylogenetic Number
Problem, Proceedings of Combinatorial Pattern Matching (CPM) 8
(1997)
130-149.
(see the journal version)
L.A. Goldberg and M. Jerrum,
Randomly Sampling Molecules, Proceedings of SODA 8 (1997)
183-192
(see the journal version)
L.A. Goldberg and P.D. MacKenzie
Contention Resolution with Guaranteed Constant Expected Delay,
Proceedings of FOCS 38
(1997), 213-222.
(this material was included in the journal paper
Contention Resolution with Constant Expected
Delay with Paterson and Srinivasan)
L.A. Goldberg, M. Paterson, A. Srinivasan and E. Sweedyk,
Better Approximation Guarantees for Job-Shop Scheduling,
Proceedings of SODA
(1997) 599-608.
(see the journal version)
1996
L.A. Goldberg, P.W. Goldberg, C.A. Phillips and G.B. Sorkin,
Constructing Computer Virus Phylogenies,
Proceedings of Combinatorial Pattern Matching (CPM)
(1996)
253-270 (see the journal version )
L.A. Goldberg, W.E. Hart and D.B. Wilson,
Analysis of a Simple Learning Algorithm:
Learning Foraging Thresholds for Lizards,
Proceedings of Conference on Computational Learning Theory (COLT) 9
(1996)
2-9. (see the journal version) )
L.A. Goldberg and P.D. MacKenzie,
Analysis of Practical Backoff Protocols for Contention Resolution
with Multiple Servers, Proceedings of SODA 7
(1996)
554-563. (see the journal version)
L.A. Goldberg, P.W. Goldberg, C.A. Phillips, E. Sweedyk and T. Warnow,
Minimizing Phylogenetic Number to find Good Evolutionary Trees,
Proceedings of Combinatorial Pattern Matching (CPM) 6 (1995)
102-127.
(see the journal version in 1996)
L.A. Goldberg, M. Jerrum and P. MacKenzie,
An Omega(log log n) Lower Bound for
Routing in Optical Networks.
Proceedings of ACM Symposium on Parallel Algorithms and
Architectures (SPAA) 6
(1994)
147-146.
(see the journal version)
L.A. Goldberg, Y. Matias and S. Rao,
An Optical Simulation of Shared Memory,
Proceedings of ACM Symposium on Parallel Algorithms and
Architectures (SPAA) 6
(1994)
257-267.
(see the journal version)
1993
L.A. Goldberg, Automating Polya Theory: The Computational Complexity
of the Cycle Index Polynomial, Information and Computation 105(2) (1993)
268--288.
http://dx.doi.org/10.1006/inco.1993.1045
L.A. Goldberg, Efficient Algorithms for Listing Combinatorial
Structures, (Cambridge University Press, 1993).
http://ebooks.cambridge.org/ebook.jsf?bid=CBO9780511569913
(One of three winners of the UK Distinguished Dissertations in
Computer Science Prize.)
L.A. Goldberg,
Listing Graphs that Satisfy First Order Sentences,
Proceedings of STOC (1993)
218-225.
(see the journal version in 1994)
L.A. Goldberg, M. Jerrum, T. Leighton, and
S. Rao, Doubly Logarithmic Communication Algorithms for
Optical Communication Parallel Computers,
Proceedings of ACM Symposium on Parallel Algorithms and Architectures
(SPAA) 5 (1993)
300-309. (see the journal version)
L.A. Henderson, R.E. Hiromoto, O.M. Lubeck, and M.L. Simmons,
On the Use of Diagnostic Dependence-Analysis Tools in Parallel Programming:
Experiences Using PTOOL, The Journal of Supercomputing 4 (1990)
83--96.
http://dx.doi.org/10.1007/BF00162344
(This paper was written when I was an undergraduate student using my
original name, Leslie Ann Henderson)
