Seuraa
Pinyan Lu
Pinyan Lu
ITCS, Shanghai University of Finance and Economics
Vahvistettu sähköpostiosoite verkkotunnuksessa mail.shufe.edu.cn - Kotisivu
Nimike
Viittaukset
Viittaukset
Vuosi
Asymptotically optimal strategy-proof mechanisms for two-facility games
P Lu, X Sun, Y Wang, ZA Zhu
Proceedings of the 11th ACM conference on Electronic commerce, 315-324, 2010
2132010
Combinatorial multi-armed bandit with general reward functions
W Chen, W Hu, F Li, J Li, Y Liu, P Lu
Advances in Neural Information Processing Systems, 1659-1667, 2016
1632016
Correlation Decay up to Uniqueness in Spin Systems
L Li, P Lu, Y Yin
Arxiv preprint arXiv:1111.7064, 2011
1512011
On the approximability of budget feasible mechanisms
N Chen, N Gravin, P Lu
Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete …, 2011
1462011
Graph homomorphisms with complex values: A dichotomy theorem
JY Cai, X Chen, P Lu
SIAM Journal on Computing 42 (3), 924-1029, 2013
1422013
Holographic algorithms: from art to science
JY Cai, P Lu
Journal of Computer and System Sciences 77 (1), 41-61, 2011
141*2011
Tighter bounds for facility games
P Lu, Y Wang, Y Zhou
Internet and Network Economics: 5th International Workshop, WINE 2009, Rome …, 2009
1332009
Holant problems and counting CSP
JY Cai, P Lu, M Xia
Proceedings of the forty-first annual ACM symposium on Theory of computing …, 2009
1232009
Holographic algorithms by fibonacci gates and holographic reductions for hardness
JY Cai, P Lu, M Xia
Foundations of Computer Science, 2008. FOCS'08. IEEE 49th Annual IEEE …, 2008
862008
The complexity of complex weighted Boolean# CSP
JY Cai, P Lu, M Xia
Journal of Computer and System Sciences 80 (1), 217-236, 2014
842014
Budget Feasible Mechanism Design: From Prior-Free to Bayesian
X Bei, N Chen, N Gravin, P Lu
Arxiv preprint arXiv:1203.4455, 2012
802012
An algorithmic framework for approximating maximin share allocation of chores
X Huang, P Lu
Proceedings of the 22nd ACM Conference on Economics and Computation, 630-631, 2021
792021
Non-negatively Weighted# CSP: An Effective Complexity Dichotomy
JY Cai, X Chen, P Lu
2011 26th Annual IEEE Conference on Computational Complexity, 45-54, 2011
75*2011
Computational Complexity of Holant Problems
JY Cai, P Lu, M Xia
SIAM Journal on Computing 40, 1101, 2011
692011
Approximate counting via correlation decay in spin systems
L Li, P Lu, Y Yin
Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete …, 2012
682012
On the theory of matchgate computations
JY Cai, V Choudhary, P Lu
Theory of Computing Systems 45 (1), 108-132, 2009
652009
Facility location games with fractional preferences
CKK Fong, M Li, P Lu, T Todo, M Yokoo
Proceedings of the AAAI Conference on Artificial Intelligence 32 (1), 2018
602018
Holographic Algorithms with Matchgates Capture Precisely Tractable Planar_# CSP
JY Cai, P Lu, M Xia
2010 IEEE 51st Annual Symposium on Foundations of Computer Science, 427-436, 2010
572010
From Holant to #CSP and Back: Dichotomy for Holant c Problems
JY Cai, S Huang, P Lu
Algorithmica 64, 511-533, 2012
562012
Dichotomy for Holant Problems of Boolean Domain
JY Cai, P Lu, M Xia
Proceedings of the 22nd Annual ACM-SIAM Symposium on Discrete Algorithms …, 2011
562011
Järjestelmä ei voi suorittaa toimenpidettä nyt. Yritä myöhemmin uudelleen.
Artikkelit 1–20