Pinyan Lu

Follow

Generating author description...

All published works
Action Title Year Authors
+ PDF Chat Coresets for Constrained Clustering: General Assignment Constraints and Improved Size Bounds 2025 Lingxiao Huang
Jian Li
Pinyan Lu
Xuan Wu
+ PDF Chat Incentives for Early Arrival in Cost Sharing 2024 Junyu Zhang
Yao Zhang
Yu Ge
Dengji Zhao
Hu Fu
Zhihao Gavin Tang
Pinyan Lu
+ PDF Chat Competitive Auctions with Imperfect Predictions 2024 Pinyan Lu
Zongqi Wan
Jialin Zhang
+ PDF Chat Sample-Based Matroid Prophet Inequalities 2024 Hu Fu
Pinyan Lu
Zhihao Gavin Tang
Hongxun Wu
Jinzhao Wu
Qianfan Zhang
+ PDF Chat Sample-Based Matroid Prophet Inequalities 2024 Hu Fu
Pinyan Lu
Zhihao Gavin Tang
Hongxun Wu
Jinzhao Wu
Qianfan Zhang
+ PDF Chat Design and Characterization of Strategy-Proof Mechanisms for Two-Facility Game on a Line 2024 Pinyan Lu
Zihan Luo
Jialin Zhang
+ PDF Chat The Price of Stability for First Price Auction 2023 Yaonan Jin
Pinyan Lu
+ PDF Chat Bidder Subset Selection Problem in Auction Design 2023 Xiaohui Bei
Nick Gravin
Pinyan Lu
Zhihao Gavin Tang
+ Improved Coresets for Clustering with Capacity and Fairness Constraints 2023 Lingxiao Huang
Pinyan Lu
Xuan Wu
+ Auction Design for Value Maximizers with Budget and Return-on-spend Constraints 2023 Pinyan Lu
Chenyang Xu
Ruilong Zhang
+ A Hierarchical Destroy and Repair Approach for Solving Very Large-Scale Travelling Salesman Problem 2023 Zhang-Hua Fu
Sipeng Sun
Jintong Ren
Tianshu Yu
Haoyu Zhang
Yuanyuan Liu
Lingxiao Huang
Yan Xiang
Pinyan Lu
+ Two-State Spin Systems with Negative Interactions 2023 Yumou Fei
Leslie Ann Goldberg
Pinyan Lu
+ Competitive Auctions with Imperfect Predictions 2023 Pinyan Lu
Zongqi Wan
Jialin Zhang
+ PDF Chat Tight Revenue Gaps among Multiunit Mechanisms 2022 Yaonan Jin
Shunhua Jiang
Pinyan Lu
Hengjie Zhang
+ PDF Chat First Price Auction is 1 – 1 /e<sup>2</sup> Efficient 2022 Yaonan Jin
Pinyan Lu
+ An FPTAS for the hardcore model on random regular bipartite graphs 2022 Chao Liao
Jiabao Lin
Pinyan Lu
Zhenyu Mao
+ PDF Chat Mechanism Design with Predictions 2022 Chenyang Xu
Pinyan Lu
+ PDF Chat Oblivious Online Contention Resolution Schemes 2022 Hu Fu
Pinyan Lu
Zhihao Gavin Tang
Abner Turkieltaub
Hongxun Wu
Jinzhao Wu
Qianfan Zhang
+ First Price Auction is $1-1/e^2$ Efficient 2022 Yaonan Jin
Pinyan Lu
+ The Price of Stability for First Price Auction 2022 Yaonan Jin
Pinyan Lu
+ Better Approximation for Interdependent SOS Valuations 2022 Pinyan Lu
Enze Sun
Chenghan Zhou
+ PDF Chat Better Approximation for Interdependent SOS Valuations 2022 Pinyan Lu
Enze Sun
Chenghan Zhou
+ Mechanism Design with Predictions 2022 Chenyang Xu
Pinyan Lu
+ Bidder Subset Selection Problem in Auction Design 2022 Xiaohui Bei
Nick Gravin
Pinyan Lu
Zhihao Gavin Tang
+ PDF Chat Bayesian auctions with efficient queries 2021 Jing Chen
Bo Li
Yingkai Li
Pinyan Lu
+ PDF Chat An Algorithmic Framework for Approximating Maximin Share Allocation of Chores 2021 Xin Huang
Pinyan Lu
+ Tight Revenue Gaps among Multi-Unit Mechanisms 2021 Yaonan Jin
Shunhua Jiang
Pinyan Lu
Hengjie Zhang
+ Variance-Dependent Best Arm Identification 2021 Pinyan Lu
Tao Chao
Xiaojin Zhang
+ PDF Chat Approximating Permanent of Random Matrices with Vanishing Mean: Made Better and Simpler 2021 Zhengfeng Ji
Zhihan Jin
Pinyan Lu
+ Tight Revenue Gaps among Multi-Unit Mechanisms 2021 Yaonan Jin
Shunhua Jiang
Pinyan Lu
Hengjie Zhang
+ PDF Chat Generalized Sorting with Predictions 2021 Pinyan Lu
Xuandi Ren
Enze Sun
Yubo Zhang
+ Variance-Dependent Best Arm Identification 2021 Pinyan Lu
Tao Chao
Xiaojin Zhang
+ Oblivious Online Contention Resolution Schemes 2021 Hu Fu
Pinyan Lu
Zhihao Gavin Tang
Abner Turkieltaub
Hongxun Wu
Jinzhao Wu
Qianfan Zhang
+ PDF Chat Zeros of Holant Problems 2020 Heng Guo
Chao Liao
Pinyan Lu
Chihao Zhang
+ PDF Chat Optimal Budget-Feasible Mechanisms for Additive Valuations 2020 Nick Gravin
Yaonan Jin
Pinyan Lu
Chenhao Zhang
+ Approximability of the eight-vertex model 2020 Jin‐Yi Cai
Tianyu Liu
Pinyan Lu
Jing Yu
+ Strategyproof Mechanism for Two Heterogeneous Facilities with Constant Approximation Ratio 2020 Minming Li
Pinyan Lu
Yuhao Yao
Jialin Zhang
+ PDF Chat Dichotomy for Holant∗ Problems on the Boolean Domain 2020 Jin‐Yi Cai
Pinyan Lu
Mingji Xia
+ PDF Chat Tight Revenue Gaps Among Simple Mechanisms 2020 Yaonan Jin
Pinyan Lu
Zhihao Gavin Tang
Tao Xiao
+ Generalized Sorting with Predictions 2020 Pinyan Lu
Xuandi Ren
Enze Sun
Yubo Zhang
+ Revocable Deep Reinforcement Learning with Affinity Regularization for Outlier-Robust Graph Matching 2020 Chang Liu
Runzhong Wang
Zetian Jiang
Junchi Yan
Lingxiao Huang
Pinyan Lu
+ PDF Chat Zeros of ferromagnetic 2-spin systems 2019 Heng Guo
Jingcheng Li
Pinyan Lu
+ PDF Chat Tight approximation ratio of anonymous pricing 2019 Yaonan Jin
Pinyan Lu
Qi Qi
Zhihao Gavin Tang
Tao Xiao
+ PDF Chat Optimal Budget-Feasible Mechanisms for Additive Valuations 2019 Nick Gravin
Yaonan Jin
Pinyan Lu
Chenhao Zhang
+ Revenue Maximization with Imprecise Distribution 2019 Yingkai Li
Pinyan Lu
Haoran Ye
+ Zeros of holant problems: locations and algorithms 2019 Heng Guo
Chao Liao
Pinyan Lu
Chihao Zhang
+ PDF Chat Approximability of the Six-vertex Model 2019 Jin‐Yi Cai
Tianyu Liu
Pinyan Lu
+ PDF Chat Tight Revenue Gaps among Simple Mechanisms 2019 Yaonan Jin
Pinyan Lu
Zhihao Gavin Tang
Tao Xiao
+ Optimal Budget-Feasible Mechanisms for Additive Valuations 2019 Nick Gravin
Yaonan Jin
Pinyan Lu
Chenhao Zhang
+ Counting independent sets and colorings on random regular bipartite graphs 2019 Chao Liao
Jiabao Lin
Pinyan Lu
Zhenyu Mao
+ Zeros of ferromagnetic 2-spin systems 2019 Heng Guo
Jing‐Cheng Liu
Pinyan Lu
+ An Algorithmic Framework for Approximating Maximin Share Allocation of Chores 2019 Xin Huang
Pinyan Lu
+ Strategyproof Mechanism for Two Heterogeneous Facilities with Constant Approximation Ratio 2019 Minming Li
Pinyan Lu
Yuhao Yao
Jialin Zhang
+ PDF Chat Counting Hypergraph Colorings in the Local Lemma Regime 2019 Heng Guo
Chao Liao
Pinyan Lu
Chihao Zhang
+ Counting Independent Sets and Colorings on Random Regular Bipartite Graphs 2019 Chao Liao
Jiabao Lin
Pinyan Lu
Zhenyu Mao
+ Approximating Permanent of Random Matrices with Vanishing Mean: Made Better and Simpler 2019 Zhengfeng Ji
Zhihan Jin
Pinyan Lu
+ Learning Reserve Prices in Second-Price Auctions 2019 Yaonan Jin
Pinyan Lu
Tao Xiao
+ PDF Chat Zeros of Holant problems: locations and algorithms 2019 Heng Guo
Chao Liao
Pinyan Lu
Chihao Zhang
+ Revenue Maximization with Imprecise Distribution 2019 Yingkai Li
Pinyan Lu
Haoran Ye
+ PDF Chat Uniqueness, Spatial Mixing, and Approximation for Ferromagnetic 2-Spin Systems 2018 Heng Guo
Pinyan Lu
+ PDF Chat Counting hypergraph colourings in the local lemma regime 2018 Heng Guo
Chao Liao
Pinyan Lu
Chihao Zhang
+ PDF Chat Dichotomy for Real Holant<sup><i>c</i></sup> Problems 2018 Jin‐Yi Cai
Pinyan Lu
Mingji Xia
+ PDF Chat The Value of Information Concealment 2018 Hu Fu
Christopher Liaw
Pinyan Lu
Zhihao Gavin Tang
+ Bayesian Auctions with Efficient Queries 2018 Jing Chen
Bo Li
Yingkai Li
Pinyan Lu
+ Zeros of Holant problems: locations and algorithms 2018 Heng Guo
Chao Liao
Pinyan Lu
Chihao Zhang
+ Tight Revenue Gaps among Simple Mechanisms 2018 Yaonan Jin
Pinyan Lu
Zhihao Gavin Tang
Tao Xiao
+ Tight Approximation Ratio of Anonymous Pricing 2018 Yaonan Jin
Pinyan Lu
Qi Qi
Zhihao Gavin Tang
Tao Xiao
+ Approximability of the Eight-vertex Model 2018 Jin‐Yi Cai
Tianyu Liu
Pinyan Lu
Jing Yu
+ On the Complexity of Holant Problems 2017 Heng Guo
Pinyan Lu
+ PDF Chat Holographic Algorithms with Matchgates Capture Precisely Tractable Planar #CSP 2017 Jin‐Yi Cai
Pinyan Lu
Mingji Xia
+ Counting hypergraph colorings in the local lemma regime 2017 Heng Guo
Chao Liao
Pinyan Lu
Chihao Zhang
+ An FPTAS for Counting Proper Four-Colorings on Cubic Graphs 2017 Pinyan Lu
Kuan Yang
Chihao Zhang
Minshen Zhu
+ Dichotomy for Real Holant$^c$ Problems 2017 Jin‐Yi Cai
Pinyan Lu
Mingji Xia
+ Approximability of the Six-vertex Model 2017 Jin‐Yi Cai
Tianyu Liu
Pinyan Lu
+ The Value of Information Concealment 2017 Hu Fu
Christopher Liaw
Pinyan Lu
Zhihao Gavin Tang
+ Combinatorial Multi-Armed Bandit with General Reward Functions 2016 Wei Chen
Wei Hu
Fu Li
Jian Li
Yu Liu
Pinyan Lu
+ Uniqueness, Spatial Mixing, and Approximation for Ferromagnetic 2-Spin Systems 2016 Heng Guo
Pinyan Lu
+ Canonical paths for MCMC: from art to science 2016 Lingxiao Huang
Pinyan Lu
Chihao Zhang
+ Combinatorial Multi-Armed Bandit with General Reward Functions 2016 Wei Chen
Wei Hu
Fu Li
Jian Li
Yu Liu
Pinyan Lu
+ An FPTAS for Counting Proper Four-Colorings on Cubic Graphs 2016 Pinyan Lu
Kuan Yang
Chihao Zhang
Minshen Zhu
+ Nonnegative Weighted #CSP: An Effective Complexity Dichotomy 2016 Jin‐Yi Cai
Xi Chen
Pinyan Lu
+ FPTAS for Hardcore and Ising Models on Hypergraphs 2016 Pinyan Lu
Kuan Yang
Chihao Zhang
+ Approximating the Partition Function of Two-Spin Systems 2016 Pinyan Lu
Yitong Yin
+ Complexity Dichotomies for Counting Graph Homomorphisms 2016 Jin‐Yi Cai
Xi Chen
Pinyan Lu
+ Canonical Paths for MCMC: from Art to Science 2015 Lingxiao Huang
Pinyan Lu
Chihao Zhang
+ A Dichotomy for Real Weighted Holant Problems 2015 Sangxia Huang
Pinyan Lu
+ PDF Chat Competitive Analysis via Benchmark Decomposition 2015 Ning Chen
Nick Gravin
Pinyan Lu
+ PDF Chat Improved Efficiency Guarantees in Auctions with Budgets 2015 Pinyan Lu
Tao Xiao
+ PDF Chat FPTAS for #BIS with Degree Bounds on One Side 2015 Jing‐Cheng Liu
Pinyan Lu
+ Approximating the Partition Function of Two-Spin Systems 2015 Pinyan Lu
Yitong Yin
+ Complexity Dichotomies for Counting Graph Homomorphisms 2015 Jin‐Yi Cai
Xi Chen
Pinyan Lu
+ Uniqueness, Spatial Mixing, and Approximation for Ferromagnetic 2-Spin Systems 2015 Heng Guo
Pinyan Lu
+ FPTAS for Hardcore and Ising Models on Hypergraphs 2015 Pinyan Lu
Kuan Yang
Chihao Zhang
+ Canonical Paths for MCMC: from Art to Science 2015 Lingxiao Huang
Pinyan Lu
Chihao Zhang
+ PDF Chat FPTAS for Counting Monotone CNF 2014 Jing‐Cheng Liu
Pinyan Lu
+ FPTAS for #BIS with One Side Degree Bound. 2014 Jingcheng Liu
Pinyan Lu
+ The complexity of approximating conservative counting CSPs 2014 Xi Chen
Martin Dyer
Leslie Ann Goldberg
Mark Jerrum
Pinyan Lu
Colin McQuillan
David Richerby
+ PDF Chat Optimal competitive auctions 2014 Ning Chen
Nick Gravin
Pinyan Lu
+ The Complexity of Ferromagnetic Two-spin Systems with External Fields 2014 Jing‐Cheng Liu
Pinyan Lu
Chihao Zhang
+ A simple FPTAS for counting edge covers 2014 Chengyu Lin
Jing‐Cheng Liu
Pinyan Lu
+ PDF Chat FPTAS for Weighted Fibonacci Gates and Its Applications 2014 Pinyan Lu
Menghui Wang
Chihao Zhang
+ The Complexity of Ferromagnetic Two-spin Systems with External Fields 2014 Jing‐Cheng Liu
Pinyan Lu
Chihao Zhang
+ Optimal Competitive Auctions 2014 Ning Chen
Nick Gravin
Pinyan Lu
+ Improved Efficiency Guarantees in Auctions with Budgets 2014 Pinyan Lu
Tao Xiao
+ FPTAS for Weighted Fibonacci Gates and Its Applications 2014 Pinyan Lu
Menghui Wang
Chihao Zhang
+ Competitive analysis via benchmark decomposition 2014 Ning Chen
Nick Gravin
Pinyan Lu
+ PDF Chat FPTAS for Counting Weighted Edge Covers 2014 Jing‐Cheng Liu
Pinyan Lu
Chihao Zhang
+ PDF Chat A Simple FPTAS for Counting Edge Covers 2013 Chengyu Lin
Jing‐Cheng Liu
Pinyan Lu
+ The complexity of complex weighted Boolean #CSP 2013 Jin‐Yi Cai
Pinyan Lu
Mingji Xia
+ Correlation decay up to uniqueness in spin systems 2013 Liang Li
Pinyan Lu
Yitong Yin
+ Dichotomy for holant* problems with a function on domain size 3 2013 Jin‐Yi Cai
Pinyan Lu
Mingji Xia
+ PDF Chat Dichotomy for Holant Problems with a Function on Domain Size 3 2013 Jin‐Yi Cai
Pinyan Lu
Mingji Xia
+ PDF Chat Correlation Decay up to Uniqueness in Spin Systems 2013 Liang Li
Pinyan Lu
Yitong Yin
+ PDF Chat Competitive Auctions for Markets with Positive Externalities 2013 Nick Gravin
Pinyan Lu
+ FPTAS for Counting Monotone CNF 2013 Jing‐Cheng Liu
Pinyan Lu
+ Dichotomy for Holant* Problems with Domain Size 3. 2013 Jin‐Yi Cai
Pinyan Lu
Mingji Xia
+ The complexity of approximating conservative counting CSPs. 2013 Xi Chen
Martin Dyer
Leslie Ann Goldberg
Mark Jerrum
Pinyan Lu
Colin McQuillan
David Richerby
+ PDF Chat Graph Homomorphisms with Complex Values: A Dichotomy Theorem 2013 Jin‐Yi Cai
Xi Chen
Pinyan Lu
+ Improved FPTAS for Multi-spin Systems 2013 Pinyan Lu
Yitong Yin
+ A Dichotomy for Real Weighted Holant Problems 2012 Sangxia Huang
Pinyan Lu
+ PDF Chat Budget feasible mechanism design: from prior-free to bayesian 2012 Xiaohui Bei
Ning Chen
Nick Gravin
Pinyan Lu
+ PDF Chat Budget feasible mechanism design 2012 Xiaohui Bei
Ning Chen
Nick Gravin
Pinyan Lu
+ PDF Chat Holographic reduction, interpolation and hardness 2012 Jin‐Yi Cai
Pinyan Lu
Mingji Xia
+ PDF Chat Budget Feasible Mechanism Design: From Prior-Free to Bayesian 2012 Xiaohui Bei
Ning Chen
Nick Gravin
Pinyan Lu
+ PDF Chat From Holant to #CSP and Back: Dichotomy for Holant c Problems 2012 Jin‐Yi Cai
Sangxia Huang
Pinyan Lu
+ Approximate counting via correlation decay in spin systems 2012 Liang Li
Pinyan Lu
Yitong Yin
+ Approximate Counting via Correlation Decay in Spin Systems 2012 Li Liang
Pinyan Lu
Yitong Yin
+ PDF Chat Inapproximability after Uniqueness Phase Transition in Two-Spin Systems 2012 Jin‐Yi Cai
Xi Chen
Heng Guo
Pinyan Lu
+ Inapproximability After Uniqueness Phase Transition in Two-Spin Systems 2012 Jin‐Yi Cai
Xi Chen
Heng Guo
Pinyan Lu
+ Dichotomy for Holant* Problems with a Function on Domain Size 3 2012 Jin‐Yi Cai
Pinyan Lu
Mingji Xia
+ PDF Chat Non-negatively Weighted #CSP: An Effective Complexity Dichotomy 2011 Jin‐Yi Cai
Xi Chen
Pinyan Lu
+ PDF Chat Holographic algorithms by Fibonacci gates 2011 Jin‐Yi Cai
Pinyan Lu
Mingji Xia
+ The Complexity of Weighted Boolean #CSP Modulo $k$ 2011 Heng Guo
Sangxia Huang
Pinyan Lu
Mingji Xia
+ Dichotomy for Holant problems of Boolean domain 2011 Jin‐Yi Cai
Pinyan Lu
Mingji Xia
+ On the approximability of budget feasible mechanisms 2011 Ning Chen
Nick Gravin
Pinyan Lu
+ PDF Chat On the Approximability of Budget Feasible Mechanisms 2011 Ning Chen
Nick Gravin
Pinyan Lu
+ PDF Chat Optimal Pricing in Social Networks with Incomplete Information 2011 Wei Chen
Pinyan Lu
Xiaorui Sun
Bo Tang
Yajun Wang
Zeyuan Allen Zhu
+ Mechanism Design without Money via Stable Matching 2011 Ning Chen
Nick Gravin
Pinyan Lu
+ Budget Feasible Mechanism Design via Random Sampling 2011 Xiaohui Bei
Ning Chen
Nick Gravin
Pinyan Lu
+ Computational Complexity of Holant Problems 2011 Jin‐Yi Cai
Pinyan Lu
Mingji Xia
+ Complexity Dichotomies of Counting Problems. 2011 Pinyan Lu
+ Correlation Decay up to Uniqueness in Spin Systems 2011 Liang Li
Pinyan Lu
Yitong Yin
+ Competitive Auctions for Markets with Positive Externalities 2011 Nick Gravin
Pinyan Lu
+ Approximate Counting via Correlation Decay in Spin Systems 2011 Liang Li
Pinyan Lu
Yitong Yin
+ A computational proof of complexity of some restricted counting problems 2010 Jin‐Yi Cai
Pinyan Lu
Mingji Xia
+ PDF Chat Holographic Algorithms with Matchgates Capture Precisely Tractable Planar_#CSP 2010 Jin‐Yi Cai
Pinyan Lu
Mingji Xia
+ PDF Chat Holographic algorithms: From art to science 2010 Jin‐Yi Cai
Pinyan Lu
+ PDF Chat On Tractable Exponential Sums 2010 Jin‐Yi Cai
Xi Chen
Richard Lipton
Pinyan Lu
+ PDF Chat From Holant to #CSP and Back: Dichotomy for Holant c Problems 2010 Jin‐Yi Cai
Sangxia Huang
Pinyan Lu
+ PDF Chat Graph Homomorphisms with Complex Values: A Dichotomy Theorem 2010 Jin‐Yi Cai
Xi Chen
Pinyan Lu
+ Holographic Algorithms with Matchgates Capture Precisely Tractable Planar #CSP 2010 Jin‐Yi Cai
Pinyan Lu
Mingji Xia
+ Non-negative Weighted #CSPs: An Effective Complexity Dichotomy 2010 Jin‐Yi Cai
Xi Chen
Pinyan Lu
+ From Holant To #CSP And Back: Dichotomy For Holant$^c$ Problems 2010 Jin‐Yi Cai
Sangxia Huang
Pinyan Lu
+ Optimal Pricing in Social Networks with Incomplete Information 2010 Wei Chen
Pinyan Lu
Xiaorui Sun
Bo Tang
Yajun Wang
Zeyuan Allen Zhu
+ On the Approximability of Budget Feasible Mechanisms 2010 Ning Chen
Nick Gravin
Pinyan Lu
+ PDF Chat Signature Theory in Holographic Algorithms 2009 Jin‐Yi Cai
Pinyan Lu
+ On blockwise symmetric signatures for matchgates 2009 Jin‐Yi Cai
Pinyan Lu
+ Holant problems and counting CSP 2009 Jin‐Yi Cai
Pinyan Lu
Mingji Xia
+ Graph Homomorphisms with Complex Values: A Dichotomy Theorem 2009 Jin‐Yi Cai
Xi Chen
Pinyan Lu
+ Holographic algorithms: The power of dimensionality resolved 2009 Jin‐Yi Cai
Pinyan Lu
+ A Computational Proof of Complexity of Some Restricted Counting Problems 2009 Jin‐Yi Cai
Pinyan Lu
Mingji Xia
+ Holographic Algorithms by Fibonacci Gates and Holographic Reductions for Hardness 2008 Jin‐Yi Cai
Pinyan Lu
Mingji Xia
+ Basis Collapse in Holographic Algorithms 2008 Jin‐Yi Cai
Pinyan Lu
+ Holographic algorithms with unsymmetric signatures 2008 Jin‐Yi Cai
Pinyan Lu
+ An Improved Randomized Truthful Mechanism for Scheduling Unrelated Machines 2008 Pinyan Lu
Changyuan Yu
+ PDF Chat Signature Theory in Holographic Algorithms 2008 Jin‐Yi Cai
Pinyan Lu
+ PDF Chat On the Theory of Matchgate Computations 2007 Jin‐Yi Cai
Vinay Choudhary
Pinyan Lu
+ On Block-Wise Symmetric Signatures for Matchgates 2007 Jin‐Yi Cai
Pinyan Lu
+ Holographic Algorithms: The Power of Dimensionality Resolved 2007 Jin‐Yi Cai
Pinyan Lu
+ PDF Chat On the Theory of Matchgate Computations 2007 Jin‐Yi Cai
Vinay Choudhary
Pinyan Lu
+ Bases Collapse in Holographic Algorithms 2007 Jin‐Yi Cai
Pinyan Lu
+ On Block-wise Symmetric Signatures for Matchgates. 2007 Jin‐Yi Cai
Pinyan Lu
+ Simulating Undirected st-Connectivity Algorithms on Uniform JAGs and NNJAGs 2005 Pinyan Lu
Jialin Zhang
Chung Keung Poon
Jin‐Yi Cai
Common Coauthors
Commonly Cited References
Action Title Year Authors # of times referenced
+ The complexity of partition functions 2005 AndreÄ­ A. Bulatov
Martin Grohe
34
+ Polynomial-Time Approximation Algorithms for the Ising Model 1993 Mark Jerrum
Alistair Sinclair
32
+ Holant problems and counting CSP 2009 Jin‐Yi Cai
Pinyan Lu
Mingji Xia
30
+ Counting independent sets up to the tree threshold 2006 Dror Weitz
30
+ On counting homomorphisms to directed acyclic graphs 2007 Martin Dyer
Leslie Ann Goldberg
Mike Paterson
26
+ The Statistics of Dimers on a Lattice 2009 Piet Kasteleyn
26
+ Dimer problem in statistical mechanics-an exact result 1961 H. N. V. Temperley
Michael E. Fisher
25
+ The complexity of counting graph homomorphisms 2000 Martin Dyer
Catherine Greenhill
24
+ A Complexity Dichotomy for Partition Functions with Mixed Signs 2010 Leslie Ann Goldberg
Martin Grohe
Mark Jerrum
Marc Thurley
23
+ A polynomial-time approximation algorithm for the permanent of a matrix with nonnegative entries 2004 Mark Jerrum
Alistair Sinclair
Eric Vigoda
23
+ Correlation decay up to uniqueness in spin systems 2013 Liang Li
Pinyan Lu
Yitong Yin
20
+ PDF Chat Graph Homomorphisms with Complex Values: A Dichotomy Theorem 2010 Jin‐Yi Cai
Xi Chen
Pinyan Lu
19
+ Approximate counting via correlation decay in spin systems 2012 Liang Li
Pinyan Lu
Yitong Yin
19
+ PDF Chat The Complexity of Weighted Boolean #CSP 2009 Martin Dyer
Leslie Ann Goldberg
Mark Jerrum
19
+ Towards a dichotomy theorem for the counting constraint satisfaction problem 2006 AndreÄ­ A. Bulatov
VĂ­ctor Dalmau
18
+ Reflection positivity, rank connectivity, and homomorphism of graphs 2006 Michael Freedman
LĂĄszlĂł LovĂĄsz
Alexander Schrijver
18
+ On the complexity of H-coloring 1990 Pavol Hell
Jaroslav Nešetřil
18
+ Holographic Algorithms by Fibonacci Gates and Holographic Reductions for Hardness 2008 Jin‐Yi Cai
Pinyan Lu
Mingji Xia
18
+ Holographic algorithms 2004 Leslie G. Valiant
17
+ The Complexity of Counting in Sparse, Regular, and Planar Graphs 2001 Salil Vadhan
17
+ The statistics of dimers on a lattice 1961 Piet Kasteleyn
17
+ A very simple algorithm for estimating the number of k‐colorings of a low‐degree graph 1995 Mark Jerrum
16
+ PDF Chat Inapproximability of the Partition Function for the Antiferromagnetic Ising and Hard-Core Models 2016 Andreas Galanis
Daniel Štefankovič
Eric Vigoda
16
+ PDF Chat The computational complexity of two‐state spin systems 2003 Leslie Ann Goldberg
Mark Jerrum
Mike Paterson
16
+ The Complexity of Enumeration and Reliability Problems 1979 Leslie G. Valiant
15
+ PDF Chat The Computational Hardness of Counting in Two-Spin Models on d-Regular Graphs 2012 Allan Sly
Nike Sun
15
+ PDF Chat Simple deterministic approximation algorithms for counting matchings 2007 Mohsen Bayati
David Gamarnik
Dimitriy Katz
Chandra Nair
Prasad Tetali
14
+ Random generation of combinatorial structures from a uniform distribution 1986 Mark Jerrum
Leslie G. Valiant
Vijay V. Vazirani
14
+ PDF Chat The Relative Complexity of Approximate Counting Problems 2003 Martin Dyer
Leslie Ann Goldberg
Catherine Greenhill
Mark Jerrum
14
+ PDF Chat Budget Feasible Mechanisms 2010 Yaron Singer
14
+ Computational complexity of counting problems on 3-regular planar graphs 2007 Mingji Xia
Peng Zhang
Wenbo Zhao
13
+ PDF Chat Two-dimensional monomer-dimer systems are computationally intractable 1990 Mark Jerrum
12
+ PDF Chat Approximating the Permanent 1989 Mark Jerrum
Alistair Sinclair
12
+ Approximation algorithms for two-state anti-ferromagnetic spin systems on bounded degree graphs 2012 Alistair Sinclair
Piyush Srivastava
Marc Thurley
12
+ Computational Complexity of Holant Problems 2011 Jin‐Yi Cai
Pinyan Lu
Mingji Xia
12
+ PDF Chat Approximating the partition function of the ferromagnetic Potts model 2012 Leslie Ann Goldberg
Mark Jerrum
12
+ The Markov chain Monte Carlo method: an approach to approximate counting and integration 1996 Mark Jerrum
Alistair Sinclair
12
+ PDF Chat Computational Transition at the Uniqueness Threshold 2010 Allan Sly
12
+ The complexity of computing the permanent 1979 Leslie G. Valiant
12
+ On Markov Chains for Independent Sets 2000 Martin Dyer
Catherine Greenhill
12
+ On Counting Independent Sets in Sparse Graphs 2002 Martin Dyer
Alan Frieze
Mark Jerrum
12
+ PDF Chat An approximation trichotomy for Boolean #CSP 2009 Martin Dyer
Leslie Ann Goldberg
Mark Jerrum
11
+ PDF Chat On the Theory of Matchgate Computations 2007 Jin‐Yi Cai
Vinay Choudhary
Pinyan Lu
11
+ A simple FPTAS for counting edge covers 2014 Chengyu Lin
Jing‐Cheng Liu
Pinyan Lu
11
+ Bases Collapse in Holographic Algorithms 2007 Jin‐Yi Cai
Pinyan Lu
11
+ PDF Chat Valiant’s Holant Theorem and Matchgate Tensors 2006 Jin‐Yi Cai
Vinay Choudhary
11
+ PDF Chat Non-negatively Weighted #CSP: An Effective Complexity Dichotomy 2011 Jin‐Yi Cai
Xi Chen
Pinyan Lu
11
+ PDF Chat A Polynomial-Time Algorithm for Estimating the Partition Function of the Ferromagnetic Ising Model on a Regular Matroid 2011 Leslie Ann Goldberg
Mark Jerrum
11
+ The computational hardness of counting in two-spin models on d-regular graphs 2012 Allan Sly
Nike Sun
11
+ The complexity of counting graph homomorphisms (extended abstract) 2000 Martin Dyer
Catherine Greenhill
10