◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

Qian Li

6 papers hereh-index 571 citations11 works total

Matching runs newest-first, so older work may not be attached to this profile yet.

author position
  • first author2
  • middle author4

Across the 6 of 6 papers where every author was matched, so the position is known.

fields
  • cs.CC4
  • cs.DS2
same name
  • Qian Li — 15 papers, h 13
  • Qian Li — 14 papers, h 18
  • Qian Li — 12 papers, h 10
  • Qian Li — 12 papers, h 3
  • Qian Li — 10 papers, h 2
  • Qian Li — 9 papers, h 7

Either other researchers who publish under this name, or the same person where the external sources have not merged their records.

identity via Semantic Scholar / OpenAlex

activity
20162021
most citedEfficient Delivery Policy to Minimize User Traffic Consumption in Guaranteed Advertising

2 citations · 6 across the 6 of their papers we have counts for

collaborators
Showing cs.CCShow all

4 papers · 1 filter

cs.CC2018★ 1 cited

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

Kun He, Qian Li, Xiaoming Sun +1

The Lovász Local Lemma (LLL) is a very powerful tool in combinatorics and probability theory to show the possibility of avoiding all bad events under some weakly dependent conditio…

cs.CC2016

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

Qian Li, Xiaoming Sun, Jialin Zhang

The problem of merging sorted lists in the least number of pairwise comparisons has been solved completely only for a few special cases. Graham and Karp \cite{taocp} independently…

cs.CC2016★ 1 cited

A Tighter Relation between Sensitivity and Certificate Complexity

Kun He, Qian Li, Xiaoming Sun

The sensitivity conjecture which claims that the sensitivity complexity is polynomially related to block sensitivity complexity, is one of the most important and challenging proble…

cs.CC2016★ 1 cited

On the Sensitivity Complexity of k-Uniform Hypergraph Properties

Qian Li, Xiaoming Sun

In this paper we investigate the sensitivity complexity of hypergraph properties. We present a k-uniform hypergraph property with sensitivity complexity O(n⌈k/3⌉)…

◍wovepaper

Papers, researchers and institutions, woven together.

Explore
  • Search
  • Researchers
  • Institutions
Account
  • Library
  • Chat
Data
  • arXiv.org
  • Semantic Scholar
  • OpenAlex
  • Latest RSS
AboutContactPrivacyDevelopersllms.txtopenapi.json
Not affiliated with arXiv. Researcher data from Semantic Scholar (ODC-BY) and OpenAlex.