Heng Guo

Inf. Comput., October, 2023

Counting Vertices of Integral Polytopes Defined by Facets.

[BibT_eX]

[DOI]

Discret. Comput. Geom., October, 2023

A simple polynomial-time approximation algorithm for the total variation distance between two product distributions.

[BibT_eX]

[DOI]

TheoretiCS, 2023

Towards derandomising Markov chain Monte Carlo.

[BibT_eX]

[DOI]

Proceedings of the 64th IEEE Annual Symposium on Foundations of Computer Science, 2023

2022

Inapproximability of Counting Hypergraph Colourings.

[BibT_eX]

[DOI]

Andreas Galanis

ACM Trans. Comput. Theory, December, 2022

Rapid Mixing from Spectral Independence beyond the Boolean Domain.

[BibT_eX]

[DOI]

ACM Trans. Algorithms, 2022

Perfect sampling from spatial mixing.

[BibT_eX]

[DOI]

Yitong Yin

Random Struct. Algorithms, 2022

FKT is Not Universal - A Planar Holant Dichotomy for Symmetric Constraints.

[BibT_eX]

[DOI]

Theory Comput. Syst., 2022

A simple polynomial-time approximation algorithm for total variation distances between product distributions.

[BibT_eX]

[DOI]

CoRR, 2022

Fast sampling of satisfying assignments from random k-SAT.

[BibT_eX]

[DOI]

Andreas Galanis

Leslie Ann Goldberg

Andrés Herrera-Poyatos

CoRR, 2022

Sampling from the ferromagnetic Ising model with external fields.

[BibT_eX]

[DOI]

CoRR, 2022

Improving Certified Robustness via Statistical Learning with Logical Reasoning.

[BibT_eX]

[DOI]

Proceedings of the Advances in Neural Information Processing Systems 35: Annual Conference on Neural Information Processing Systems 2022, 2022

Improved Bounds for Randomly Colouring Simple Hypergraphs.

[BibT_eX]

[DOI]

Proceedings of the Approximation, 2022

2021

Zeros of Holant Problems: Locations and Algorithms.

[BibT_eX]

[DOI]

ACM Trans. Algorithms, 2021

Counting Solutions to Random CNF Formulas.

[BibT_eX]

[DOI]

SIAM J. Comput., 2021

Fast Sampling and Counting <i>k</i>-SAT Solutions in the Local Lemma Regime.

[BibT_eX]

[DOI]

J. ACM, 2021

Approximately counting bases of bicircular matroids.

[BibT_eX]

[DOI]

Comb. Probab. Comput., 2021

Counting vertices of integer polytopes defined by facets.

[BibT_eX]

[DOI]

CoRR, 2021

2020

Tight bounds for popping algorithms.

[BibT_eX]

[DOI]

Kun He

Random Struct. Algorithms, 2020

The complexity of planar Boolean #CSP with complex weights.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 2020

Local-to-Global Contraction in Simplicial Complexes.

[BibT_eX]

[DOI]

Giorgos Mousa

CoRR, 2020

End-to-end Robustness for Sensing-Reasoning Machine Learning Pipelines.

[BibT_eX]

[DOI]

CoRR, 2020

Fast sampling and counting k-SAT solutions in the local lemma regime.

[BibT_eX]

[DOI]

Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing, 2020

Zeros of ferromagnetic 2-spin systems.

[BibT_eX]

[DOI]

Jingcheng Liu

Proceedings of the 2020 ACM-SIAM Symposium on Discrete Algorithms, 2020

2019

A Polynomial-Time Approximation Algorithm for All-Terminal Network Reliability.

[BibT_eX]

[DOI]

SIAM J. Comput., 2019

Approximation via Correlation Decay When Strong Spatial Mixing Fails.

[BibT_eX]

[DOI]

SIAM J. Comput., 2019

Counting Hypergraph Colorings in the Local Lemma Regime.

[BibT_eX]

[DOI]

