Random Separation: A New Method for Solving Fixed-Cardinality Optimization Problems. - Leizhen Cai; Siu Man Chan; Siu On Chan (IWPEC, 2006)

Tight Gaps for Vertex Cover in the Sherali-Adams SDP Hierarchy. - Siavosh Benabbas; Siu On Chan; Konstantinos Georgiou; Avner Magen (FSTTCS, 2011)

(k+1)-Cores Have k-Factors. - Siu On Chan; Michael Molloy 001 (Comb. Probab. Comput., 2012)

Approximation Resistance from Pairwise Independent Subgroups. - Siu On Chan (Electron. Colloquium Comput. Complex., 2012)

Learning mixtures of structured distributions over discrete domains. - Siu On Chan; Ilias Diakonikolas; Rocco A. Servedio; Xiaorui Sun (SODA, 2013)

A Dichotomy Theorem for the Resolution Complexity of Random Constraint Satisfaction Problems. - Siu On Chan; Michael Molloy 001 (SIAM J. Comput., 2013)

Hardness of Maximum Constraint Satisfaction. - Siu On Chan (2013)

Near-Optimal Density Estimation in Near-Linear Time Using Variable-Width Histograms. - Siu On Chan; Ilias Diakonikolas; Rocco A. Servedio; Xiaorui Sun (NIPS, 2014)

Optimal Algorithms for Testing Closeness of Discrete Distributions. - Siu On Chan; Ilias Diakonikolas; Paul Valiant; Gregory Valiant (SODA, 2014)

Efficient density estimation via piecewise polynomial approximation. - Siu On Chan; Ilias Diakonikolas; Rocco A. Servedio; Xiaorui Sun (STOC, 2014)

On Extracting Common Random Bits From Correlated Sources on Large Alphabets. - Siu On Chan; Elchanan Mossel; Joe Neeman (IEEE Trans. Inf. Theory, 2014)

Sum of Squares Lower Bounds from Pairwise Independence. - Boaz Barak; Siu On Chan; Pravesh K. Kothari (STOC, 2015)

On the Worst-Case Approximability of Sparse PCA. - Siu On Chan; Dimitris S. Papailiopoulos; Aviad Rubinstein (CoRR, 2015)

On the Approximability of Sparse PCA. - Siu On Chan; Dimitris Papailliopoulos; Aviad Rubinstein (COLT, 2016)

Approximate Constraint Satisfaction Requires Large LP Relaxations. - Siu On Chan; James R. Lee; Prasad Raghavendra; David Steurer (J. ACM, 2016)

Random Walks and Evolving Sets: Faster Convergences and Limitations. - Siu On Chan; Tsz Chiu Kwok; Lap Chi Lau (SODA, 2017)

The Gambler's Problem and Beyond. - Baoxiang Wang 001; Shuai Li 010; Jiajin Li; Siu On Chan (ICLR, 2020)

Learning and Testing Irreducible Markov Chains via the k-Cover Time. - Siu On Chan; Qinghua Ding; Sing Hei Li (ALT, 2021)

Rethinking Graph Neural Networks for the Graph Coloring Problem. - Wei Li 159; Ruxuan Li; Yuzhe Ma; Siu On Chan; David Z. Pan; Bei Yu 001 (CoRR, 2022)

How Random CSPs Fool Hierarchies. - Siu On Chan; Hiu Tsun Ng; Sijin Peng (Electron. Colloquium Comput. Complex., 2024)

How Random CSPs Fool Hierarchies: II. - Siu On Chan; Hiu Tsun Ng (Electron. Colloquium Comput. Complex., 2025)