No. |
Title |
Author |
Year |
---|

1 |
Approximately Counting Graph Homomorphisms and Retractions (Invited Talk) |
Goldberg, Leslie Ann |
2021 |

2 |
Fast Mixing via Polymers for Random Graphs with Unbounded Degree |
Galanis, Andreas et al. |
2021 |

3 |
Counting Solutions to Random CNF Formulas |
Galanis, Andreas et al. |
2020 |

4 |
Fast Algorithms for General Spin Systems on Bipartite Expanders |
Galanis, Andreas et al. |
2020 |

5 |
The Complexity of Approximating the Complex-Valued Potts Model |
Galanis, Andreas et al. |
2020 |

6 |
Computational Complexity and Partition Functions (Invited Talk) |
Goldberg, Leslie Ann |
2019 |

7 |
Fast Algorithms at Low Temperatures via Markov Chains |
Chen, Zongchen et al. |
2019 |

8 |
The Complexity of Approximating the Matching Polynomial in the Complex Plane |
Bezáková, Ivona et al. |
2019 |

9 |
A Fixed-Parameter Perspective on #BIS |
Curticapean, Radu et al. |
2018 |

10 |
Computational Counting (Dagstuhl Seminar 17341) |
Bezáková, Ivona et al. |
2018 |

11 |
Sampling in Uniqueness from the Potts and Random-Cluster Models on Random Regular Graphs |
Blanca, Antonio et al. |
2018 |

12 |
Approximating Partition Functions of Bounded-Degree Boolean Counting Constraint Satisfaction Problems |
Galanis, Andreas et al. |
2017 |

13 |
Inapproximability of the Independent Set Polynomial Below the Shearer Threshold |
Galanis, Andreas et al. |
2017 |

14 |
A Complexity Trichotomy for Approximately Counting List H-Colourings |
Galanis, Andreas et al. |
2016 |

15 |
Amplifiers for the Moran Process |
Galanis, Andreas et al. |
2016 |

16 |
Approximation via Correlation Decay When Strong Spatial Mixing Fails |
Bezáková, Ivona et al. |
2016 |

17 |
#BIS-Hardness for 2-Spin Systems on Bipartite Bounded Degree Graphs in the Tree Non-uniqueness Region |
Cai, Jin-Yi et al. |
2014 |

18 |
Absorption Time of the Moran Process |
Díaz, Josep et al. |
2014 |

19 |
Counting Homomorphisms to Cactus Graphs Modulo 2 |
Göbel, Andreas et al. |
2014 |

20 |
Computational Counting (Dagstuhl Seminar 13031) |
Bürgisser, Peter et al. |
2013 |

21 |
The complexity of approximating conservative counting CSPs |
Chen, Xi et al. |
2013 |

22 |
Log-supermodular functions, functional clones and counting CSPs |
Bulatov, Andrei A. et al. |
2012 |

23 |
10481 Abstracts Collection -- Computational Counting |
Bürgisser, Peter et al. |
2011 |

24 |
10481 Executive Summary -- Computational Counting |
Bürgisser, Peter et al. |
2011 |

25 |
Stabilizing Consensus with the Power of Two Choices |
Doerr, Benjamin et al. |
2010 |

26 |
The Complexity of Approximating Bounded-Degree Boolean #CSP |
Dyer, Martin et al. |
2010 |

27 |
A Complexity Dichotomy for Partition Functions with Mixed Signs |
Goldberg, Leslie Ann et al. |
2009 |