| 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 | 207 | 2010 |
| 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 | 156 | 2016 |
| Correlation Decay up to Uniqueness in Spin Systems L Li, P Lu, Y Yin Arxiv preprint arXiv:1111.7064, 2011 | 149 | 2011 |
| 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 | 146 | 2011 |
| Holographic algorithms: from art to science JY Cai, P Lu Journal of Computer and System Sciences 77 (1), 41-61, 2011 | 140* | 2011 |
| Graph homomorphisms with complex values: A dichotomy theorem JY Cai, X Chen, P Lu SIAM Journal on Computing 42 (3), 924-1029, 2013 | 138 | 2013 |
| Tighter bounds for facility games P Lu, Y Wang, Y Zhou Internet and Network Economics: 5th International Workshop, WINE 2009, Rome …, 2009 | 130 | 2009 |
| Holant problems and counting CSP JY Cai, P Lu, M Xia Proceedings of the forty-first annual ACM symposium on Theory of computing …, 2009 | 119 | 2009 |
| 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 | 86 | 2008 |
| The complexity of complex weighted Boolean# CSP JY Cai, P Lu, M Xia Journal of Computer and System Sciences 80 (1), 217-236, 2014 | 80 | 2014 |
| Budget Feasible Mechanism Design: From Prior-Free to Bayesian X Bei, N Chen, N Gravin, P Lu Arxiv preprint arXiv:1203.4455, 2012 | 79 | 2012 |
| 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 | 75 | 2021 |
| 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 | 73* | 2011 |
| Computational Complexity of Holant Problems JY Cai, P Lu, M Xia SIAM Journal on Computing 40, 1101, 2011 | 69 | 2011 |
| 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 | 68 | 2012 |
| On the theory of matchgate computations JY Cai, V Choudhary, P Lu Theory of Computing Systems 45 (1), 108-132, 2009 | 64 | 2009 |
| 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 | 59 | 2018 |
| 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 | 57 | 2010 |
| From Holant to #CSP and Back: Dichotomy for Holant c Problems JY Cai, S Huang, P Lu Algorithmica 64, 511-533, 2012 | 55 | 2012 |
| 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 | 54 | 2011 |
Jin-Yi CaiUniversity of Wisconsin - MadisonVerified email at cs.wisc.edu
