Pin-Yan Lu

Most-cited papers

Combinatorial Multi-Armed Bandit with General Reward Functions
Wei Chen, Wei Hu, Fu Li, J. Li +2 more
2016Neural Information Processing Systems159 citations
Semantic Scholar
Correlation Decay up to Uniqueness in Spin Systems
Liang-Pan Li, Pin-Yan Lu, Yitong Yin
2011ACM-SIAM Symposium on Discrete Algorithms142 citations
Semantic Scholar
Holographic Algorithms
Jin-Yi Cai, Pin-Yan Lu, Mingji Xia
2016Encyclopedia of Algorithms123 citations Open access
Semantic Scholar
An Algorithmic Framework for Approximating Maximin Share Allocation of Chores
Xin Huang, Pin-Yan Lu
2019ACM Conference on Economics and Computation104 citations Open access
Semantic Scholar
Budget feasible mechanism design: from prior-free to bayesian
Xiao-Hui Bei, Ning Chen, N. Gravin, Pin-Yan Lu
2012Symposium on the Theory of Computing76 citations
Semantic Scholar
Computational Complexity of Holant Problems
Jin-Yi Cai, Pin-Yan Lu, Mingji Xia
2011SIAM journal on computing (Print)74 citations
Semantic Scholar
The complexity of complex weighted Boolean #CSP
Jin-Yi Cai, Pin-Yan Lu, Mingji Xia
2014Journal of computer and system sciences (Print)71 citations Open access
Semantic Scholar
M-Mix: Generating Hard Negatives via Multi-sample Mixing for Contrastive Learning
Shaofeng Zhang, Meng Liu, Junchi Yan, Hengrui Zhang +3 more
2022Knowledge Discovery and Data Mining64 citations
Semantic Scholar
Approximate counting via correlation decay in spin systems
Liang-Pan Li, Pin-Yan Lu, Yitong Yin
2011ACM-SIAM Symposium on Discrete Algorithms57 citations
Semantic Scholar
Facility Location Games With Fractional Preferences
C. Fong, Min-Ming Li, Pin-Yan Lu, Taiki Todo +1 more
2018AAAI Conference on Artificial Intelligence56 citations Open access
Semantic Scholar
Mechanism Design with Predictions
Chen-Yang Xu, Pin-Yan Lu
2022International Joint Conference on Artificial Intelligence53 citations Open access
Semantic Scholar
Improved FPTAS for Multi-spin Systems
Pin-Yan Lu, Yitong Yin
2013International Workshop and International Workshop on Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques52 citations
Semantic Scholar
A Dichotomy for Real Weighted Holant Problems
Sangxia Huang, Pin-Yan Lu
2012Computational Complexity52 citations Open access
Semantic Scholar
Nonnegative Weighted #CSP: An Effective Complexity Dichotomy
Jin-Yi Cai, Xi Chen, Pin-Yan Lu
2016SIAM journal on computing (Print)42 citations
Semantic Scholar
Tight approximation ratio of anonymous pricing
Yao-Nan Jin, Pin-Yan Lu, Qi Qi, Zhihao Gavin Tang +1 more
2018Symposium on the Theory of Computing40 citations
Semantic Scholar
A Simple FPTAS for Counting Edge Covers
Cheng-Yu Lin, Jing-Cheng Liu, Pin-Yan Lu
2013ACM-SIAM Symposium on Discrete Algorithms40 citations Open access
Semantic Scholar
Strategyproof Mechanism for Two Heterogeneous Facilities with Constant Approximation Ratio
Min-Ming Li, Pin-Yan Lu, Yuhao Yao, Jialin Zhang
2019International Joint Conference on Artificial Intelligence39 citations Open access
Semantic Scholar
Optimal competitive auctions
Ning Chen, N. Gravin, Pin-Yan Lu
2014Symposium on the Theory of Computing39 citations Open access
Semantic Scholar
Tight Revenue Gaps among Simple Mechanisms
Yao-Nan Jin, Pin-Yan Lu, Zhihao Gavin Tang, Tao Xiao
2018ACM-SIAM Symposium on Discrete Algorithms37 citations Open access
Semantic Scholar
FPTAS for Counting Monotone CNF
Jing-Cheng Liu, Pin-Yan Lu
2013ACM-SIAM Symposium on Discrete Algorithms37 citations Open access
Semantic Scholar
Correlation-Robust Analysis of Single Item Auction
Xiao-Hui Bei, N. Gravin, Pin-Yan Lu, Zhihao Gavin Tang
2019ACM-SIAM Symposium on Discrete Algorithms35 citations
Semantic Scholar
The Complexity of Symmetric Boolean Parity Holant Problems
Heng Guo, Pin-Yan Lu, L. Valiant
2013SIAM journal on computing (Print)34 citations
Semantic Scholar
Learning Plackett-Luce Mixtures from Partial Preferences
Ao Liu, Zhibing Zhao, Chao Liao, Pin-Yan Lu +1 more
2019AAAI Conference on Artificial Intelligence33 citations Open access
Semantic Scholar
Separation in Correlation-Robust Monopolist Problem with Budget
N. Gravin, Pin-Yan Lu
2018ACM-SIAM Symposium on Discrete Algorithms32 citations
Semantic Scholar
The Complexity of Weighted Boolean #CSP Modulo k
Heng Guo, Sangxia Huang, Pin-Yan Lu, Mingji Xia
2011Symposium on Theoretical Aspects of Computer Science32 citations
Semantic Scholar
Non-negatively Weighted #CSP: An Effective Complexity Dichotomy
Jin-Yi Cai, Xi Chen, Pin-Yan Lu
20112011 IEEE 26th Annual Conference on Computational Complexity30 citations
Semantic Scholar
Optimal Budget-Feasible Mechanisms for Additive Valuations
N. Gravin, Yao-Nan Jin, Pin-Yan Lu, Chen-Hao Zhang
2019ACM Conference on Economics and Computation29 citations
Semantic Scholar
Counting independent sets and colorings on random regular bipartite graphs
Chao Liao, Jia-Bao Lin, Pin-Yan Lu, Zhenyu Mao
2019International Workshop and International Workshop on Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques28 citations
Semantic Scholar
FPTAS for #BIS with Degree Bounds on One Side
Jing-Cheng Liu, Pin-Yan Lu
2014Symposium on the Theory of Computing28 citations Open access
Semantic Scholar
Counting hypergraph colorings in the local lemma regime
Heng Guo, Chao Liao, Pin-Yan Lu, Chi-Hao Zhang
2017SIAM journal on computing (Print)27 citations Open access
Semantic Scholar
Canonical Paths for MCMC: from Art to Science
Lingxiao Huang, Pin-Yan Lu, Chi-Hao Zhang
2015ACM-SIAM Symposium on Discrete Algorithms27 citations
Semantic Scholar
Holographic reduction, interpolation and hardness
Jin-Yi Cai, Pin-Yan Lu, Mingji Xia
2012Computational Complexity27 citations
Semantic Scholar
The complexity of approximating conservative counting CSPs
X. Chen, M. Dyer, L. Goldberg, M. Jerrum +3 more
2012Symposium on Theoretical Aspects of Computer Science25 citations Open access
Semantic Scholar
Complexity Dichotomies of Counting Problems
Pin-Yan Lu
2011Electron. Colloquium Comput. Complex.25 citations
Semantic Scholar
FPTAS for Counting Weighted Edge Covers
Jing-Cheng Liu, Pin-Yan Lu, Chi-Hao Zhang
2014Embedded Systems and Applications24 citations Open access
Semantic Scholar
Uniqueness, Spatial Mixing, and Approximation for Ferromagnetic 2-Spin Systems
Heng Guo, Pin-Yan Lu
2015TOCT23 citations Open access
Semantic Scholar
The Complexity of Ferromagnetic Two-spin Systems with External Fields
Jing-Cheng Liu, Pin-Yan Lu, Chi-Hao Zhang
2014International Workshop and International Workshop on Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques22 citations
Semantic Scholar
Holographic algorithms by Fibonacci gates
Jin-Yi Cai, Pin-Yan Lu, Mingji Xia
201322 citations Open access
Semantic Scholar
Computing the Nucleolus of Matching, Cover and Clique Games
Ning Chen, Pin-Yan Lu, Hongyang Zhang
2012AAAI Conference on Artificial Intelligence22 citations Open access
Semantic Scholar
Zeros of ferromagnetic 2-spin systems
Heng Guo, Jing-Cheng Liu, Pin-Yan Lu
2019ACM-SIAM Symposium on Discrete Algorithms21 citations Open access
Semantic Scholar
Worst-Case Mechanism Design via Bayesian Analysis
Xiao-Hui Bei, Ning Chen, N. Gravin, Pin-Yan Lu
2017SIAM journal on computing (Print)21 citations Open access
Semantic Scholar
Revenue Maximization with Imprecise Distribution
Yingkai Li, Pin-Yan Lu, Hao Ye
2019Adaptive Agents and Multi-Agent Systems20 citations Open access
Semantic Scholar
Truthful Generalized Assignments via Stable Matching
Ning Chen, N. Gravin, Pin-Yan Lu
2014Mathematics of Operations Research20 citations
Semantic Scholar
Improved Efficiency Guarantees in Auctions with Budgets
Pin-Yan Lu, Tao Xiao
2014ACM Conference on Economics and Computation20 citations Open access
Semantic Scholar
Dichotomy for Holant* Problems with Domain Size 3
Jin-Yi Cai, Pin-Yan Lu, Mingji Xia
2013ACM-SIAM Symposium on Discrete Algorithms20 citations
Semantic Scholar
Generalized Sorting with Predictions
Pin-Yan Lu, Xuan-Di Ren, Enze Sun, Yu-Bo Zhang
2020SIAM Symposium on Simplicity in Algorithms19 citations Open access
Semantic Scholar
Mechanism Design without Money via Stable Matching
Ning Chen, N. Gravin, Pin-Yan Lu
2011arXiv.org19 citations
Semantic Scholar
Relaxing the Independence Assumption in Sequential Posted Pricing, Prophet Inequality, and Random Bipartite Matching
I. Caragiannis, N. Gravin, Pin-Yan Lu, Zihe Wang
2021Workshop on Internet and Network Economics17 citations
Semantic Scholar
Online Selection Problems against Constrained Adversary
Zhihao Jiang, Pin-Yan Lu, Zhihao Gavin Tang, Yuhao Zhang
2021International Conference on Machine Learning17 citations
Semantic Scholar
Dichotomy for Real Holantc Problems
Jin-Yi Cai, Pin-Yan Lu, Mingji Xia
2017ACM-SIAM Symposium on Discrete Algorithms17 citations
Semantic Scholar