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

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

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

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

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

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

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

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

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

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

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