| 2025 | STOC | How Random CSPs Fool Hierarchies: II. | Siu On Chan, Hiu Tsun Ng |
| 2024 | STOC | How Random CSPs Fool Hierarchies. | Siu On Chan, Hiu Tsun Ng, Sijin Peng |
| 2021 | ALT | Learning and Testing Irreducible Markov Chains via the k-Cover Time. | Siu On Chan, Qinghua Ding, Sing Hei Li |
| 2020 | ICLR | The Gambler's Problem and Beyond. | Baoxiang Wang, Shuai Li, Jiajin Li, Siu On Chan |
| 2017 | SODA | Random Walks and Evolving Sets: Faster Convergences and Limitations. | Siu On Chan, Tsz Chiu Kwok, Lap Chi Lau |
| 2016 | COLT | On the Approximability of Sparse PCA. | Siu On Chan, Dimitris Papailliopoulos, Aviad Rubinstein |
| 2015 | STOC | Sum of Squares Lower Bounds from Pairwise Independence. | Boaz Barak, Siu On Chan, Pravesh K. Kothari |
| 2014 | SODA | Optimal Algorithms for Testing Closeness of Discrete Distributions. | Siu On Chan, Ilias Diakonikolas, Paul Valiant, Gregory Valiant |
| 2014 | STOC | Efficient density estimation via piecewise polynomial approximation. | Siu On Chan, Ilias Diakonikolas, Rocco A. Servedio, Xiaorui Sun |
| 2013 | FOCS | Approximate Constraint Satisfaction Requires Large LP Relaxations. | Siu On Chan, James R. Lee, Prasad Raghavendra, David Steurer |
| 2013 | SODA | Learning mixtures of structured distributions over discrete domains. | Siu On Chan, Ilias Diakonikolas, Rocco A. Servedio, Xiaorui Sun |
| 2013 | STOC | Approximation resistance from pairwise independent subgroups. | Siu On Chan |
| 2008 | FOCS | A Dichotomy Theorem for the Resolution Complexity of Random Constraint Satisfaction Problems. | Siu On Chan, Michael Molloy |