| Birth Name: | Leslie Ann Goldberg |
| Alma Mater: | Rice University (BS) University of Edinburgh (PhD) |
| Thesis Title: | Efficient Algorithms for Listing Combinatorial Structures |
| Thesis Url: | https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.651566 |
| Thesis Year: | 1991 |
| Doctoral Advisor: | Mark Jerrum |
| Awards: | Suffrage Science award (2016) Marshall Scholarship (1991) |
| Spouses: | )--> |
| Partners: | )--> |
Leslie Ann Goldberg is a professor of computer science at the University of Oxford and a Fellow of St Edmund Hall, Oxford.[1] Her research concerns the design and analysis of algorithms for random sampling and approximate combinatorial enumeration.[2]
Goldberg did her undergraduate studies at Rice University[1] and completed her PhD at the University of Edinburgh in 1992[3] under the joint supervision of Mark Jerrum and Alistair Sinclair after she was awarded the Marshall Scholarship. Her dissertation, on algorithms for listing structures with polynomial delay, won the Distinguished Dissertations in Computer Science prize.[3] [4]
Goldberg became the Head of Department for the Department of Computer Science, University of Oxford in October 2021.[5]
Prior to working at Oxford, her employers have included Sandia National Laboratories, the University of Warwick, and the University of Liverpool.[6] [7] [8]
Goldberg serves as editor-in-chief of the Journal of Discrete Algorithms,[9] and has served as program chair of the algorithms track of the International Colloquium on Automata, Languages and Programming (ICALP) in 2008.[10]
She is a member of the Academia Europaea (MAE)[11] and was awarded the Suffrage Science award in 2016.[12]