| Learning plackett-luce mixtures from partial preferences A Liu, Z Zhao, C Liao, P Lu, L Xia Proceedings of the AAAI Conference on Artificial Intelligence 33 (01), 4328-4335, 2019 | 21 | 2019 |
| Counting independent sets and colorings on random regular bipartite graphs C Liao, J Lin, P Lu, Z Mao arXiv preprint arXiv:1903.07531, 2019 | 19 | 2019 |
| Zeros of Holant problems: locations and algorithms H Guo, C Liao, P Lu, C Zhang ACM Transactions on Algorithms (TALG) 17 (1), 1-25, 2020 | 16 | 2020 |
| Counting hypergraph colorings in the local lemma regime H Guo, C Liao, P Lu, C Zhang SIAM Journal on Computing 48 (4), 1397-1424, 2019 | 12 | 2019 |
| Almost Tight Approximation Hardness for Single-Source Directed k-Edge-Connectivity C Liao, Q Chen, B Laekhanukit, Y Zhang arXiv preprint arXiv:2202.13088, 2022 | 1 | 2022 |
| The beachcombers’ problem: Walking and searching from an inner point of a line Y Chen, X Deng, Z Ji, C Liao Language and Automata Theory and Applications, 270-282, 2016 | 1 | 2016 |
| Survivable Network Design Revisited: Group-Connectivity Q Chen, B Laekhanukit, C Liao, Y Zhang arXiv preprint arXiv:2204.13648, 2022 | | 2022 |
Pinyan LuITCS, Shanghai University of Finance and EconomicsVerified email at mail.shufe.edu.cn
