Leslie Ann Goldberg
Orcid: 0000-0003-1879-6089Affiliations:
- University of Oxford, UK
According to our database1,
Leslie Ann Goldberg
authored at least 168 papers
between 1990 and 2025.
Collaborative distances:
Collaborative distances:
Timeline
1990
1995
2000
2005
2010
2015
2020
2025
0
5
10
1
8
2
4
8
7
6
1
6
9
6
5
8
7
1
5
4
2
3
4
3
5
2
2
4
3
4
2
1
1
1
1
1
1
1
3
2
2
1
1
2
2
1
2
1
4
1
3
1
1
1
4
1
1
2
2
1
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on zbmath.org
-
on orcid.org
-
on id.loc.gov
-
on cs.ox.ac.uk
-
on dl.acm.org
On csauthors.net:
Bibliography
2025
Approximately Counting Answers to Conjunctive Queries with Disequalities and Negations.
ACM Trans. Algorithms, January, 2025
2024
Algorithmica, April, 2024
ACM Trans. Algorithms, January, 2024
Parameterised approximation of the fixation probability of the dominant mutation in the multi-type Moran process.
Theor. Comput. Sci., 2024
Fast Sampling of Satisfying Assignments from Random \(\boldsymbol{k}\)-SAT with Applications to Connectivity.
SIAM J. Discret. Math., 2024
Counting Answers to Unions of Conjunctive Queries: Natural Tractability Criteria and Meta-Complexity.
Proc. ACM Manag. Data, 2024
Proceedings of the 15th Innovations in Theoretical Computer Science Conference, 2024
2023
Theor. Comput. Sci., 2023
Proceedings of the 2023 ACM-SIAM Symposium on Discrete Algorithms, 2023
Proceedings of the 24th ACM Conference on Economics and Computation, 2023
Sampling from the Random Cluster Model on Random Regular Graphs at All Temperatures via Glauber Dynamics.
Proceedings of the Approximation, 2023
2022
The Complexity of Approximating the Complex-Valued Ising Model on Bounded Degree Graphs.
SIAM J. Discret. Math., September, 2022
Comput. Complex., 2022
Proceedings of the 49th International Colloquium on Automata, Languages, and Programming, 2022
Proceedings of the 49th International Colloquium on Automata, Languages, and Programming, 2022
2021
ACM Trans. Comput. Theory, 2021
ACM Trans. Comput. Theory, 2021
Theor. Comput. Sci., 2021
ACM Trans. Algorithms, 2021
SIAM J. Discret. Math., 2021
Random Struct. Algorithms, 2021
Approximating partition functions of bounded-degree Boolean counting Constraint Satisfaction Problems.
J. Comput. Syst. Sci., 2021
Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms, 2021
Proceedings of the 41st IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2021
2020
ACM Trans. Comput. Theory, 2020
ACM Trans. Algorithms, 2020
Sampling in Uniqueness from the Potts and Random-Cluster Models on Random Regular Graphs.
SIAM J. Discret. Math., 2020
SIAM J. Comput., 2020
Random Struct. Algorithms, 2020
Boolean approximate counting CSPs with weak conservativity, and implications for ferromagnetic two-spin.
J. Comput. Syst. Sci., 2020
2019
ACM Trans. Comput. Theory, 2019
SIAM J. Discret. Math., 2019
SIAM J. Comput., 2019
A note on the high-fugacity hard-core model on bounded-degree bipartite expander graphs.
CoRR, 2019
Proceedings of the 36th International Symposium on Theoretical Aspects of Computer Science, 2019
2018
2017
ACM Trans. Comput. Theory, 2017
Theor. Comput. Sci., 2017
Statement from EATCS President and vice Presidents about the recent US travel restrictions to foreigners.
Bull. EATCS, 2017
Comput. Complex., 2017
Proceedings of the 44th International Colloquium on Automata, Languages, and Programming, 2017
2016
ACM Trans. Comput. Theory, 2016
Theor. Comput. Sci., 2016
#BIS-hardness for 2-spin systems on bipartite bounded degree graphs in the tree non-uniqueness region.
J. Comput. Syst. Sci., 2016
The complexity of approximately counting in 2-spin systems on k-uniform bounded-degree hypergraphs.
Inf. Comput., 2016
The complexity of approximately counting in 2-spin systems on <i>k</i>-uniform bounded-degree hypergraphs.
Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, 2016
Proceedings of the 43rd International Colloquium on Automata, Languages, and Programming, 2016
2015
Proc. Natl. Acad. Sci. USA, 2015
J. Comput. Syst. Sci., 2015
J. Comput. Syst. Sci., 2015
Proceedings of the Automata, Languages, and Programming - 42nd International Colloquium, 2015
Proceedings of the 2015 ACM Conference on Foundations of Genetic Algorithms XIII, Aberystwyth, United Kingdom, January 17, 2015
2014
ACM Trans. Comput. Theory, 2014
ACM Trans. Comput. Theory, 2014
The complexity of approximating complex-valued Ising and Tutte partition functions with applications to quantum simulation.
CoRR, 2014
Algorithmica, 2014
Proceedings of the 31st International Symposium on Theoretical Aspects of Computer Science (STACS 2014), 2014
2013
A Polynomial-Time Algorithm for Estimating the Partition Function of the Ferromagnetic Ising Model on a Regular Matroid.
SIAM J. Comput., 2013
Approximating the Tutte polynomial of a binary matroid and other related combinatorial polynomials.
J. Comput. Syst. Sci., 2013
The expressibility of functions on the boolean domain, with applications to counting CSPs.
J. ACM, 2013
CoRR, 2013
2012
J. Comput. Syst. Sci., 2012
Proceedings of the 29th International Symposium on Theoretical Aspects of Computer Science, 2012
The Complexity of Computing the Sign of the Tutte Polynomial (and Consequent #P-hardness of Approximation).
Proceedings of the Automata, Languages, and Programming - 39th International Colloquium, 2012
2011
Proceedings of the SPAA 2011: Proceedings of the 23rd Annual ACM Symposium on Parallelism in Algorithms and Architectures, 2011
2010
SIAM J. Comput., 2010
Random Struct. Algorithms, 2010
CoRR, 2010
Proceedings of the Distributed Computing, 24th International Symposium, 2010
Proceedings of the Parallel Problem Solving from Nature, 2010
Proceedings of the Computational Counting, 28.11. - 03.12.2010, 2010
Proceedings of the Computational Counting, 28.11. - 03.12.2010, 2010
2009
Math. Log. Q., 2009
Ann. Math. Artif. Intell., 2009
2008
Proceedings of the Twenty-Third AAAI Conference on Artificial Intelligence, 2008
2007
Proceedings of the Proceedings 8th ACM Conference on Electronic Commerce (EC-2007), 2007
Proceedings of the Proceedings 8th ACM Conference on Electronic Commerce (EC-2007), 2007
Proceedings of the Twenty-Second AAAI Conference on Artificial Intelligence, 2007
2006
Rapidly Mixing Markov Chains for Sampling Contingency Tables with a Constant Number of Rows.
SIAM J. Comput., 2006
LMS J. Comput. Math., 2006
Electron. Colloquium Comput. Complex., 2006
2005
Electron. Colloquium Comput. Complex., 2005
2004
SIAM J. Comput., 2004
SIAM J. Comput., 2004
Proceedings of the 45th Symposium on Foundations of Computer Science (FOCS 2004), 2004
2003
Random Struct. Algorithms, 2003
Proceedings of the SPAA 2003: Proceedings of the Fifteenth Annual ACM Symposium on Parallelism in Algorithms and Architectures, 2003
2002
Proceedings of the Proceedings on 34th Annual ACM Symposium on Theory of Computing, 2002
2001
SIAM J. Discret. Math., 2001
Evolutionary Trees Can be Learned in Polynomial Time in the Two-State General Markov Model.
SIAM J. Comput., 2001
Theory Comput. Syst., 2001
2000
An Extension of Path Coupling and Its Application to the Glauber Dynamics for Graph Colorings.
SIAM J. Comput., 2000
Proceedings of the STACS 2000, 2000
An extension of path coupling and its application to the Glauber dynamics for graph colourings (extended abstract).
Proceedings of the Eleventh Annual ACM-SIAM Symposium on Discrete Algorithms, 2000
Proceedings of the Automata, Languages and Programming, 27th International Colloquium, 2000
Proceedings of the Automata, Languages and Programming, 27th International Colloquium, 2000
1999
Analysis of Practical Backoff Protocols for Contention Resolution with Multiple Servers.
J. Comput. Syst. Sci., 1999
Algorithmica, 1999
1998
SIAM J. Comput., 1998
1997
Doubly Logarithmic Communication Algorithms for Optical-Communication Parallel Computers.
SIAM J. Comput., 1997
Proceedings of the 38th Annual Symposium on Foundations of Computer Science, 1997
1996
Discret. Appl. Math., 1996
Proceedings of the Ninth Annual Conference on Computational Learning Theory, 1996
1994
Proceedings of the 6th Annual ACM Symposium on Parallel Algorithms and Architectures, 1994
Proceedings of the Workshop on Interconnection Networks and Mapping and Scheduling Parallel Computations, 1994
1993
Inf. Comput., August, 1993
Proceedings of the Twenty-Fifth Annual ACM Symposium on Theory of Computing, 1993
A Doubly Logarithmic Communication Algorithm for the Completely Connected Optical Communication Parallel Computer.
Proceedings of the 5th Annual ACM Symposium on Parallel Algorithms and Architectures, 1993
1992
1991
1990
On the use of diagnostic dependence-analysis tools in parallel programming: Experiences using PTOOL.
J. Supercomput., 1990