2007

Dyer, Martin, Goldberg, Leslie Ann and Paterson, Michael S. (2007) On counting homomorphisms to directed acyclic graphs. Journal of the ACM, Vol.54 (No.6). Article: 27. doi:10.1145/1314690.1314691 ISSN 0004-5411.

Goldberg, Leslie Ann and Jerrum, Mark (2007) The complexity of ferromagnetic ising with local fields. Combinatorics, Probability and Computing, Volume 16 (Number 1). pp. 43-61. doi:10.1017/S096354830600767X ISSN 0963-5483.

2006

Dyer, Martin, Goldberg, Leslie Ann and Jerrum, Mark (2006) Dobrushin conditions and systematic scan. In: 9th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems/10th International Workshop on Randomization and Computation, Barcelona, Spain, 28-30 Aug 2006. Published in: Lecture Notes in Computer Science, Volume 4110 pp. 327-338. ISBN 3-540-38044-2. ISSN 0302-9743.

Dyer, Martin, Goldberg, Leslie Ann and Paterson, Michael S. (2006) On counting homomorphisms to directed acyclic graphs. In: 33rd International Colloquium on Automata, Languages and Programming, Venice, Italy, 10-14 Jul 2006. Published in: Lecture Notes in Computer Science, Volume 4051 pp. 38-49. ISBN 3-540-35904-4. doi:10.1007/11786986_5 ISSN 0302-9743.

2004

Dyer, Martin, Goldberg, Leslie Ann, Greenhill, Catherine and Jerrum, Mark (2004) The relative complexity of approximate counting problems. Algorithmica, Volume 38 (Number 3). pp. 471-500. doi:10.1007/s00453-003-1073-y ISSN 0178-4617.

Dyer, Martin, Goldberg, Leslie Ann, Jerrum, Mark and Martin, R. (2004) Markov chain comparison. University of Warwick. Department of Computer Science. (Department of Computer Science Research Report). (Unpublished)

Berenbrink, Petra, Goldberg, Leslie Ann, Goldberg, Paul W. and Martin, R. (Russell) (2004) Utilitarian resource assignment. University of Warwick. Department of Computer Science. (Department of Computer Science research report). (Unpublished)

Goldberg, Leslie Ann, Kelk, Steven and Paterson, Mike (2004) The complexity of choosing an H-coloring (nearly) uniformly at random. SIAM Journal on Computing, Volume 33 (Number 2). pp. 416-432. doi:10.1137/S0097539702408363 ISSN 0097-5397.

2003

Goldberg, Leslie Ann, Jerrum, Mark and Paterson, Michael S. (2003) The computational complexity of two-state spin systems. Random Structures & Algorithms, Volume 23 (Number 2). pp. 133-154. doi:10.1002/rsa.10090 ISSN 1042-9832.

Berenbrink, Petra, Friedetzky, Thomas and Goldberg, Leslie Ann (2003) The natural work-stealing algorithm is stable. SIAM Journal on Computing, Volume 32 (Number 5). pp. 1260-1279. doi:10.1137/S0097539701399551 ISSN 0097-5397.

2002

Dyer, Martin, Goldberg, Leslie Ann, Greenhill, Catherine, Istrate, Gabriel and Jerrum, Mark (2002) Convergence of the iterated prisoner's dilemma game. Combinatorics, Probability & Computing, Volume 11 (Number 2). pp. 135-147. doi:10.1017/S096354830100503X ISSN 0963-5483.

Adler, Micah, Fich, Faith, Goldberg, Leslie Ann and Paterson, Michael S. (2002) Tight size bounds for packet headers in narrow meshes. In: Montanari, U. and Rolim, J. D. P. and Welzl, E., (eds.) Automata, Languages and Programming. Lecture Notes in Computer Science, Volume 1853 . Springer Berlin Heidelberg, pp. 756-767. ISBN 9783540677154

Goldberg, Leslie Ann and Jerrum, Mark (2002) The 'Burnside process' converges slowly. Combinatorics, Probability & Computing, Volume 11 (Number 1). pp. 21-34. doi:10.1017/S096354830100493X ISSN 0963-5483.

2001

Goldberg, Leslie Ann, Jerrum, Mark and Paterson, Michael S. (2001) The computational complexity of two-state spin systems. University of Warwick. Department of Computer Science. (Department of Computer Science research report). (Unpublished)

Berenbrink, Petra, Friedetzky, Thomas and Goldberg, Leslie Ann (2001) The natural work-stealing algorithm is stable. University of Warwick. Department of Computer Science. (Department of Computer Science research report). (Unpublished)

