A Tighter Relation between Sensitivity and Certificate Complexity. - Kun He 011; Qian Li 012; Xiaoming Sun 001 (CoRR, 2016)

Efficient Delivery Policy to Minimize User Traffic Consumption in Guaranteed Advertising. - Jia Zhang 004; Zheng Wang; Qian Li 012; Jialin Zhang 001; Yanyan Lan; Qiang Li 043; Xiaoming Sun 001 (AAAI, 2017)

On the Sensitivity Complexity of k-Uniform Hypergraph Properties. - Qian Li 012; Xiaoming Sun 001 (STACS, 2017)

Quantum Lovász Local Lemma: Shearer's Bound is Tight. - Kun He 011; Qian Li 012; Xiaoming Sun 001; Jiapeng Zhang (Electron. Colloquium Comput. Complex., 2018)

A tighter relation between sensitivity complexity and certificate complexity. - Kun He 011; Qian Li 012; Xiaoming Sun 001 (Theor. Comput. Sci., 2019)

Approximate Single-Peakedness in Large Elections. - Zhihuai Chen; Qian Li 012; Xiaoming Sun 001; Lirong Xia; Jialin Zhang 001 (ICKG, 2020)

On the Optimality of Tape Merge of Two Lists with Similar Size. - Qian Li 012; Xiaoming Sun 001; Jialin Zhang 001 (Algorithmica, 2020)

Graph algorithms: parallelization and scalability. - Wenfei Fan; Kun He 011; Qian Li 012; Yue Wang (Sci. China Inf. Sci., 2020)

Unifying Presampling via Concentration Bounds. - Siyao Guo; Qian Li 012; Qipeng Liu 001; Jiapeng Zhang (IACR Cryptol. ePrint Arch., 2020)

On the modulo degree complexity of Boolean functions. - Qian Li 012; Xiaoming Sun 001 (Theor. Comput. Sci., 2020)

Streaming Algorithms for Graph k-Matching with Optimal or Near-Optimal Update Time. - Jianer Chen; Qin Huang; Iyad Kanj; Qian Li 012; Ge Xia (ISAAC, 2021)

On the Sensitivity Complexity of k-Uniform Hypergraph Properties. - Qian Li 012; Xiaoming Sun 001 (ACM Trans. Comput. Theory, 2021)

Optimal Synthesis of Multi-Controlled Qudit Gates. - Wei Zi; Qian Li 012; Xiaoming Sun 001 (DAC, 2023)

Moser-Tardos Algorithm: Beyond Shearer's Bound. - Kun He 011; Qian Li 012; Xiaoming Sun 001 (SODA, 2023)

A practical multi-objective auction design and optimization framework for sponsored search. - Qian Li 012; Liang Wang; Lirong Xia; Wenxun Zheng; Yuxuan Zhou (Oper. Res. Lett., 2023)

A New Information Complexity Measure for Multi-pass Streaming with Applications. - Mark Braverman; Sumegha Garg; Qian Li 012; Shuo Wang; David P. Woodruff; Jiapeng Zhang (STOC, 2024)

How (not) to Build Quantum PKE in Minicrypt. - Longcheng Li; Qian Li 012; Xingjian Li 006; Qipeng Liu 001 (IACR Cryptol. ePrint Arch., 2024)

Real-time seedless post-processing for quantum random number generators. - Qian Li 012; Hongyi Zhou (IET Quantum Commun., 2024)

New Distinguishers for Negation-Limited Weak Pseudorandom Functions. - Zhihuai Chen; Siyao Guo; Qian Li 012; Chengyu Lin 001; Xiaoming Sun 001 (Theory Comput., 2024)

Toward the Impossibility of Perfect Complete Quantum PKE from OWFs. - Longcheng Li; Qian Li 012; Xingjian Li 006; Qipeng Liu 001 (ITCS, 2025)

Cryptomania v.s. Minicrypt in a Quantum World. - Longcheng Li; Qian Li 012; Xingjian Li 006; Qipeng Liu 001 (IACR Cryptol. ePrint Arch., 2025)