Leslie Ann Goldberg

Leslie Ann Goldberg is a professor of computer science at the University of Oxford and a Fellow of St Edmund Hall.[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 doctorate from the University of Edinburgh in 1992 under the joint supervision of Mark Jerrum and Alistair Sinclair after she was awarded the Marshall Scholarship.[3] Her dissertation, on algorithms for listing structures with polynomial delay, won the UK Distinguished Dissertations in Computer Science prize.[4] Prior to working at Oxford, her employers have included Sandia National Laboratories, the University of Warwick, and the University of Liverpool.[2]

Goldberg is an editor-in-chief of the Elsevier Journal of Discrete Algorithms,[5] and has served as program chair of the algorithms track of the International Colloquium on Automata, Languages and Programming in 2008.[6]

She is a member of the Academia Europaea.[2]

References
  1. People: Leslie Ann Goldberg, University of Oxford Department of Computer Science, retrieved 17 September 2015.
  2. Member profile: Leslie Ann Goldberg, Academia Europaea, retrieved 17 September 2015.
  3. Leslie Ann Goldberg at the Mathematics Genealogy Project.
  4. Goldberg, Leslie Ann (1993), Efficient Algorithms for Listing Combinatorial Structures, Distinguished Dissertations in Computer Science, 5, Cambridge University Press, p. vii, ISBN 9780521117883.
  5. Journal of Discrete Algorithms Editorial Board, Elsevier, retrieved 17 September 2015.
  6. ICALP 2008, retrieved 17 September 2015.
This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.