No. Title Author Year
1 Counting Independent Sets and Colorings on Random Regular Bipartite Graphs Liao, Chao et al. 2019
2 Front Matter, Table of Contents, Preface, Symposium Organization Lu, Pinyan et al. 2019
3 Brief Announcement: Bayesian Auctions with Efficient Queries Chen, Jing et al. 2018
4 On the Complexity of Holant Problems Guo, Heng et al. 2017
5 FPTAS for Hardcore and Ising Models on Hypergraphs Lu, Pinyan et al. 2016
6 Uniqueness, Spatial Mixing, and Approximation for Ferromagnetic 2-Spin Systems Guo, Heng et al. 2016
7 The Complexity of Ferromagnetic Two-spin Systems with External Fields Liu, Jingcheng et al. 2014
8 The complexity of approximating conservative counting CSPs Chen, Xi et al. 2013
9 The Complexity of Weighted Boolean #CSP Modulo k Guo, Heng et al. 2011
10 An Improved Randomized Truthful Mechanism for Scheduling Unrelated Machines Lu, Pinyan et al. 2008
Current Page :
Number of result pages: 1
Number of documents: 10


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