Goldberg, Leslie Ann, Paterson, Michael S., Srinivasan, Aravind and Sweedyk, Elizabeth (2001) Better approximation guarantees for job-shop scheduling. SIAM Journal on Discrete Mathematics, Volume 14 (Number 1). pp. 67-92. doi:10.1137/S0895480199326104 ISSN 0895-4801.

Cryan, Mary, Goldberg, Leslie Ann and Goldberg, Paul W. (2001) Evolutionary trees can be learned in polynomial time in the two-state general Markov model. SIAM Journal on Computing, Volume 31 (Number 2). pp. 375-397. ISSN 0097-5397.

Berenbrink, Petra, Friedetzky, Thomas and Goldberg, Leslie Ann (2001) The natural work-stealing algorithm is stable. In: 42nd Annual Symposium on Foundations of Computer Science (FOCS 2001), Las Vegas, NV, 14-17 Oct 2001. Published in: 42nd IEEE Symposium on Foundations of Computer Science, 2001. Proceedings. pp. 178-187. ISBN 0769513913. ISSN 0272-5428.

2000

Goldberg, Leslie Ann, MacKenzie, Phil, Paterson, Michael S. and Srinivasan, Aravind (2000) Contention resolution with constant expected delay. Journal of the ACM, Volume 47 (Number 6). pp. 1048-1096. ISSN 0004-5411.

Dyer, Martin, Goldberg, Leslie Ann, Greenhill, Catherine, Istrate, Gabriel and Jerrum, Mark (2000) Convergence of the iterated prisoner's dilemma game. University of Warwick. Department of Computer Science. (Department of Computer Science research report). (Unpublished)

Dyer, Martin, Goldberg, Leslie Ann, Greenhill, Catherine and Jerrum, Mark (2000) On the relative complexity of approximate counting problems. University of Warwick. Department of Computer Science. (Department of Computer Science research report). (Unpublished)

Goldberg, Leslie Ann, Jerrum, Mark, Kannan, Sampath and Paterson, Michael S. (2000) A bound on the capacity of backoff and acknowledgement-based protocols. In: Montanari, U. and Rolim, J. D. P and Welzl, E, (eds.) Automata, Languages and Programming. Lecture Notes in Computer Science, Volume 1853 . Springer Berlin Heidelberg, pp. 705-716. ISBN 9783540677154

Goldberg, Leslie Ann, Jerrum, Mark, Kannan, Sampath and Paterson, Michael S. (2000) A bound on the capacity of backoff and acknowledgement-based protocols. University of Warwick. Department of Computer Science. (Department of Computer Science research report). (Unpublished)

Al-Ammal, Hesham, Goldberg, Leslie Ann and MacKenzie, Phil (2000) Binary exponential backoff is stable for high arrival rates. In: Reichel, H. and Tison, S., (eds.) STACS 2000. Lecture Notes in Computer Science, Volume 1770 . Springer Berlin Heidelberg, pp. 169-180. ISBN 9783540671411

Adler, Micah, Fitch, Faith, Goldberg, Leslie Ann and Paterson, Michael S. (2000) Tight size bounds for packet headers in narrow meshes. University of Warwick. Department of Computer Science. (Department of Computer Science research report). (Unpublished)

1999

Goldberg, Leslie Ann and Jerrum, Mark (1999) Counting unlabelled subtrees of a tree is #P-complete. University of Warwick. Department of Computer Science. (Department of Computer Science research report). (Unpublished)

Al-Ammal, Hesham, Goldberg, Leslie Ann and MacKenzie, Phil (1999) Binary exponential backoff is stable for high arrival rates. University of Warwick. Department of Computer Science. (Department of Computer Science research report). (Unpublished)

Cryan, Mary, Goldberg, Leslie Ann and Phillips, Cynthia A. (1999) Approximation algorithms for the fixed-topology phylogenetic number problem. Algorithmica, Volume 25 (Number 2-3). pp. 311-329. ISSN 0178-4617.

Goldberg, Leslie Ann (1999) Randomly sampling unlabelled structures. University of Warwick. Department of Computer Science. (Department of Computer Science research report). (Unpublished)

Goldberg, Leslie Ann, Hart, W. E. and Wilson, D. B. (1999) Learning foraging thresholds for lizards : an analysis of a simple learning algorithm. Journal of Theoretical Biology, Volume 197 (Number 3). pp. 361-369. doi:10.1006/jtbi.1998.0877 ISSN 0022-5193.

