World's Best Scientists 2026 revealed!
Leslie Ann Goldberg

Leslie Ann Goldberg

D-Index & Metrics

Computer Science

D-Index
44
Citations
6154
World Ranking
7701
National Ranking
463

Mathematics

D-Index
43
Citations
5872
World Ranking
1732
National Ranking
121

Research.com Recognitions

  • 2014 - Member of Academia Europaea

Overview

Leslie Ann Goldberg is affiliated with the University of Oxford in the United Kingdom. Their research spans computer science and mathematics, with a focus on computational theory and mathematics, statistics and probability, artificial intelligence, mathematical physics, and computer networks and communications.

The main topics of work include:

  • Markov Chains and Monte Carlo Methods
  • Stochastic processes and statistical mechanics
  • Advanced Graph Theory Research
  • Data Management and Algorithms
  • Complexity and Algorithms in Graphs
  • Limits and Structures in Graph Theory
  • Bayesian Methods and Mixture Models

Recent papers authored or coauthored cover various areas within theoretical computer science and statistical mechanics. These include:

  • "Increasing efficacy of contact-tracing applications by user referrals and stricter quarantining," 2021, published in PLoS ONE
  • "Fast Algorithms at Low Temperatures via Markov Chains," 2020, published in Random Structures and Algorithms
  • "Sampling in Uniqueness from the Potts and Random-Cluster Models on Random Regular Graphs," 2020, published in SIAM Journal on Discrete Mathematics
  • "Metastability of the Potts Ferromagnet on Random Regular Graphs," 2023, published in Communications in Mathematical Physics
  • "Fast Algorithms for General Spin Systems on Bipartite Expanders," 2021, published in ACM Transactions on Computation Theory

Leslie Ann Goldberg frequently collaborates with a core group of coauthors, including Andreas Galanis, Marc Roth, John Lapinskas, Daniel Štefankovič, and Andrés Herrera-Poyatos.

The scientist's work appears mainly in prominent publication venues such as:

  • arXiv (Cornell University)
  • SIAM Journal on Discrete Mathematics
  • ACM Transactions on Algorithms
  • Information and Computation
  • Theoretical Computer Science

An award received by Leslie Ann Goldberg is the membership of Academia Europaea awarded in 2014.

Best Publications

  • On the relative complexity of approximate counting problems

    Martin E. Dyer;Leslie Ann Goldberg;Catherine S. Greenhill;Mark Jerrum

  • Efficient Algorithms for Listing Combinatorial Structures

    Leslie Ann Goldberg

  • Distributed Selfish Load Balancing

    Petra Berenbrink;Tom Friedetzky;Leslie Ann Goldberg;Paul W. Goldberg

  • On the relative complexity of approximate counting problems

    Unknown

  • Adaptive Drift Analysis

    Benjamin Doerr;Leslie Ann Goldberg

  • Computational complexity of weighted threshold games

    Edith Elkind;Leslie Ann Goldberg;Paul Goldberg;Michael Wooldridge

  • Stabilizing consensus with the power of two choices

    Benjamin Doerr;Leslie Ann Goldberg;Lorenz Minder;Thomas Sauerwald

  • A Complexity Dichotomy for Partition Functions with Mixed Signs

    Leslie Ann Goldberg;Martin Grohe;Mark Jerrum;Marc Thurley

  • Inapproximability of the Tutte polynomial

    Leslie Ann Goldberg;Mark Jerrum

  • The natural work-stealing algorithm is stable

    P. Berenbrink;T. Friedetzky;L.A. Goldberg

  • The Complexity of Weighted Boolean CSP

    Martin Dyer;Leslie Ann Goldberg;Mark Jerrum

  • Better Approximation Guarantees for Job-Shop Scheduling

    Leslie Ann Goldberg;Mike Paterson;Aravind Srinivasan;Elizabeth Sweedyk

  • The Complexity of Ferromagnetic Ising with Local Fields

    Eslie Ann Goldberg;Mark Jerrum

  • Approximating the partition function of the ferromagnetic Potts model

    Leslie Ann Goldberg;Mark Jerrum

  • On counting homomorphisms to directed acyclic graphs

    Martin Dyer;Leslie Ann Goldberg;Mike Paterson

  • Testability and repair of hereditary hypergraph properties

    Tim Austin;Terence Tao

  • Evolutionary Trees Can be Learned in Polynomial Time in the Two-State General Markov Model

    Mary Cryan;Leslie Ann Goldberg;Paul W. Goldberg

  • The natural work-stealing algorithm is stable

    Unknown

  • Nash equilibria in graphical games on trees revisited

    Edith Elkind;Leslie Ann Goldberg;Paul Goldberg

  • Distributed selfish load balancing

    Petra Berenbrink;Tom Friedetzky;Leslie Ann Goldberg;Paul Goldberg

  • Contention resolution with constant expected delay

    Leslie Ann Goldberg;Philip D. Mackenzie;Mike Paterson;Aravind Srinivasan

  • Strong Spatial Mixing with Fewer Colors for Lattice Graphs

    Leslie Ann Goldberg;Russell Martin;Mike Paterson

  • Random sampling of 3-colorings in Z 2

    Leslie Ann Goldberg;Russell Martin;Mike Paterson

Frequent Co-Authors

Mark Jerrum
Mark Jerrum Queen Mary University of London
Martin Dyer
Martin Dyer University of Leeds
Mike Paterson
Mike Paterson University of Warwick
Edith Elkind
Edith Elkind University of Oxford
Eric Vigoda
Eric Vigoda University of California, Santa Barbara
Benjamin Doerr
Benjamin Doerr École Polytechnique
Michael Wooldridge
Michael Wooldridge University of Oxford
Cynthia A. Phillips
Cynthia A. Phillips Sandia National Laboratories
Christian Scheideler
Christian Scheideler University of Paderborn
Paul G. Spirakis
Paul G. Spirakis University of Liverpool

If you think any of the details on this page are incorrect, let us know.

Report an issue

We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below:

Related Online Degrees & Career Pathways

Pursuing a Mathematics degree in the USA opens doors to various related online degrees and career pathways. Many students look to expand their skill set with programs like an online MBA, which can complement a strong quantitative background. Finding the shortest MBA program online might be ideal for those who want to quickly boost their business acumen without taking a break from their careers.

For students interested in the intersection of numbers and consumer behavior, a master’s degree in marketing offers lucrative opportunities. The article on the masters degree in marketing outlines programs that are affordable while leading to high-paying roles, making it a practical option for math graduates.

Additionally, many professionals prefer accelerated programs to enter the workforce faster or advance their careers. Resources highlighting the cheapest 1 year online MBA programs provide valuable insight for those balancing time and cost considerations.

Transferring credits can also make earning an MBA more accessible. Some schools offer MBA programs that accept transfer credits, allowing students to leverage prior coursework and accelerate their degree completion.

Best Scientists Citing Leslie Ann Goldberg

Trending Scientists

Recently Published Articles