No. Title Author Year
1 Fast Sampling via Spectral Independence Beyond Bounded-Degree Graphs Bezáková, Ivona et al. 2022
2 Metastability of the Potts Ferromagnet on Random Regular Graphs Coja-Oghlan, Amin et al. 2022
3 Some New (And Old) Results on Contention Resolution (Invited Talk) Goldberg, Leslie Ann 2022
4 Approximately Counting Graph Homomorphisms and Retractions (Invited Talk) Goldberg, Leslie Ann 2021
5 Fast Mixing via Polymers for Random Graphs with Unbounded Degree Galanis, Andreas et al. 2021
6 Counting Solutions to Random CNF Formulas Galanis, Andreas et al. 2020
7 Fast Algorithms for General Spin Systems on Bipartite Expanders Galanis, Andreas et al. 2020
8 The Complexity of Approximating the Complex-Valued Potts Model Galanis, Andreas et al. 2020
9 Computational Complexity and Partition Functions (Invited Talk) Goldberg, Leslie Ann 2019
10 Fast Algorithms at Low Temperatures via Markov Chains Chen, Zongchen et al. 2019
11 The Complexity of Approximating the Matching Polynomial in the Complex Plane Bezáková, Ivona et al. 2019
12 A Fixed-Parameter Perspective on #BIS Curticapean, Radu et al. 2018
13 Computational Counting (Dagstuhl Seminar 17341) Bezáková, Ivona et al. 2018
14 Sampling in Uniqueness from the Potts and Random-Cluster Models on Random Regular Graphs Blanca, Antonio et al. 2018
15 Approximating Partition Functions of Bounded-Degree Boolean Counting Constraint Satisfaction Problems Galanis, Andreas et al. 2017
16 Inapproximability of the Independent Set Polynomial Below the Shearer Threshold Galanis, Andreas et al. 2017
17 A Complexity Trichotomy for Approximately Counting List H-Colourings Galanis, Andreas et al. 2016
18 Amplifiers for the Moran Process Galanis, Andreas et al. 2016
19 Approximation via Correlation Decay When Strong Spatial Mixing Fails Bezáková, Ivona et al. 2016
20 #BIS-Hardness for 2-Spin Systems on Bipartite Bounded Degree Graphs in the Tree Non-uniqueness Region Cai, Jin-Yi et al. 2014
21 Absorption Time of the Moran Process Díaz, Josep et al. 2014
22 Counting Homomorphisms to Cactus Graphs Modulo 2 Göbel, Andreas et al. 2014
23 Computational Counting (Dagstuhl Seminar 13031) Bürgisser, Peter et al. 2013
24 The complexity of approximating conservative counting CSPs Chen, Xi et al. 2013
25 Log-supermodular functions, functional clones and counting CSPs Bulatov, Andrei A. et al. 2012
26 10481 Abstracts Collection -- Computational Counting Bürgisser, Peter et al. 2011
27 10481 Executive Summary -- Computational Counting Bürgisser, Peter et al. 2011
28 Stabilizing Consensus with the Power of Two Choices Doerr, Benjamin et al. 2010
29 The Complexity of Approximating Bounded-Degree Boolean #CSP Dyer, Martin et al. 2010
30 A Complexity Dichotomy for Partition Functions with Mixed Signs Goldberg, Leslie Ann et al. 2009
Current Page :
Number of result pages: 1
Number of documents: 30


DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI