Leslie Ann Goldberg
Scholar

Leslie Ann Goldberg

Google Scholar ID: rXpctjYAAAAJ
Professor of Computer Science, University of Oxford
complexity of countingcomplexity of approximate countingrandomised algorithmsconvergence rates of Markov chains
Homepage↗Google Scholar↗
Citations & Impact
All-time
Citations
1,789
 
H-index
23
 
i10-index
65
 
Publications
20
 
Co-authors
0
 
Contact
CVOpen ↗
Publications
2 items
The Instability of all Backoff Protocols
2026
Cited
0
Simulating Gaussian boson sampling on graphs in polynomial time
2025
Cited
0
Resume (English only)
Academic Achievements
  • Published multiple papers, such as the recent paper on contention resolution and a paper on sampling satisfying assignments of Boolean formulas.
Research Experience
  • Currently Head of Department of Computer Science (on sabbatical 2025-26) and Senior Research Fellow at St Edmund Hall, University of Oxford. Main research projects include: contention resolution protocols (collaborating with John Lapinskas), randomized algorithms for sampling and approximate counting (collaborating with Andreas Galanis, etc.).
Background
  • Research Interests: Foundational questions in Algorithms and Complexity Theory. Particularly interested in randomized algorithms, which use probabilistic methods to solve problems, applied in network communication, machine learning, etc.
Miscellany
  • Contact: leslie.goldberg@cs.ox.ac.uk, Phone: +44 1865 610755, Office: 253 Wolfson Building
Co-authors
0 total
Co-authors: 0 (list not available)