Siu On Chan

According to our database1, Siu On Chan authored at least 19 papers between 2006 and 2022.

Collaborative distances:
  • Dijkstra number2 of three.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2022
Rethinking Graph Neural Networks for the Graph Coloring Problem.
CoRR, 2022

2021
Learning and Testing Irreducible Markov Chains via the k-Cover Time.
Proceedings of the Algorithmic Learning Theory, 2021

2020
The Gambler's Problem and Beyond.
Proceedings of the 8th International Conference on Learning Representations, 2020

2017
Random Walks and Evolving Sets: Faster Convergences and Limitations.
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 2017

2016
Approximate Constraint Satisfaction Requires Large LP Relaxations.
J. ACM, 2016

Approximation Resistance from Pairwise-Independent Subgroups.
J. ACM, 2016

On the Approximability of Sparse PCA.
Proceedings of the 29th Conference on Learning Theory, 2016

2015
On the Worst-Case Approximability of Sparse PCA.
CoRR, 2015

Sum of Squares Lower Bounds from Pairwise Independence.
Proceedings of the Forty-Seventh Annual ACM on Symposium on Theory of Computing, 2015

2014
On Extracting Common Random Bits From Correlated Sources on Large Alphabets.
IEEE Trans. Inf. Theory, 2014

Efficient density estimation via piecewise polynomial approximation.
Proceedings of the Symposium on Theory of Computing, 2014

Optimal Algorithms for Testing Closeness of Discrete Distributions.
Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms, 2014

Near-Optimal Density Estimation in Near-Linear Time Using Variable-Width Histograms.
Proceedings of the Advances in Neural Information Processing Systems 27: Annual Conference on Neural Information Processing Systems 2014, 2014

2013
Hardness of Maximum Constraint Satisfaction.
PhD thesis, 2013

A Dichotomy Theorem for the Resolution Complexity of Random Constraint Satisfaction Problems.
SIAM J. Comput., 2013

Learning mixtures of structured distributions over discrete domains.
Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms, 2013

2012
(<i>k</i>+1)-Cores Have <i>k</i>-Factors.
Comb. Probab. Comput., 2012

2011
Tight Gaps for Vertex Cover in the Sherali-Adams SDP Hierarchy.
Proceedings of the IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2011

2006
Random Separation: A New Method for Solving Fixed-Cardinality Optimization Problems.
Proceedings of the Parameterized and Exact Computation, Second International Workshop, 2006


  Loading...