Leslie Ann Goldberg#
| Membership Number: | 3829 |
| Membership type: | ORDINARY |
| Section: | INFORMATICS |
| Elected: | 2014 |
| Main Country of Residence: | UNITED KINGDOM |
| Homepage(s): | http://www.cs.ox.ac.uk/people/leslieann.goldberg |
Present and Previous Positions
- 2013 - present Professor of Computer Science, University of Oxford
- 2013 - present Senior Research Fellow, St Edmund Hall (college of University of Oxford)
- 2006 - 2013 Professor of Computer Science, University of Liverpool
- 1995 - 2006 Lecturer, Senior Lecturer, Reader, University of Warwick
- 1992 - 1995 Research Fellow, Senior Member of Technical Staff, Sandia National Labs
Fields of Scholarship
- Algorithms for approximately counting and randomly sampling combinatorial structures
- Analysis of Markov-chain based sampling algorithms
- Complexity of counting
- Computational complexity
- Design and analysis of algorithms
- Stochastic processes in computer science
Honours and Awards
- ERC Advanced Grant “Mapping the Complexity of Counting”, ERC Advanced Grant 334828. 1 March 2014 – 28 February 2019
- Best Paper Prize 2012. 39th International Colloquium on Automata, Languages and Programming (ICALP 2012) Track A. Paper: "The Complexity of Computing the Sign of the Tutte Polynomial (and consequent #P-hardness of Approximation)" with Mark Jerrum.
- Best Paper Prize 2010. 37th International Colloquium on Automata, Languages and Programming (ICALP 2010) Track A. Paper: "Approximating the partition function of the ferromagnetic Potts model" with Mark Jerrum.
- Best Paper Prize 2006. 33rd International Colloquium on Automata, Languages and Programming (ICALP 2006) Track A. Paper: "On Counting Homomorphisms to Directed Acyclic Graphs" with Martin Dyer and Mike Paterson.
- 1991-1992 UK Distinguished Dissertations in Computer Science (one of three winners)
