Siu On Chan

From MaRDI portal
(Redirected from Person:737175)



List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

PublicationDate of PublicationType
Optimal algorithms for testing closeness of discrete distributions
Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms
2019-06-20Paper
Optimal algorithms for testing closeness of discrete distributions
Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms
2019-06-20Paper
Learning mixtures of structured distributions over discrete domains
Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms
2019-05-15Paper
Approximate Constraint Satisfaction Requires Large LP Relaxations
Journal of the ACM
2018-08-02Paper
Approximation Resistance from Pairwise-Independent Subgroups
Journal of the ACM
2018-08-02Paper
Random Walks and Evolving Sets: Faster Convergences and Limitations
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms
2018-07-16Paper
On Extracting Common Random Bits From Correlated Sources on Large Alphabets
IEEE Transactions on Information Theory
2017-05-16Paper
Convergence, unanimity and disagreement in majority dynamics on unimodular graphs and random graphs
Stochastic Processes and their Applications
2016-08-08Paper
Sum of squares lower bounds from pairwise independence (extended abstract)
Proceedings of the forty-seventh annual ACM symposium on Theory of Computing
2015-08-21Paper
Efficient density estimation via piecewise polynomial approximation
Proceedings of the forty-sixth annual ACM symposium on Theory of computing
2015-06-26Paper
Approximation resistance from pairwise independent subgroups
Proceedings of the forty-eighth annual ACM symposium on Theory of Computing
2014-08-07Paper
A dichotomy theorem for the resolution complexity of random constraint satisfaction problems
SIAM Journal on Computing
2013-07-04Paper
Tight gaps for vertex cover in the Sherali-Adams SDP hierarchy2012-08-31Paper
Random Separation: A New Method for Solving Fixed-Cardinality Optimization Problems
Parameterized and Exact Computation
2008-06-03Paper


Research outcomes over time


This page was built for person: Siu On Chan