Leslie Ann Goldberg

ScholarGPS® ID: 74377747145481

Affiliation

University of Oxford, Oxford, United Kingdom

Affiliation History

Field

Engineering and Computer Science

Discipline

Computer Science

Top Specialties

Metrics Summary

Publication Count

161

Predicted Citations

3,444

Predicted h-index

Ranking

Publications and Citation History

Publications based on Top Specialties

Types of Publication

Publications
Books
Patents
NIH/NSF

Add Delete
Counting Answers to Unions of Conjunctive Queries: Natural Tractability Criteria and Meta-Complexity (journal article) Focke, Jacob \| Goldberg, Leslie Ann \| Roth, Marc \| Zivný, Stanislav Proceedings of the ACM on Management of Data, volume 2, issue 2, pages 1-17 (2024). 10.1145/3651614 Cited by (1) \| Cite \| Source
The Weisfeiler-Leman Dimension of Conjunctive Queries (journal article) Göbel, Andreas \| Goldberg, Leslie A. \| Roth, Marc Proceedings of the ACM on Management of Data, volume 2, issue 2, pages 1-17 (2024). 10.1145/3651587 Cite \| Source
Parameterised and Fine-Grained Subgraph Counting, Modulo 2 (journal article) Goldberg, Leslie Ann \| Roth, Marc Algorithmica, volume 86, issue 4, pages 944-1005 (2024). 10.1007/s00453-023-01178-0 Cite \| Source
Fast Sampling via Spectral Independence Beyond Bounded-degree Graphs (journal article) Bezáková, Ivona \| Galanis, Andreas \| Goldberg, Leslie Ann \| Štefankovič, Daniel ACM Transactions on Algorithms, volume 20, issue 1, pages 1-26 (2024). 10.1145/3631354 Cite \| Source
Graph Ranking and the Cost of Sybil Defense (conference) Farach-Colton, Gwendolyn \| Farach-Colton, Martin \| Goldberg, Leslie Ann \| Komlos, Hanna \| Lapinskas, John \| Levi, Reut \| Medina, Moti \| Mosteiro, Miguel A. EC '23: 24th ACM Conference on Economics and Computation (2023) London United Kingdom 10.1145/3580507.3597782 Cite \| Source
Metastability of the Potts Ferromagnet on Random Regular Graphs (journal article) Coja-Oghlan, Amin \| Galanis, Andreas \| Goldberg, Leslie Ann \| Ravelomanana, Jean Bernoulli \| Štefankovič, Daniel \| Vigoda, Eric Communications in Mathematical Physics, volume 401, issue 1, pages 185-225 (2023). 10.1007/s00220-023-04644-6 Cited by (5) \| Cite \| Source
Implementations and the independent set polynomial below the Shearer threshold (journal article) Galanis, Andreas \| Goldberg, Leslie Ann \| Štefankovič, Daniel Theoretical Computer Science, volume 939 (2023). 10.1016/j.tcs.2022.10.025 Cite \| Source
The Complexity of Approximating the Complex-Valued Ising Model on Bounded Degree Graphs (journal article) Galanis, Andreas \| Goldberg, Leslie A. \| Herrera-Poyatos, Andres SIAM Journal on Discrete Mathematics, volume 36, issue 3, pages 2159-2204 (2022). 10.1137/21M1454043 Cited by (3) \| Cite \| Source
Approximately Counting Answers to Conjunctive Queries with Disequalities and Negations (conference) Focke, Jacob \| Goldberg, Leslie Ann \| Roth, Marc \| Zivný, Stanislav SIGMOD/PODS '22: International Conference on Management of Data (2022) Philadelphia PA USA 10.1145/3517804.3526231 Cited by (2) \| Cite \| Source
The complexity of approximating the complex-valued Potts model (journal article) Galanis, Andreas \| Goldberg, Leslie Ann \| Herrera-Poyatos, Andrés computational complexity, volume 31, issue 1 (2022). 10.1007/s00037-021-00218-x Cited by (4) \| Cite \| Source
Fast mixing via polymers for random graphs with unbounded degree (journal article) Galanis, Andreas \| Goldberg, Leslie Ann \| Stewart, James Information and Computation, volume 285 (2022). 10.1016/j.ic.2022.104894 Cited by (4) \| Cite \| Source
Fast Algorithms for General Spin Systems on Bipartite Expanders (journal article) Galanis, Andreas \| Goldberg, Leslie Ann \| Stewart, James ACM Transactions on Computation Theory, volume 13, issue 4, pages 1-18 (2021). 10.1145/3470865 Cited by (6) \| Cite \| Source
Faster exponential-time algorithms for approximately counting independent sets (journal article) Goldberg, Leslie Ann \| Lapinskas, John \| Richerby, David Theoretical Computer Science, volume 892 (2021). 10.1016/j.tcs.2021.09.009 Cited by (1) \| Cite \| Source
The Complexity of Approximately Counting Retractions to Square-free Graphs (journal article) Focke, Jacob \| Goldberg, Leslie Ann \| Živný, Stanislav ACM Transactions on Algorithms, volume 17, issue 3, pages 1-51 (2021). 10.1145/3458040 Cited by (1) \| Cite \| Source
The Complexity of Approximating the Matching Polynomial in the Complex Plane (journal article) Bezáková, Ivona \| Galanis, Andreas \| Goldberg, Leslie Ann \| Štefankovič, Daniel ACM Transactions on Computation Theory, volume 13, issue 2, pages 1-37 (2021). 10.1145/3448645 Cited by (6) \| Cite \| Source
Increasing efficacy of contact-tracing applications by user referrals and stricter quarantining (journal article) Goldberg, Leslie Ann \| Jorritsma, Joost \| Komjáthy, Júlia \| Lapinskas, John PLOS ONE, volume 16, issue 5, pages e0250435- (2021). 10.1371/journal.pone.0250435 Cited by (3) \| Cite \| Source
Fast algorithms at low temperatures via Markov chains† (journal article) Chen, Zongchen \| Galanis, Andreas \| Goldberg, Leslie A. \| Perkins, Will \| Stewart, James \| Vigoda, Eric Random Structures & Algorithms, volume 58, issue 2, pages 294-321 (2021). 10.1002/rsa.20968 Cited by (18) \| Cite \| Source
Approximating partition functions of bounded-degree Boolean counting Constraint Satisfaction Problems (journal article) Galanis, Andreas \| Goldberg, Leslie Ann \| Yang, Kuan Journal of Computer and System Sciences, volume 115 (2021). 10.1016/j.jcss.2020.08.003 Cited by (2) \| Cite \| Source
Counting Homomorphisms to $K_4$-Minor-Free Graphs, Modulo 2 (journal article) Focke, Jacob \| Goldberg, Leslie Ann \| Roth, Marc \| Živný, Stanislav SIAM Journal on Discrete Mathematics, volume 35, issue 4, pages 2749-2814 (2021). 10.1137/20M1382921 Cited by (1) \| Cite \| Source
The Complexity of Approximately Counting Retractions (journal article) Focke, Jacob \| Goldberg, Leslie Ann \| Živný, Stanislav ACM Transactions on Computation Theory, volume 12, issue 3, pages 1-43 (2020). 10.1145/3397472 Cited by (1) \| Cite \| Source