| Optimal algorithms for testing closeness of discrete distributions SO Chan, I Diakonikolas, P Valiant, G Valiant Proceedings of the twenty-fifth annual ACM-SIAM symposium on Discrete …, 2014 | 240 | 2014 |
| Approximation resistance from pairwise-independent subgroups SO Chan Journal of the ACM (JACM) 63 (3), 1-32, 2016 | 151 | 2016 |
| Approximate constraint satisfaction requires large LP relaxations SO Chan, JR Lee, P Raghavendra, D Steurer Journal of the ACM (JACM) 63 (4), 1-22, 2016 | 148 | 2016 |
| Random separation: A new method for solving fixed-cardinality optimization problems L Cai, SM Chan, SO Chan Parameterized and Exact Computation: Second International Workshop, IWPEC …, 2006 | 129 | 2006 |
| Efficient density estimation via piecewise polynomial approximation SO Chan, I Diakonikolas, RA Servedio, X Sun Proceedings of the forty-sixth annual ACM symposium on Theory of computing …, 2014 | 128 | 2014 |
| Learning mixtures of structured distributions over discrete domains SO Chan, I Diakonikolas, X Sun, RA Servedio Proceedings of the twenty-fourth annual ACM-SIAM symposium on Discrete …, 2013 | 85 | 2013 |
| Near-optimal density estimation in near-linear time using variable-width histograms SO Chan, I Diakonikolas, RA Servedio, X Sun Advances in neural information processing systems 27, 2014 | 58 | 2014 |
| Quantifying unobserved protein-coding variants in human populations provides a roadmap for large-scale sequencing projects J Zou, G Valiant, P Valiant, K Karczewski, SO Chan, K Samocha, M Lek, ... Nature communications 7 (1), 13293, 2016 | 51 | 2016 |
| Sum of squares lower bounds from pairwise independence B Barak, SO Chan, PK Kothari Proceedings of the forty-seventh annual ACM symposium on Theory of computing …, 2015 | 46 | 2015 |
| On the approximability of sparse PCA SO Chan, D Papailliopoulos, A Rubinstein Conference on Learning Theory, 623-646, 2016 | 32 | 2016 |
| Monkol Lek, Shamil Sunyaev, Mark Daly, and Daniel G. MacArthur. Quantifying unobserved protein-coding variants in human populations provides a roadmap for large-scale … J Zou, G Valiant, P Valiant, K Karczewski, SO Chan, K Samocha Nature communications 7, 13293, 2016 | 26 | 2016 |
| On extracting common random bits from correlated sources on large alphabets SO Chan, E Mossel, J Neeman IEEE transactions on information theory 60 (3), 1630-1637, 2014 | 21 | 2014 |
| Learning and Testing Irreducible Markov Chains via the -Cover Time SO Chan, Q Ding, SH Li Algorithmic Learning Theory, 458-480, 2021 | 13 | 2021 |
| Tight gaps for vertex cover in the Sherali-Adams SDP hierarchy S Benabbas, SO Chan, K Georgiou, A Magen IARCS Annual Conference on Foundations of Software Technology and …, 2011 | 8 | 2011 |
| On the worst-case approximability of sparse PCA SO Chan, D Papailiopoulos, A Rubinstein arXiv preprint arXiv:1507.05950, 2015 | 6 | 2015 |
| (k+ 1)-cores have k-factors SO Chan, M Molloy Combinatorics, Probability and Computing 21 (6), 882-896, 2012 | 5 | 2012 |
| Random walks and evolving sets: Faster convergences and limitations SO Chan, TC Kwok, LC Lau Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete …, 2017 | 3 | 2017 |
| A dichotomy theorem for the resolution complexity of random constraint satisfaction problems SO Chan, M Molloy 2008 49th Annual IEEE Symposium on Foundations of Computer Science, 634-643, 2008 | 3 | 2008 |
| A dichotomy theorem for the resolution complexity of random constraint satisfaction problems SO Chan, M Molloy SIAM Journal on Computing 42 (1), 27-60, 2013 | 2 | 2013 |
| Nondeterministic Finite Automata SO CHAN | | 2022 |
