陆品燕
List of publications from the DBLP Bibliography Server - FAQ| 2013 | ||
|---|---|---|
| j15 | Heng Guo, Pinyan Lu, Leslie G. Valiant: The Complexity of Symmetric Boolean Parity Holant Problems. SIAM J. Comput. 42(1): 324-356 (2013) | |
| c41 | Chen Zeng, Jin-Yi Cai, Pinyan Lu, Jeffrey F. Naughton: On optimal differentially private mechanisms for count-range queries. ICDT 2013: 261-271 | |
| c40 | Liang Li, Pinyan Lu, Yitong Yin: Correlation Decay up to Uniqueness in Spin Systems. SODA 2013: 67-84 | |
| c39 | Jin-Yi Cai, Pinyan Lu, Mingji Xia: Dichotomy for Holant* Problems with Domain Size 3. SODA 2013: 1278-1295 | |
| c38 | Xi Chen, Martin E. Dyer, Leslie Ann Goldberg, Mark Jerrum, Pinyan Lu, Colin McQuillan, David Richerby: The complexity of approximating conservative counting CSPs. STACS 2013: 148-159 | |
| 2012 | ||
| j14 | Jin-Yi Cai, Sangxia Huang, Pinyan Lu: From Holant to #CSP and Back: Dichotomy for Holant c Problems. Algorithmica 64(3): 511-533 (2012) | |
| j13 | Jin-Yi Cai, Pinyan Lu, Mingji Xia: Holographic reduction, interpolation and hardness. Computational Complexity 21(4): 573-604 (2012) | |
| j12 | Sungjin Im, Pinyan Lu, Yayun Wang: Envy-Free Pricing with General Supply Constraints for Unit Demand Consumers. J. Comput. Sci. Technol. 27(4): 702-709 (2012) | |
| j11 | Pinyan Lu, Changyuan Yu: Worst-Case Nash Equilibria in Restricted Routing. J. Comput. Sci. Technol. 27(4): 710-717 (2012) | |
| c37 | Ning Chen, Pinyan Lu, Hongyang Zhang: Computing the Nucleolus of Matching, Cover and Clique Games. AAAI 2012 | |
| c36 | Sangxia Huang, Pinyan Lu: A Dichotomy for Real Weighted Holant Problems. IEEE Conference on Computational Complexity 2012: 96-106 | |
| c35 | Jin-Yi Cai, Xi Chen, Heng Guo, Pinyan Lu: Inapproximability after Uniqueness Phase Transition in Two-Spin Systems. COCOA 2012: 336-347 | |
| c34 | Liang Li, Pinyan Lu, Yitong Yin: Approximate counting via correlation decay in spin systems. SODA 2012: 922-940 | |
| c33 | Xiaohui Bei, Ning Chen, Nick Gravin, Pinyan Lu: Budget feasible mechanism design: from prior-free to bayesian. STOC 2012: 449-458 | |
| e1 | Jack Snoeyink, Pinyan Lu, Kaile Su, Lusheng Wang (Eds.): Frontiers in Algorithmics and Algorithmic Aspects in Information and Management - Joint International Conference, FAW-AAIM 2012, Beijing, China, May 14-16, 2012. Proceedings. Lecture Notes in Computer Science 7285, Springer 2012, isbn 978-3-642-29699-4 | |
| i24 | Xiaohui Bei, Ning Chen, Nick Gravin, Pinyan Lu: Budget Feasible Mechanism Design: From Prior-Free to Bayesian. CoRR abs/1203.4455 (2012) | |
| i23 | Jin-Yi Cai, Xi Chen, Heng Guo, Pinyan Lu: Inapproximability After Uniqueness Phase Transition in Two-Spin Systems. CoRR abs/1205.2934 (2012) | |
| i22 | Jin-Yi Cai, Pinyan Lu, Mingji Xia: Dichotomy for Holant* Problems with a Function on Domain Size 3. CoRR abs/1207.2354 (2012) | |
| i21 | Xi Chen, Martin E. Dyer, Leslie Ann Goldberg, Mark Jerrum, Pinyan Lu, Colin McQuillan, David Richerby: The complexity of approximating conservative counting CSPs. CoRR abs/1208.1783 (2012) | |
| 2011 | ||
| j10 | Jin-yi Cai, Pinyan Lu: Signature Theory in Holographic Algorithms. Algorithmica 61(4): 779-816 (2011) | |
| j9 | Jin-yi Cai, Pinyan Lu: Holographic algorithms: From art to science. J. Comput. Syst. Sci. 77(1): 41-61 (2011) | |
| j8 | Jin-yi Cai, Pinyan Lu, Mingji Xia: Computational Complexity of Holant Problems. SIAM J. Comput. 40(4): 1101-1132 (2011) | |
| j7 | Jin-yi Cai, Pinyan Lu, Mingji Xia: A computational proof of complexity of some restricted counting problems. Theor. Comput. Sci. 412(23): 2468-2485 (2011) | |
| c32 | Jin-yi Cai, Xi Chen, Pinyan Lu: Non-negatively Weighted #CSP: An Effective Complexity Dichotomy. IEEE Conference on Computational Complexity 2011: 45-54 | |
| c31 | Heng Guo, Pinyan Lu, Leslie G. Valiant: The Complexity of Symmetric Boolean Parity Holant Problems - (Extended Abstract). ICALP (1) 2011: 712-723 | |
| c30 | Ning Chen, Nick Gravin, Pinyan Lu: On the Approximability of Budget Feasible Mechanisms. SODA 2011: 685-699 | |
| c29 | Jin-yi Cai, Pinyan Lu, Mingji Xia: Dichotomy for Holant* Problems of Boolean Domain. SODA 2011: 1714-1728 | |
| c28 | Heng Guo, Sangxia Huang, Pinyan Lu, Mingji Xia: The Complexity of Weighted Boolean #CSP Modulo k. STACS 2011: 249-260 | |
| c27 | Wei Chen, Pinyan Lu, Xiaorui Sun, Bo Tang, Yajun Wang, Zeyuan Allen Zhu: Optimal Pricing in Social Networks with Incomplete Information. WINE 2011: 49-60 | |
| c26 | Xue Chen, Guangda Hu, Pinyan Lu, Lei Wang: On the Approximation Ratio of k-Lookahead Auction. WINE 2011: 61-71 | |
| c25 | Dakan Wang, Gang Wang, Pinyan Lu, Yajun Wang, Zheng Chen, Botao Hu: Is pay-per-click efficient?: an empirical analysis of click values. WWW (Companion Volume) 2011: 141-142 | |
| i20 | Ning Chen, Nick Gravin, Pinyan Lu: Mechanism Design without Money via Stable Matching. CoRR abs/1104.2872 (2011) | |
| i19 | Xiaohui Bei, Ning Chen, Nick Gravin, Pinyan Lu: Budget Feasible Mechanism Design via Random Sampling. CoRR abs/1107.2994 (2011) | |
| i18 | Nick Gravin, Pinyan Lu: Competitive Auctions for Markets with Positive Externalities. CoRR abs/1107.5221 (2011) | |
| i17 | Liang Li, Pinyan Lu, Yitong Yin: Approximate Counting via Correlation Decay in Spin Systems. CoRR abs/1109.0604 (2011) | |
| i16 | Liang Li, Pinyan Lu, Yitong Yin: Correlation Decay up to Uniqueness in Spin Systems. CoRR abs/1111.7064 (2011) | |
| i15 | Pinyan Lu: Complexity Dichotomies of Counting Problems. Electronic Colloquium on Computational Complexity (ECCC) 18: 93 (2011) | |
| 2010 | ||
| j6 | Jin-yi Cai, Pinyan Lu: On Symmetric Signatures in Holographic Algorithms. Theory Comput. Syst. 46(3): 398-415 (2010) | |
| j5 | Jin-yi Cai, Pinyan Lu: On blockwise symmetric signatures for matchgates. Theor. Comput. Sci. 411(4-5): 739-750 (2010) | |
| c24 | ||
| c23 | Jin-yi Cai, Pinyan Lu, Mingji Xia: Holographic Algorithms with Matchgates Capture Precisely Tractable Planar_#CSP. FOCS 2010: 427-436 | |
| c22 | Jin-yi Cai, Xi Chen, Pinyan Lu: Graph Homomorphisms with Complex Values: A Dichotomy Theorem. ICALP (1) 2010: 275-286 | |
| c21 | Jin-yi Cai, Sangxia Huang, Pinyan Lu: From Holant to #CSP and Back: Dichotomy for Holantc Problems. ISAAC (1) 2010: 253-265 | |
| c20 | Pinyan Lu, Xiaorui Sun, Yajun Wang, Zeyuan Allen Zhu: Asymptotically optimal strategy-proof mechanisms for two-facility games. ACM Conference on Electronic Commerce 2010: 315-324 | |
| c19 | Sungjin Im, Pinyan Lu, Yajun Wang: Envy-Free Pricing with General Supply Constraints. WINE 2010: 483-491 | |
| i14 | Jin-yi Cai, Sangxia Huang, Pinyan Lu: From Holant To #CSP And Back: Dichotomy For Holant$^c$ Problems. CoRR abs/1004.0803 (2010) | |
| i13 | Jin-yi Cai, Xi Chen, Richard J. Lipton, Pinyan Lu: On Tractable Exponential Sums. CoRR abs/1005.2632 (2010) | |
| i12 | Wei Chen, Pinyan Lu, Xiaorui Sun, Yajun Wang, Zeyuan Allen Zhu: Pricing in Social Networks: Equilibrium and Revenue Maximization. CoRR abs/1007.1501 (2010) | |
| i11 | Ning Chen, Nick Gravin, Pinyan Lu: On the Approximability of Budget Feasible Mechanisms. CoRR abs/1007.3801 (2010) | |
| i10 | Jin-yi Cai, Pinyan Lu, Mingji Xia: Holographic Algorithms with Matchgates Capture Precisely Tractable Planar #CSP. CoRR abs/1008.0683 (2010) | |
| i9 | Jin-yi Cai, Xi Chen, Pinyan Lu: Non-negative Weighted #CSPs: An Effective Complexity Dichotomy. CoRR abs/1012.5659 (2010) | |
| 2009 | ||
| j4 | Jin-yi Cai, Vinay Choudhary, Pinyan Lu: On the Theory of Matchgate Computations. Theory Comput. Syst. 45(1): 108-132 (2009) | |
| j3 | Jin-yi Cai, Pinyan Lu: Holographic algorithms: The power of dimensionality resolved. Theor. Comput. Sci. 410(18): 1618-1628 (2009) | |
| c18 | ||
| c17 | Jin-yi Cai, Pinyan Lu, Mingji Xia: A Computational Proof of Complexity of Some Restricted Counting Problems. TAMC 2009: 138-149 | |
| c16 | ||
| c15 | ||
| i8 | Jin-yi Cai, Xi Chen, Pinyan Lu: Graph Homomorphisms with Complex Values: A Dichotomy Theorem. CoRR abs/0903.4728 (2009) | |
| 2008 | ||
| j2 | Jin-yi Cai, Pinyan Lu: Basis Collapse in Holographic Algorithms. Computational Complexity 17(2): 254-281 (2008) | |
| c14 | Jin-yi Cai, Pinyan Lu, Mingji Xia: Holographic Algorithms by Fibonacci Gates and Holographic Reductions for Hardness. FOCS 2008: 644-653 | |
| c13 | ||
| c12 | ||
| c11 | Pinyan Lu, Changyuan Yu: An Improved Randomized Truthful Mechanism for Scheduling Unrelated Machines. STACS 2008: 527-538 | |
| c10 | ||
| c9 | Pinyan Lu, Changyuan Yu: Randomized Truthful Mechanisms for Scheduling Unrelated Machines. WINE 2008: 402-413 | |
| i7 | Jin-yi Cai, Pinyan Lu, Mingji Xia: A Family of Counter Examples to an Approach to Graph Isomorphism. CoRR abs/0801.1766 (2008) | |
| i6 | Pinyan Lu, Changyuan Yu: An Improved Randomized Truthful Mechanism for Scheduling Unrelated Machines. CoRR abs/0802.2851 (2008) | |
| 2007 | ||
| j1 | Jia Jia, Lianhong Cai, Pinyan Lu, Xuhui Liu: Fingerprint matching based on weighting method and the SVM. Neurocomputing 70(4-6): 849-858 (2007) | |
| c8 | Jin-yi Cai, Pinyan Lu: Bases Collapse in Holographic Algorithms. IEEE Conference on Computational Complexity 2007: 292-304 | |
| c7 | Jin-yi Cai, Vinay Choudhary, Pinyan Lu: On the Theory of Matchgate Computations. IEEE Conference on Computational Complexity 2007: 305-318 | |
| c6 | ||
| c5 | Jin-yi Cai, Pinyan Lu: Holographic Algorithms: The Power of Dimensionality Resolved. ICALP 2007: 631-642 | |
| c4 | ||
| c3 | ||
| i5 | Jin-yi Cai, Pinyan Lu: Bases Collapse in Holographic Algorithms. Electronic Colloquium on Computational Complexity (ECCC) 14(003) (2007) | |
| i4 | Jin-yi Cai, Pinyan Lu: On Block-wise Symmetric Signatures for Matchgates. Electronic Colloquium on Computational Complexity (ECCC) 14(019) (2007) | |
| i3 | Jin-yi Cai, Pinyan Lu: Holographic Algorithms: The Power of Dimensionality Resolved. Electronic Colloquium on Computational Complexity (ECCC) 14(020) (2007) | |
| 2006 | ||
| c2 | ||
| i2 | Jin-yi Cai, Pinyan Lu: On Symmetric Signatures in Holographic Algorithms. Electronic Colloquium on Computational Complexity (ECCC) 13(135) (2006) | |
| i1 | Jin-yi Cai, Pinyan Lu: Holographic Algorithms: From Art to Science. Electronic Colloquium on Computational Complexity (ECCC) 13(145) (2006) | |
| 2005 | ||
| c1 | Pinyan Lu, Jialin Zhang, Chung Keung Poon, Jin-yi Cai: Simulating Undirected st-Connectivity Algorithms on Uniform JAGs and NNJAGs. ISAAC 2005: 767-776 | |
Colors in the list of coauthors
Last update Mon May 20 09:07:29 2013 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page