Matrix Completion from $O(n)$ Samples in Linear Time. - David Gamarnik; Quan Li 001; Hongyi Zhang (COLT, 2017)

On the max-cut of sparse random graphs. - David Gamarnik; Quan Li 001 (Random Struct. Algorithms, 2018)

Algorithms and algorithmic obstacles for probabilistic combinatorial structures. - Quan Li 001 (2018)