The Library
Browse by Warwick Author
 | Up a level |
Jump to: CITO | Engineering and Physical Sciences Research Council (EPSRC) | European Strategic Programme of Research and Development in Information Technology (ESPRIT) | Fifth Framework Programme (European Commission) (FP5) | Leverhulme Trust (LT) | National Science Foundation (U.S.) (NSF) | National University of Singapore | Natural Sciences and Engineering Research Council of Canada (NSERC) | Sixth Framework Programme (European Commission) (FP6) | United States. Department of Energy | United States. National Security Agency (USNSA) | University of Warwick
Number of items: 44.
CITO
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)
Engineering and Physical Sciences Research Council (EPSRC)
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)
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)
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. University of Warwick. Department of Computer Science. (Department of Computer Science research report). (Unpublished)
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)
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)
Goldberg, Leslie Ann (1999) Randomly sampling unlabelled structures. University of Warwick. Department of Computer Science. (Department of Computer Science research report). (Unpublished)
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, 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 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)
European Strategic Programme of Research and Development in Information Technology (ESPRIT)
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. University of Warwick. Department of Computer Science. (Department of Computer Science research report). (Unpublished)
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)
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)
Goldberg, Leslie Ann (1999) Randomly sampling unlabelled structures. University of Warwick. Department of Computer Science. (Department of Computer Science research report). (Unpublished)
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 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 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)
Fifth Framework Programme (European Commission) (FP5)
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)
Leverhulme Trust (LT)
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)
National Science Foundation (U.S.) (NSF)
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)
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)
National University of Singapore
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)
Natural Sciences and Engineering Research Council of Canada (NSERC)
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)
Sixth Framework Programme (European Commission) (FP6)
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)
United States. Department of Energy
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 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, 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)
United States. National Security Agency (USNSA)
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)
University of Warwick
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)
This list was generated on Sat Apr 1 11:16:48 2023 BST.