Goldberg, Leslie Ann and Jerrum, Mark (1999) Randomly sampling molecules. SIAM Journal on Computing, Volume 29 (Number 3). pp. 834-853. ISSN 0097-5397.

1998

Cryan, Mary, Goldberg, Leslie Ann and Goldberg, Paul W. (1998) Evolutionary trees can be learned in polynomial time in the two-state general Markov model. University of Warwick. Department of Computer Science. (Department of Computer Science research report). (Unpublished)

Goldberg, Leslie Ann and Jerrum, Mark (1998) The 'Burnside process' converges slowly. University of Warwick. Department of Computer Science. (Department of Computer Science research report). (Unpublished)

Goldberg, Leslie Ann, MacKenzie, Phil, Paterson, Michael S. and Srinavasan, Aravind (1998) Contention resolution with constant expected delay. University of Warwick. Department of Computer Science. (Department of Computer Science research report). (Unpublished)

Goldberg, Leslie Ann, Goldberg, Paul W., Phillips, Cynthia A. and Sorkin, Gregory B. (1998) Constructing computer virus phylogenies. Journal of Algorithms, Volume 26 (Number 1). pp. 188-208. ISSN 0196-6774.

Cryan, Mary, Goldberg, Leslie Ann and Goldberg, Paul W. (1998) Evolutionary trees can be learned in polynomial time in the two-state general Markov model. In: 39th Annual Symposium on Foundations of Computer Science, Palo Alto, CA, 08-11 Nov 1998. Published in: 39th Annual Symposium on Foundations of Computer Science, 1998. Proceedings. pp. 436-445. ISBN 0818691727. ISSN 0272-5428.

1997

Goldberg, Leslie Ann and MacKenzie, Phil (1997) Contention resolution with guaranteed constant expected delay. University of Warwick. Department of Computer Science. (Department of Computer Science research report). (Unpublished)

Cryan, Mary, Goldberg, Leslie Ann and Phillips, Cynthia A. (1997) Approximation algorithms for the fixed-topology phylogenetic number problem. University of Warwick. Department of Computer Science. (Department of Computer Science research report). (Unpublished)

Goldberg, Leslie Ann, Paterson, Michael S., Srinivasan, Aravind and Sweedyk, Elizabeth (1997) Better approximation guarantees for job-shop scheduling. In: 8th Annual ACM/SIAM Symposium on Discrete Algorithms, New Orleans, LA, 05-07 Jan 1997. Published in: SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms pp. 599-608. ISBN 0898713900.

Cryan, Mary, Goldberg, Leslie Ann and Phillips, Cynthia A. (1997) Approximation algorithms for the fixed-topology phylogenetic number problem. In: Apostolico, A. and Hein, J., (eds.) Combinatorial Pattern Matching. Lecture Notes in Computer Science, Volume 1264 . Springer Berlin Heidelberg, pp. 130-149. ISBN 9783540632207

Goldberg, Leslie Ann and MacKenzie, Phil (1997) Contention resolution with guaranteed constant expected delay. In: 38th Annual Symposium on Foundations of Computer Science, Miami Beach, FL, 20-22 Oct 1997. Published in: 38th Annual Symposium on Foundations of Computer Science, 1997. Proceedings. pp. 213-222. ISBN 0818681977. ISSN 0272-5428.

Goldberg, Leslie Ann and Jerrum, Mark (1997) Randomly sampling molecules. In: 8th Annual ACM/SIAM Symposium on Discrete Algorithms, New Orleans, LA, 05-07 Jan 1997. Published in: Proceeding SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms pp. 183-192. ISBN 0898713900.

1996

Goldberg, Leslie Ann, Paterson, Michael S., Srinavasan, Aravind and Sweedyk, Elizabeth (1996) Better approximation guarantees for job-shop scheduling. University of Warwick. Department of Computer Science. (Department of Computer Science research report). (Unpublished)

Goldberg, Leslie Ann and Jerrum, Mark (1996) Randomly sampling molecules. University of Warwick. Department of Computer Science. (Department of Computer Science research report). (Unpublished)

Goldberg, Leslie Ann, Goldberg, Paul W., Phillips, Cynthia A. and Sorking, Gregory B. (1996) Constructing computer virus phylogenies. University of Warwick. Department of Computer Science. (Department of Computer Science research report). (Unpublished)

Goldberg, Leslie Ann, Hart, W. E. and Wilson, D. B. (1996) Learning foraging thresholds for lizards. University of Warwick. Department of Computer Science. (Department of Computer Science research report). (Unpublished)