Leslie Ann Goldberg

Leslie Ann Goldberg's AcademicInfluence.com Rankings

Leslie Ann Goldberg

Computer Science

#2003

World Rank

#2082

Historical Rank

Algorithms

#172

World Rank

#175

Historical Rank

Machine Learning

#5107

World Rank

#5171

Historical Rank

computer-science Degrees

Leslie Ann Goldberg

Mathematics

#5969

World Rank

#8341

Historical Rank

Measure Theory

#3250

World Rank

#3843

Historical Rank

mathematics Degrees

Download Badge

Computer Science
Mathematics

Leslie Ann Goldberg's Degrees

Masters Mathematics University of Oxford
Bachelors Physics Stanford University

Why Is Leslie Ann Goldberg Influential?

(Suggest an Edit or Addition)

According to Wikipedia, Leslie Ann Goldberg is a professor of computer science at the University of Oxford and a Fellow of St Edmund Hall, Oxford. Her research concerns the design and analysis of algorithms for random sampling and approximate combinatorial enumeration.

(See a Problem?)

Leslie Ann Goldberg's Published Works

Number of citations in a given year to any of this author's works

Total number of citations to an author for the works they published in a given year. This highlights publication of the most important work(s) by the author

Published Works

On the relative complexity of approximate counting problems (2000) (135)
The Relative Complexity of Approximate Counting Problems (2000) (134)
Distributed selfish load balancing (2005) (124)
Efficient algorithms for listing combinatorial structures (1993) (111)
Adaptive Drift Analysis (2010) (109)
Computational Complexity of Weighted Threshold Games (2007) (108)
A Complexity Dichotomy for Partition Functions with Mixed Signs (2008) (106)
Stabilizing consensus with the power of two choices (2011) (97)
The natural work-stealing algorithm is stable (2001) (94)
Practicality of intermittent fasting in humans and its effect on oxidative stress and genes related to aging and metabolism. (2015) (89)
The Complexity of Weighted Boolean #CSP (2007) (88)
Inapproximability of the Tutte polynomial (2006) (88)
Approximating the partition function of the ferromagnetic Potts model (2010) (84)
Evolutionary trees can be learned in polynomial time in the two-state general Markov model (1998) (79)
On counting homomorphisms to directed acyclic graphs (2006) (77)
Better approximation guarantees for job-shop scheduling (1997) (73)
The Complexity of Ferromagnetic Ising with Local Fields (2006) (72)
On the computational complexity of weighted voting games (2009) (70)
The computational complexity of two‐state spin systems (2003) (68)
Contention resolution with constant expected delay (2000) (67)
Analysis of practical backoff protocols for contention resolution with multiple servers (1996) (64)
Nash equilibria in graphical games on trees revisited (2006) (64)
Markov chain comparison (2004) (63)
Constructing Computer Virus Phylogenies (1996) (62)
A doubly logarithmic communication algorithm for the completely connected optical communication parallel computer (1993) (62)
The Complexity of Approximating complex-valued Ising and Tutte partition functions (2014) (60)
A Tractable and Expressive Class of Marginal Contribution Nets and Its Applications (2008) (60)
An approximation trichotomy for Boolean #CSP (2007) (59)
Approximating Fixation Probabilities in the Generalized Moran Process (2011) (59)
An optical simulation of shared memory (1994) (57)
Strong Spatial Mixing with Fewer Colors for Lattice Graphs (2005) (56)
#BIS-hardness for 2-spin systems on bipartite bounded degree graphs in the tree non-uniqueness region (2013) (49)
Drift Analysis with Tail Bounds (2010) (46)
Rapidly mixing Markov chains for sampling contingency tables with a constant number of rows (2002) (46)
The complexity of weighted and unweighted #CSP (2010) (43)
An Extension of Path Coupling and Its Application to the Glauber Dynamics for Graph Colorings (2001) (41)
The expressibility of functions on the boolean domain, with applications to counting CSPs (2011) (40)
An Improved Stability Bound for Binary Exponential Backoff (2001) (40)
Dobrushin Conditions and Systematic Scan (2006) (39)
A bound on the capacity of backoff and acknowledgment-based protocols (2004) (39)
Doubly Logarithmic Communication Algorithms for Optical-Communication Parallel Computers (1997) (37)
Matrix norms and rapid mixing for spin systems (2007) (36)
Amplifiers for the Moran Process (2015) (35)
Approximation via Correlation Decay when Strong Spatial Mixing Fails (2015) (33)
Systematic scan for sampling colorings (2006) (33)
Efficient Algorithms for Listing Unlabeled Graphs (1992) (32)
On the fixation probability of superstars (2012) (32)
The Complexity of Weighted Boolean #CSP with Mixed Signs (2008) (31)
Minimizing Phylogenetic Number To Find Good Evolutionary Trees (1995) (31)
Strong spatial mixing for lattice graphs with fewer colours (2004) (30)
Inapproximability of the independent set polynomial in the complex plane (2017) (30)
Absorption time of the Moran process (2013) (29)
The Complexity of Computing the Sign of the Tutte Polynomial (2012) (29)
On the Dimensionality of Voting Games (2008) (29)
Fast algorithms at low temperatures via Markov chains † (2019) (26)
The complexity of approximating conservative counting CSPs (2012) (24)
Computing good nash equilibria in graphical games (2007) (24)
Frugality ratios and improved truthful mechanisms for vertex cover (2006) (24)
An Ω(√ log log n) lower bound for routing in optical networks (1994) (23)
Convergence of the Iterated Prisoner's Dilemma Game (2002) (23)
Random sampling of 3-colorings in Z 2 (2004) (23)
Counting and sampling H-colourings? (2004) (23)
A Bound on the Capacity of Backoff and Acknowledgement-Based Protocols (2000) (22)
Inapproximability of the Tutte polynomial of a planar graph (2009) (22)
Random sampling of 3‐colorings in ℤ2 (2004) (22)
A proportionate fair scheduling rule with good worst-case performance (2003) (21)
Utilitarian resource assignment (2004) (20)
The complexity of approximately counting stable matchings (2010) (20)
Improved mixing bounds for the anti-ferromagnetic Potts model on Z^2 (2005) (20)
Binary Exponential Backoff Is Stable for High Arrival Rates (2000) (20)
The complexity of approximating bounded-degree Boolean #CSP (2010) (20)
The complexity of counting homomorphisms to cactus graphs modulo 2 (2013) (18)
Sampling in Uniqueness from the Potts and Random-Cluster Models on Random Regular Graphs (2018) (18)
Asymptotically Optimal Amplifiers for the Moran Process (2016) (18)
COUNTING UNLABELLED SUBTREES OF A TREE IS #P-COMPLETE (2000) (18)
Counting solutions to random CNF formulas (2019) (17)
The Complexity of Choosing an H-Coloring (Nearly) Uniformly at Random (2004) (17)
Polynomial space polynomial delay algorithms for listing families of graphs (1993) (17)
The mixing time of Glauber dynamics for coloring regular trees (2008) (17)
Counting Homomorphisms to Square-Free Graphs, Modulo 2 (2015) (17)
Randomly sampling molecules (1997) (16)
A complexity classification of spin systems with an external field (2015) (15)
Approximately Counting H-Colorings is $\#\mathrm{BIS}$-Hard (2015) (15)
Inapproximability of the Independent Set Polynomial Below the Shearer Threshold (2016) (15)
Approximately Counting H-Colourings is #BIS-Hard (2015) (15)
Contention resolution with guaranteed constant expected delay (1997) (13)
A Complexity Dichotomy For Hypergraph Partition Functions (2008) (13)
The complexity of choosing an H-colouring (nearly) uniformly at random (2002) (13)
Automating Pólya Theory: The Computational Complexity of the Cycle Index Polynomial (1993) (13)
A Complexity Trichotomy for Approximately Counting List H-Colorings (2016) (12)
A Polynomial-Time Algorithm for Estimating the Partition Function of the Ferromagnetic Ising Model on a Regular Matroid (2010) (11)
A Fixed-Parameter Perspective on #BIS (2017) (11)
Computation in permutation groups: counting and randomly sampling orbits (2001) (11)
The complexity of approximately counting in 2-spin systems on k-uniform bounded-degree hypergraphs (2015) (11)
The Complexity of Approximately Counting Tree Homomorphisms (2013) (10)
Fast Algorithms for General Spin Systems on Bipartite Expanders (2020) (10)
A Counterexample to rapid mixing of the Ge-Stefankovic Process (2011) (10)
The Complexity of Approximating the Matching Polynomial in the Complex Plane (2018) (10)
Phase transitions of the Moran process and algorithmic consequences (2018) (9)
The Complexity of Counting Surjective Homomorphisms and Compactions (2017) (9)
Ranking games that have competitiveness-based strategies (2010) (9)
Uniqueness for the 3-State Antiferromagnetic Potts Model on the Tree (2018) (9)
Approximating the Tutte polynomial of a binary matroid and other related combinatorial polynomials (2010) (9)
Approximation via Correlation Decay When Strong Spatial Mixing Fails (2019) (9)
Approximately counting locally-optimal structures (2014) (8)
Log-supermodular functions, functional clones and counting CSPs (2011) (8)
The complexity of gene placement (2001) (8)
Proceedings of the 35th international colloquium on Automata, Languages and Programming, Part II (2008) (8)
The complexity of approximately counting stable roommate assignments (2010) (8)
Fast mixing via polymers for random graphs with unbounded degree (2021) (7)
The Complexity of Computing the Sign of the Tutte Polynomial (and Consequent #P-hardness of Approximation) (2012) (7)
The "Burnside Process" Converges Slowly (1998) (6)
Approximating the partition function of planar two-state spin systems (2012) (6)
Fast sampling of satisfying assignments from random k-SAT (2022) (6)
The complexity of approximating the complex-valued Potts model (2020) (6)
Tight Size Bounds for Packet Headers in Narrow Meshes (2000) (6)
Listing Graphs That Satisfy First-Order Sentences (1994) (6)
Approximately Counting Answers to Conjunctive Queries with Disequalities and Negations (2021) (6)
Approximating Pairwise Correlations in the Ising Model (2018) (5)
Counting and Sampling H-Colourings (2002) (5)
An extension of path coupling and its application to the Glauber dynamics for graph colourings (extended abstract) (2000) (5)
Holant Clones and the Approximability of Conservative Holant Problems (2018) (4)
Fast sampling via spectral independence beyond bounded-degree graphs (2021) (4)
Counting Homomorphisms to K4-minor-free Graphs, modulo 2 (2020) (4)
Metastability of the Potts ferromagnet on random regular graphs (2022) (4)
The complexity of approximating the complex-valued Ising model on bounded degree graphs (2021) (4)
Random Walks on Small World Networks (2017) (4)
Counting Homomorphisms to Cactus Graphs Modulo 2 (2014) (4)
The ‘Burnside Process’ Converges Slowly (2002) (4)
A lower bound for routing on a completely connected optical communication parallel computer (1993) (4)
Counting List Matrix Partitions of Graphs (2013) (4)
Brief Announcement: Stabilizing Consensus with the Power of Two Choices (2010) (4)
Functional clones and expressibility of partition functions (2016) (4)
An Omega(sqrt{log log n}) Lower Bound for Routing in Optical Networks (1998) (4)
The Complexity of Approximating complex-valued Ising and Tutte partition functions (2017) (3)
Automata, Languages and Programming (2008) (3)
Evolutionary Dynamics on Graphs: Invited Talk (2015) (3)
Increasing efficacy of contact-tracing applications by user referrals and stricter quarantining (2020) (2)
Markov chains for the hard-core model via polymer models (2019) (2)
The complexity of counting locally maximal satisfying assignments of Boolean CSPs (2015) (2)
Counting 4×4 Matrix Partitions of Graphs (2014) (2)
Approximating partition functions of bounded-degree Boolean counting Constraint Satisfaction Problems (2016) (2)
Boolean approximate counting CSPs with weak conservativity, and implications for ferromagnetic two-spin (2018) (2)
Approximation Algorithms for the Fixed-Topology Phylogenetic Number Problem (1997) (2)
On the use of diagnostic dependence-analysis tools in parallel programming: Experiences using PTOOL (1990) (2)
Randomly sampling unlabelled structures (1999) (1)
Automata, Languages and Programming, 35th International Colloquium, ICALP 2008, Reykjavik, Iceland, July 7-11, 2008, Proceedings, Part II - Track B: Logic, Semantics, and Theory of Programming & Track C: Security and Cryptography Foundations (2008) (1)
Approximating Fixation Probabilities in the Generalized Moran Process (2012) (1)
Frugality Ratios And Improved Truthful Mechanisms for (2007) (1)
D M ] 2 9 N ov 2 01 3 Absorption Time of the Moran Process ∗ (2017) (1)
Approximating the Partition Function of Two-Spin Systems on Bipartite Graphs (2013) (1)
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (2012) (1)
A note on the high-fugacity hard-core model on bounded-degree bipartite expander graphs (2019) (1)
The Complexity of Approximately Counting Retractions to Square-free Graphs (2019) (1)
The complexity of choosing anH-colouring (nearly) uniformly at random (2002) (1)
Counting Independent Sets in Hypergraphs when Strong Spatial Mixing Fails (2015) (1)
Instability of backoff protocols with arbitrary arrival rates (2022) (1)
Proceedings of the 38th international conference on Automata, languages and programming - Volume Part II (2008) (1)
Adaptive Drift Analysis (2011) (1)
Faster Exponential-time Algorithms for Approximately Counting Independent Sets (2020) (1)
Analysis of a simple learning algorithm: learning foraging thresholds for lizards (1996) (1)
The Complexity of Approximating Bounded-Degree Boolean \sharp CSP (2009) (1)
Tight Size Bounds for Pa ket Headersin Narrow (2000) (0)
Applications to Particular Families of Structures (1993) (0)
Computational Counting (Dagstuhl Seminar 18341) (2017) (0)
A bound on the apa ity of ba ko anda knowledgement-based proto ols (2000) (0)
The Complexity of Approximately Counting Retractions (2018) (0)
Improved Distortion and Spam Resistance for PageRank (2018) (0)
COUNTING SOLUTIONS TO RANDOM CNF FORMULAS\ast (2021) (0)
Approximately Counting H-Colourings is #\mathrm BIS # BIS -Hard (2015) (0)
Routing in Optical networks: The problem of contention (1994) (0)
Inapproximability of the Tutte polynomial of a planar graph (2012) (0)
D M ] 2 8 A pr 2 01 7 Functional Clones and Expressibility of Partition Functions ∗ (2018) (0)
Approximately Counting Graph Homomorphisms and Retractions (Invited Talk) (2021) (0)
The EATCS Award 2014 - Call for nominations (2013) (0)
Computational Counting (Dagstuhl Seminar 13031) (2013) (0)
PR ] 1 4 O ct 2 00 4 Markov chain comparison ∗ (2006) (0)
10481 Executive Summary - Computational Counting (2010) (0)
Index of Notation and Terms (1993) (0)
Spin systems with an external ﬁeld: a complexity classiﬁcation (2015) (0)
The complexity of Boolean #MaximalCSP (2015) (0)
A COMPLEXITY DICHOTOMY FOR PARTITION FUNCTIONS WITH (2009) (0)
Techniques for Listing Combinatorial Structures (1993) (0)
Counting Subgraphs in Somewhere Dense Graphs (2022) (0)
Directions for Future Work on Listing (1993) (0)
Some New (And Old) Results on Contention Resolution (2022) (0)
Statement from EATCS President and vice Presidents about the recent US travel restrictions to foreigners (2017) (0)
Minimizing phylogenetic number evolutionary trees * to find good (1996) (0)
The complexity of approximating the complex-valued Potts model (2022) (0)
BETTER APPROXIMATION GUARANTEESFOR JOB-SHOP SCHEDULING (2006) (0)
Counting Homomorphisms to Cactus Graphs Modulo 2ú (2016) (0)
Network congestion can be controlled: Routing algorithms in optical networks and Ethernets (1997) (0)
Some New (And Old) Results on Contention Resolution (Invited Talk) (2022) (0)
62 : 2 Amplifiers for the Moran Process 1 Introduction (2016) (0)
45 : 2 Approximation via Correlation Decay When SSM fails 1 (2016) (0)
Can Fixation be Guaranteed in the Generalized Moran Process? (2012) (0)
Parameterised and Fine-grained Subgraph Counting, modulo 2 (2023) (0)
4 Concluding Remarks Acknowledgements (1994) (0)
The expressibility of Boolean functions with applications to Counting CSPs (2011) (0)
Implementations and the independent set polynomial below the Shearer threshold (2016) (0)
The Mixing Time of Glauber Dynamics for Colouring Regular Trees (Revised Version) (2011) (0)
Parameterised Approximation of the Fixation Probability of the Dominant Mutation in the Multi-Type Moran Process (2023) (0)
A pr 2 01 9 Approximating Pairwise Correlations in the Ising Model ∗ (2019) (0)
Efficient Algorithms for Listing Combinatorial Structures: Abstract (1993) (0)
THE COMPLEXITY OF COUNTING SURJECTIVE (2019) (0)
10481 Abstracts Collection - Computational Counting (2010) (0)
Learning Foraging Thresholds for Lizards (1996) (0)
Computational Complexity and Partition Functions (Invited Talk) (2019) (0)
Asymptotically Optimal Ampliﬁers for the Moran Process ∗ (2018) (0)
The Mixing Rate of Glauber Dynamics for Sampling Colourings of Regular Trees with Few Colours (2011) (0)
Citation for Published Item: Use Policy the Natural Work-stealing Algorithm Is Stable * (2014) (0)

This paper list is powered by the following services:

Other Resources About Leslie Ann Goldberg

What Schools Are Affiliated With Leslie Ann Goldberg?

Leslie Ann Goldberg is affiliated with the following schools:

Leslie Ann Goldberg's Academic­Influence.com Rankings

Leslie Ann Goldberg's Degrees

Why Is Leslie Ann Goldberg Influential?

Leslie Ann Goldberg's Published Works

Published Works

Other Resources About Leslie Ann Goldberg

What Schools Are Affiliated With Leslie Ann Goldberg?

Leslie Ann Goldberg's AcademicInfluence.com Rankings