2 citations · 6 across the 6 of their papers we have counts for
6 papers
Moser-Tardos Algorithm: Beyond Shearer's Bound
Kun He, Qian Li, Xiaoming Sun
In a seminal paper (Moser and Tardos, JACM'10), Moser and Tardos developed a simple and powerful algorithm to find solutions to combinatorial problems in the variable Lov{á}sz Loca…
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…
Efficient Delivery Policy to Minimize User Traffic Consumption in Guaranteed Advertising
Jia Zhang, Zheng Wang, Qian Li +4
In this work, we study the guaranteed delivery model which is widely used in online display advertising. In the guaranteed delivery scenario, ad exposures (which are also called im…
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…
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…
On the Sensitivity Complexity of -Uniform Hypergraph Properties
Qian Li, Xiaoming Sun
In this paper we investigate the sensitivity complexity of hypergraph properties. We present a -uniform hypergraph property with sensitivity complexity …