Qian Li

Orcid: 0000-0002-2047-8146

Affiliations:

Shenzhen University, Guangdong Province Key Laboratory of Popular High Performance Computers, Shenzhen, China
Chinese Academy of Sciences, Institute of Computing Technology, Beijing, China
University of Chinese Academy of Sciences, Beijing, China

According to our database¹, Qian Li authored at least 21 papers between 2016 and 2025.

Collaborative distances:

Dijkstra number² of four.
Erdős number³ of three.

Timeline

Legend:

Book

In proceedings

Article

PhD thesis

Dataset

Other

Bibliography

2025

Cryptomania v.s. Minicrypt in a Quantum World.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2025

Toward the Impossibility of Perfect Complete Quantum PKE from OWFs.

[BibT_eX]

[DOI]

Proceedings of the 16th Innovations in Theoretical Computer Science Conference, 2025

2024

New Distinguishers for Negation-Limited Weak Pseudorandom Functions.

[BibT_eX]

[DOI]

Theory Comput., 2024

Real-time seedless post-processing for quantum random number generators.

[BibT_eX]

[DOI]

Qian Li

Hongyi Zhou

IET Quantum Commun., 2024

How (not) to Build Quantum PKE in Minicrypt.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2024

A New Information Complexity Measure for Multi-pass Streaming with Applications.

[BibT_eX]

[DOI]

Proceedings of the 56th Annual ACM Symposium on Theory of Computing, 2024

2023

A practical multi-objective auction design and optimization framework for sponsored search.

[BibT_eX]

[DOI]

Oper. Res. Lett., November, 2023

Moser-Tardos Algorithm: Beyond Shearer's Bound.

[BibT_eX]

[DOI]

Kun He

Qian Li

Xiaoming Sun

Proceedings of the 2023 ACM-SIAM Symposium on Discrete Algorithms, 2023

Optimal Synthesis of Multi-Controlled Qudit Gates.

[BibT_eX]

[DOI]

Wei Zi

Qian Li

Xiaoming Sun

Proceedings of the 60th ACM/IEEE Design Automation Conference, 2023

2021

On the Sensitivity Complexity of <i>k</i>-Uniform Hypergraph Properties.

[BibT_eX]

[DOI]

Qian Li

Xiaoming Sun

ACM Trans. Comput. Theory, 2021

Streaming Algorithms for Graph k-Matching with Optimal or Near-Optimal Update Time.

[BibT_eX]

[DOI]

Proceedings of the 32nd International Symposium on Algorithms and Computation, 2021

2020

On the modulo degree complexity of Boolean functions.

[BibT_eX]

[DOI]

Qian Li

Xiaoming Sun

Theor. Comput. Sci., 2020

Unifying Presampling via Concentration Bounds.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2020

Graph algorithms: parallelization and scalability.

[BibT_eX]

[DOI]

Sci. China Inf. Sci., 2020

On the Optimality of Tape Merge of Two Lists with Similar Size.

[BibT_eX]

[DOI]

Qian Li

Xiaoming Sun

Jialin Zhang

Algorithmica, 2020

Approximate Single-Peakedness in Large Elections.

[BibT_eX]

[DOI]

Proceedings of the 2020 IEEE International Conference on Knowledge Graph, 2020

2019

A tighter relation between sensitivity complexity and certificate complexity.

[BibT_eX]

[DOI]

Kun He

Qian Li

Xiaoming Sun

Theor. Comput. Sci., 2019

2018

Quantum Lovász Local Lemma: Shearer's Bound is Tight.

[BibT_eX]

[DOI]

Electron. Colloquium Comput. Complex., 2018

2017

On the Sensitivity Complexity of k-Uniform Hypergraph Properties.

[BibT_eX]

[DOI]

Qian Li

Xiaoming Sun

Proceedings of the 34th Symposium on Theoretical Aspects of Computer Science, 2017

Efficient Delivery Policy to Minimize User Traffic Consumption in Guaranteed Advertising.

[BibT_eX]

[DOI]

Proceedings of the Thirty-First AAAI Conference on Artificial Intelligence, 2017

2016

A Tighter Relation between Sensitivity and Certificate Complexity.

[BibT_eX]

[DOI]

Kun He

Qian Li

Xiaoming Sun

CoRR, 2016

Qian Li

Timeline

Legend:

Links

Online presence:

On csauthors.net:

Bibliography

Loading...