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 database1, Qian Li authored at least 21 papers between 2016 and 2025.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2025
Cryptomania v.s. Minicrypt in a Quantum World.
IACR Cryptol. ePrint Arch., 2025

Toward the Impossibility of Perfect Complete Quantum PKE from OWFs.
Proceedings of the 16th Innovations in Theoretical Computer Science Conference, 2025

2024
New Distinguishers for Negation-Limited Weak Pseudorandom Functions.
Theory Comput., 2024

Real-time seedless post-processing for quantum random number generators.
IET Quantum Commun., 2024

A New Information Complexity Measure for Multi-pass Streaming with Applications.
Proceedings of the 56th Annual ACM Symposium on Theory of Computing, 2024

How (not) to Build Quantum PKE in Minicrypt.
Proceedings of the Advances in Cryptology - CRYPTO 2024, 2024

2023
A practical multi-objective auction design and optimization framework for sponsored search.
Oper. Res. Lett., November, 2023

Moser-Tardos Algorithm: Beyond Shearer's Bound.
Proceedings of the 2023 ACM-SIAM Symposium on Discrete Algorithms, 2023

Optimal Synthesis of Multi-Controlled Qudit Gates.
Proceedings of the 60th ACM/IEEE Design Automation Conference, 2023

2021
On the Sensitivity Complexity of <i>k</i>-Uniform Hypergraph Properties.
ACM Trans. Comput. Theory, 2021

Unifying Presampling via Concentration Bounds.
Proceedings of the Theory of Cryptography - 19th International Conference, 2021

Streaming Algorithms for Graph k-Matching with Optimal or Near-Optimal Update Time.
Proceedings of the 32nd International Symposium on Algorithms and Computation, 2021

2020
Graph algorithms: parallelization and scalability.
Sci. China Inf. Sci., 2020

Approximate Single-Peakedness in Large Elections.
Proceedings of the 2020 IEEE International Conference on Knowledge Graph, 2020

2019
Quantum Lovász local lemma: Shearer's bound is tight.
Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing, 2019

2017
On the Sensitivity Complexity of k-Uniform Hypergraph Properties.
Proceedings of the 34th Symposium on Theoretical Aspects of Computer Science, 2017

On the Modulo Degree Complexity of Boolean Functions.
Proceedings of the Computing and Combinatorics - 23rd International Conference, 2017

A Tighter Relation Between Sensitivity Complexity and Certificate Complexity.
Proceedings of the Computing and Combinatorics - 23rd International Conference, 2017

Efficient Delivery Policy to Minimize User Traffic Consumption in Guaranteed Advertising.
Proceedings of the Thirty-First AAAI Conference on Artificial Intelligence, 2017

2016
A Tighter Relation between Sensitivity and Certificate Complexity.
CoRR, 2016

On the Optimality of Tape Merge of Two Lists with Similar Size.
Proceedings of the 27th International Symposium on Algorithms and Computation, 2016


  Loading...