Qian Li

Publication Activity (10 Years)

Years Active: 2016-2023
Publications (10 Years): 20

Top Topics

Targeted Advertising

Quantum Inspired

Johnson Lindenstrauss

Functional Properties

Top Venues

Theor. Comput. Sci.

Publications

Kun He, Qian Li, Xiaoming Sun
Moser-Tardos Algorithm: Beyond Shearer's Bound. SODA (2023)
Zhihuai Chen, Siyao Guo, Qian Li, Chengyu Lin, Xiaoming Sun
New Distinguishers for Negation-Limited Weak Pseudorandom Functions. CoRR (2022)
Qian Li, Xiaoming Sun
-Uniform Hypergraph Properties. ACM Trans. Comput. Theory 13 (2) (2021)
Jianer Chen, Qin Huang, Iyad Kanj, Qian Li, Ge Xia
Streaming Algorithms for Graph k-Matching with Optimal or Near-Optimal Update Time. ISAAC (2021)
Qian Li, Xiaoming Sun, Jialin Zhang
On the Optimality of Tape Merge of Two Lists with Similar Size. Algorithmica 82 (7) (2020)
Qian Li, Xiaoming Sun
On the modulo degree complexity of Boolean functions. Theor. Comput. Sci. 818 (2020)
Zhihuai Chen, Qian Li, Xiaoming Sun, Lirong Xia, Jialin Zhang
Approximate Single-Peakedness in Large Elections. ICKG (2020)
Kun He, Qian Li, Xiaoming Sun
A tighter relation between sensitivity complexity and certificate complexity. Theor. Comput. Sci. 762 (2019)
Kun He, Qian Li, Xiaoming Sun, Jiapeng Zhang
Quantum Lovász local lemma: Shearer's bound is tight. STOC (2019)
Kun He, Qian Li, Xiaoming Sun, Jiapeng Zhang
Quantum Lovász Local Lemma: Shearer's Bound is Tight. CoRR (2018)
Kun He, Qian Li, Xiaoming Sun, Jiapeng Zhang
Quantum Lovász Local Lemma: Shearer's Bound is Tight. Electron. Colloquium Comput. Complex. 25 (2018)
Kun He, Qian Li, Xiaoming Sun
A Tighter Relation Between Sensitivity Complexity and Certificate Complexity. COCOON (2017)
Qian Li, Xiaoming Sun
On the Modulo Degree Complexity of Boolean Functions. COCOON (2017)
Qian Li, Xiaoming Sun
On the Sensitivity Complexity of k-Uniform Hypergraph Properties. STACS (2017)
Jia Zhang, Zheng Wang, Qian Li, Jialin Zhang, Yanyan Lan, Qiang Li, Xiaoming Sun
Efficient Delivery Policy to Minimize User Traffic Consumption in Guaranteed Advertising. AAAI (2017)
Kun He, Qian Li, Xiaoming Sun
A Tighter Relation between Sensitivity and Certificate Complexity. CoRR (2016)
Qian Li, Xiaoming Sun, Jialin Zhang
On the Optimality of Tape Merge of Two Lists with Similar Size. ISAAC (2016)
Qian Li, Xiaoming Sun
On the Sensitivity Complexity of $k$-Uniform Hypergraph Properties. CoRR (2016)
Jia Zhang, Zheng Wang, Qian Li, Jialin Zhang, Yanyan Lan, Qiang Li, Xiaoming Sun
Efficient Delivery Policy to Minimize User Traffic Consumption in Guaranteed Advertising. CoRR (2016)
Qian Li, Xiaoming Sun, Jialin Zhang
On the Optimality of Tape Merge of Two Lists with Similar Size. CoRR (2016)