Leslie Ann Goldberg

Leslie Ann Goldberg

University of Oxford

H-index: 40

Europe-United Kingdom

About Leslie Ann Goldberg

Leslie Ann Goldberg, With an exceptional h-index of 40 and a recent h-index of 20 (since 2020), a distinguished researcher at University of Oxford, specializes in the field of complexity of counting, complexity of approximate counting, randomised algorithms, convergence rates of Markov chains.

His recent articles reflect a diverse array of research interests and contributions to the field:

Parameterised and fine-grained subgraph counting, modulo 2

Fast sampling via spectral independence beyond bounded-degree graphs

The Weisfeiler-Leman dimension of conjunctive queries

Sampling from the random cluster model on random regular graphs at all temperatures via Glauber dynamics

Counting Answers to Unions of Conjunctive Queries: Natural Tractability Criteria and Meta-Complexity

Parameterised Approximation of the Fixation Probability of the Dominant Mutation in the Multi-Type Moran Process

The Weisfeiler-Leman Dimension of Existential Conjunctive Queries

Instability of backoff protocols with arbitrary arrival rates

Leslie Ann Goldberg Information

University

Position

Professor of Computer Science

Citations(all)

4936

Citations(since 2020)

1563

Cited By

4201

hIndex(all)

40

hIndex(since 2020)

20

i10Index(all)

99

i10Index(since 2020)

58

Email

University Profile Page

University of Oxford

Google Scholar

View Google Scholar Profile

Leslie Ann Goldberg Skills & Research Interests

complexity of counting

complexity of approximate counting

randomised algorithms

convergence rates of Markov chains

Top articles of Leslie Ann Goldberg

Title

Journal

Author(s)

Publication Date

Parameterised and fine-grained subgraph counting, modulo 2

Algorithmica

Leslie Ann Goldberg

Marc Roth

2024/4

Fast sampling via spectral independence beyond bounded-degree graphs

ACM Transactions on Algorithms

Ivona Bezáková

Andreas Galanis

Leslie Ann Goldberg

Daniel Štefankovič

2024/1/22

The Weisfeiler-Leman dimension of conjunctive queries

Andreas Göbel

L Goldberg

Marc Roth

2024

Sampling from the random cluster model on random regular graphs at all temperatures via Glauber dynamics

arXiv preprint arXiv:2305.13239

Andreas Galanis

Leslie Ann Goldberg

Paulina Smolarova

2023/5/22

Counting Answers to Unions of Conjunctive Queries: Natural Tractability Criteria and Meta-Complexity

arXiv preprint arXiv:2311.10634

Jacob Focke

Leslie Ann Goldberg

Marc Roth

Stanislav Živný

2023/11/17

Parameterised Approximation of the Fixation Probability of the Dominant Mutation in the Multi-Type Moran Process

arXiv preprint arXiv:2303.08118

Leslie Ann Goldberg

Marc Roth

Tassilo Constantin Schwarz

2023/3/14

The Weisfeiler-Leman Dimension of Existential Conjunctive Queries

arXiv preprint arXiv:2310.19006

Andreas Göbel

Leslie Ann Goldberg

Marc Roth

2023/10/29

Instability of backoff protocols with arbitrary arrival rates

Leslie Ann Goldberg

John Lapinskas

2023

Two-State Spin Systems with Negative Interactions

arXiv preprint arXiv:2309.04735

Yumou Fei

Leslie Ann Goldberg

Pinyan Lu

2023/9/9

Graph Ranking and the Cost of Sybil Defense

Gwendolyn Farach-Colton

Martin Farach-Colton

Leslie Ann Goldberg

Hanna Komlos

John Lapinskas

...

2023/7/9

Metastability of the Potts ferromagnet on random regular graphs

Communications in Mathematical Physics

Amin Coja-Oghlan

Andreas Galanis

Leslie Ann Goldberg

Jean Bernoulli Ravelomanana

Daniel Štefankovič

...

2023/7

Approximately counting answers to conjunctive queries with disequalities and negations

Jacob Focke

Leslie Ann Goldberg

Marc Roth

Stanislav Zivný

2022/6/12

The complexity of approximating the complex-valued Potts model

computational complexity

Andreas Galanis

Leslie Ann Goldberg

Andrés Herrera-Poyatos

2022/6

Fast mixing via polymers for random graphs with unbounded degree

Information and Computation

Andreas Galanis

Leslie Ann Goldberg

James Stewart

2022/3/28

Some New (And Old) Results on Contention Resolution (Invited Talk)

Leslie Ann Goldberg

2022

Counting subgraphs in somewhere dense graphs

arXiv preprint arXiv:2209.03402

Marco Bressan

Leslie Ann Goldberg

Kitty Meeks

Marc Roth

2022/9/7

Fast sampling of satisfying assignments from random -SAT

arXiv preprint arXiv:2206.15308

Andreas Galanis

Leslie Ann Goldberg

Heng Guo

Andrés Herrera-Poyatos

2022/6/30

Approximating partition functions of bounded-degree Boolean counting Constraint Satisfaction Problems

Journal of computer and system sciences

Andreas Galanis

Leslie Ann Goldberg

Kuan Yang

2021/2/1

Fast algorithms for general spin systems on bipartite expanders

ACM Transactions on Computation Theory (TOCT)

Andreas Galanis

Leslie Ann Goldberg

James Stewart

2021/8/31

Approximately Counting Graph Homomorphisms and Retractions (Invited Talk)

Leslie Ann Goldberg

2021

See List of Professors in Leslie Ann Goldberg University(University of Oxford)