SIAM J. Comput., 2019

Uniform Sampling Through the Lovász Local Lemma.

[BibT_eX]

[DOI]

Jingcheng Liu

J. ACM, 2019

Modified log-Sobolev Inequalities for Strongly Log-Concave Distributions.

[BibT_eX]

[DOI]

Mary Cryan

Giorgos Mousa

Proceedings of the 60th IEEE Annual Symposium on Foundations of Computer Science, 2019

2018

Uniqueness, Spatial Mixing, and Approximation for Ferromagnetic 2-Spin Systems.

[BibT_eX]

[DOI]

ACM Trans. Comput. Theory, 2018

Clifford gates in the Holant framework.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2018

Holographic algorithms beyond matchgates.

[BibT_eX]

[DOI]

Inf. Comput., 2018

Counting hypergraph colourings in the local lemma regime.

[BibT_eX]

[DOI]

Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing, 2018

Perfect Simulation of the Hard Disks Model by Partial Rejection Sampling.

[BibT_eX]

[DOI]

Proceedings of the 45th International Colloquium on Automata, Languages, and Programming, 2018

Layerwise Systematic Scan: Deep Boltzmann Machines and Beyond.

[BibT_eX]

[DOI]

Kaan Kara

Ce Zhang

Proceedings of the International Conference on Artificial Intelligence and Statistics, 2018

2017

A simple FPRAS for bi-directed reachability.

[BibT_eX]

[DOI]

CoRR, 2017

The Complexity of Approximating complex-valued Ising and Tutte partition functions.

[BibT_eX]

[DOI]

Leslie Ann Goldberg

Comput. Complex., 2017

Random cluster dynamics for the Ising model is rapidly mixing.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 2017

On the Complexity of Holant Problems.

[BibT_eX]

[DOI]

Proceedings of the Constraint Satisfaction Problem: Complexity and Approximability, 2017

2016

Holant Problems.

[BibT_eX]

[DOI]

Encyclopedia of Algorithms, 2016

A Complete Dichotomy Rises from the Capture of Vanishing Signatures.

[BibT_eX]

[DOI]

SIAM J. Comput., 2016

#BIS-hardness for 2-spin systems on bipartite bounded degree graphs in the tree non-uniqueness region.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 2016

Mapping the complexity of counting problems.

[BibT_eX]

[DOI]

Bull. EATCS, 2016

2015

A Holant Dichotomy: Is the FKT Algorithm Universal?

[BibT_eX]

[DOI]

Proceedings of the IEEE 56th Annual Symposium on Foundations of Computer Science, 2015

2014

The complexity of approximating complex-valued Ising and Tutte partition functions with applications to quantum simulation.

[BibT_eX]

[DOI]

Leslie Ann Goldberg

CoRR, 2014

The Complexity of Counting Edge Colorings and a Dichotomy for Some Higher Domain Holant Problems.

[BibT_eX]

[DOI]

Proceedings of the 55th IEEE Annual Symposium on Foundations of Computer Science, 2014

2013

The Complexity of Symmetric Boolean Parity Holant Problems.

[BibT_eX]

[DOI]

Leslie G. Valiant

SIAM J. Comput., 2013

Approximating the Partition Function of Two-Spin Systems on Bipartite Graphs.

[BibT_eX]

[DOI]

CoRR, 2013

A complete dichotomy rises from the capture of vanishing signatures: extended abstract.

[BibT_eX]

[DOI]

Proceedings of the Symposium on Theory of Computing Conference, 2013

2012

Inapproximability after Uniqueness Phase Transition in Two-Spin Systems.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Optimization and Applications, 2012

2011

The Complexity of Weighted Boolean #CSP Modulo k.

[BibT_eX]

[DOI]

Proceedings of the 28th International Symposium on Theoretical Aspects of Computer Science, 2011

The Complexity of Symmetric Boolean Parity Holant Problems - (Extended Abstract).

[BibT_eX]

[DOI]