Leslie Ann Goldberg

Leslie Ann Goldberg
MAE
Born
Leslie Ann Goldberg
Alma materRice University (BS)
University of Edinburgh (PhD)
AwardsSuffrage Science award (2016)
Marshall Scholarship (1991)
Scientific career
Institutions
ThesisEfficient Algorithms for Listing Combinatorial Structures (1991)
Doctoral advisorMark Jerrum[1]
Websitewww.cs.ox.ac.uk/people/leslieann.goldberg/ Edit this at Wikidata

Leslie Ann Goldberg MAE is a professor of computer science at the University of Oxford and a Fellow of St Edmund Hall, Oxford.[2][3][4] Her research concerns the design and analysis of algorithms for random sampling and approximate combinatorial enumeration.[5][6]

Education

Goldberg did her undergraduate studies at Rice University[4] and completed her PhD at the University of Edinburgh in 1992[7] under the joint supervision of Mark Jerrum[1] and Alistair Sinclair[citation needed] after she was awarded the Marshall Scholarship.[citation needed] Her dissertation, on algorithms for listing structures with polynomial delay, won the Distinguished Dissertations in Computer Science prize.[7][8]

Career and research

Goldberg became the Head of Department for the Department of Computer Science, University of Oxford in October 2021.[9]

Prior to working at Oxford, her employers have included Sandia National Laboratories, the University of Warwick, and the University of Liverpool.[5][10][11][12]

Goldberg serves as editor-in-chief of the Journal of Discrete Algorithms,[13] and has served as program chair of the algorithms track of the International Colloquium on Automata, Languages and Programming (ICALP) in 2008.[14]

Awards and honours

She is a member of the Academia Europaea (MAE)[5] and was awarded the Suffrage Science award in 2016.[15]

References

  1. ^ a b Leslie Ann Goldberg at the Mathematics Genealogy Project Edit this at Wikidata
  2. ^ Leslie Ann Goldberg publications indexed by Google Scholar Edit this at Wikidata
  3. ^ Leslie Ann Goldberg at DBLP Bibliography Server Edit this at Wikidata
  4. ^ a b People: Leslie Ann Goldberg, University of Oxford Department of Computer Science, retrieved 17 September 2015.
  5. ^ a b c "Member profile: Leslie Ann Goldberg", ae-info.org, Academia Europaea, retrieved 17 September 2015.
  6. ^ "Professor Leslie Ann Goldberg | Royal Society". royalsociety.org.
  7. ^ a b Goldberg, Leslie Ann (1991). Efficient algorithms for listing combinatorial structures. ed.ac.uk (PhD thesis). University of Edinburgh. hdl:1842/10917. ISBN 9780521117883. OCLC 246835963. EThOS uk.bl.ethos.651566.
  8. ^ "Distinguished Dissertations in Computer Science". cambridge.org. Retrieved 20 November 2020.
  9. ^ "New head for the Department of Computer Science".
  10. ^ Dyer, Martin; Goldberg, Leslie Ann; Greenhill, Catherine; Jerrum, Mark (2003). "The Relative Complexity of Approximate Counting Problems" (PDF). Algorithmica. 38 (3): 471–500. doi:10.1007/s00453-003-1073-y. ISSN 0178-4617. S2CID 19343716.
  11. ^ Berenbrink, Petra; Friedetzky, Tom; Goldberg, Leslie Ann; Goldberg, Paul W.; Hu, Zengjian; Martin, Russell (2007). "Distributed Selfish Load Balancing" (PDF). SIAM Journal on Computing. 37 (4): 1163–1181. doi:10.1137/060660345. ISSN 0097-5397. S2CID 5430944.
  12. ^ Elkind, Edith; Goldberg, Leslie Ann; Goldberg, Paul W.; Wooldridge, Michael (2009). "On the computational complexity of weighted voting games". Annals of Mathematics and Artificial Intelligence. 56 (2): 109–131. doi:10.1007/s10472-009-9162-5. ISSN 1012-2443. S2CID 317706.
  13. ^ Journal of Discrete Algorithms Editorial Board, Elsevier, retrieved 17 September 2015.
  14. ^ ICALP 2008, retrieved 17 September 2015.
  15. ^ "Leslie Ann Goldberg wins Suffrage Science award". Department of Computer Science.