A complexity classification of spin systems with an external field von Goldberg, Leslie Ann, Jerrum, Mark

Volltext

Phase transitions of the Moran process and algorithmic consequences von Goldberg, Leslie, Lapinskas, John, Richerby, David

Volltext

Increasing efficacy of contact-tracing applications by user referrals and stricter quarantining von Goldberg, Leslie Ann, Jorritsma, Joost, Komjáthy, Júlia, Lapinskas, John

Volltext

An approximation trichotomy for Boolean #CSP von Dyer, Martin, Goldberg, Leslie Ann, Jerrum, Mark

Volltext

The relative complexity of approximate counting problems von DYER, Martin, GOLDBERG, Leslie Ann, GREENHILL, Catherine, JERRUM, Mark

Volltext

Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques: 14th International Workshop, APPROX 2011, and 15th International Workshop, RANDOM 2011, Pri... von Goldberg, Leslie Ann, Jansen, Klaus, Ravi, R, Rolim, José D. P

Volltext

On the computational complexity of weighted voting games von Elkind, Edith, Goldberg, Leslie Ann, Goldberg, Paul W., Wooldridge, Michael

Volltext

Parameterised and Fine-Grained Subgraph Counting, Modulo 2 von Goldberg, Leslie Ann, Roth, Marc

Volltext

Adaptive Drift Analysis von Doerr, Benjamin, Goldberg, Leslie Ann

Volltext

Approximating the Partition Function of the Ferromagnetic Potts Model von GOLDBERG, Leslie Ann, JERRUM, Mark

Volltext

Parameterised approximation of the fixation probability of the dominant mutation in the multi-type Moran process von Goldberg, Leslie Ann, Roth, Marc, Schwarz, Tassilo

Volltext

The Complexity of Approximating complex-valued Ising and Tutte partition functions von Goldberg, Leslie Ann, Guo, Heng

Volltext

Distributed Selfish Load Balancing von Berenbrink, Petra, Friedetzky, Tom, Goldberg, Leslie Ann, Goldberg, Paul W., Hu, Zengjian, Martin, Russell

Volltext

A Tractable and Expressive Class of Marginal Contribution Nets and Its Applications von Elkind, Edith, Goldberg, Leslie Ann, Goldberg, Paul W., Wooldridge, Michael

Volltext

Faster exponential-time algorithms for approximately counting independent sets von Goldberg, Leslie Ann, Lapinskas, John, Richerby, David

Volltext

Counting Subgraphs in Somewhere Dense Graphs von Bressan, Marco, Ann Goldberg, Leslie, Meeks, Kitty, Roth, Marc

Volltext

Fast mixing via polymers for random graphs with unbounded degree von Galanis, Andreas, Goldberg, Leslie Ann, Stewart, James

Volltext

Holant Clones and the Approximability of Conservative Holant Problems von Backens, Miriam, Goldberg, Leslie Ann

Volltext

The Complexity of Computing the Sign of the Tutte Polynomial von Goldberg, Leslie Ann, Jerrum, Mark

Volltext

Approximating partition functions of bounded-degree Boolean counting Constraint Satisfaction Problems von Galanis, Andreas, Goldberg, Leslie Ann, Yang, Kuan

Volltext