Qian Li

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 13 papers between 2016 and 2023.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

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

2022
New Distinguishers for Negation-Limited Weak Pseudorandom Functions.
CoRR, 2022

2021
On the Sensitivity Complexity of <i>k</i>-Uniform Hypergraph Properties.
ACM Trans. Comput. Theory, 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
On the modulo degree complexity of Boolean functions.
Theor. Comput. Sci., 2020

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

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

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

2019
A tighter relation between sensitivity complexity and certificate complexity.
Theor. Comput. Sci., 2019

2018
Quantum Lovász Local Lemma: Shearer's Bound is Tight.
Electron. Colloquium Comput. Complex., 2018

2017
On the Sensitivity Complexity of k-Uniform Hypergraph Properties.
Proceedings of the 34th Symposium on Theoretical Aspects of Computer Science, 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


  Loading...