1. Counting independent sets up to the tree threshold;Weitz,2006
2. Computational transition at the uniqueness threshold;Sly,2010
3. The computational hardness of counting in two-spin models on d-regular graphs;Sly,2012
4. Inapproximability of the partition function for the antiferromagnetic Ising and hard-core models;Galanis;Comb. Probab. Comput.,2016
5. FPTAS for #bis with degree bounds on one side;Liu,2015