default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSiu On Chan
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c15]Siu On Chan
, Hiu Tsun Ng, Sijin Peng:
How Random CSPs Fool Hierarchies. STOC 2024: 1944-1955- [i13]Siu On Chan, Hiu Tsun Ng, Sijin Peng:
How Random CSPs Fool Hierarchies. Electron. Colloquium Comput. Complex. TR24 (2024) - 2022
- [i12]Wei Li, Ruxuan Li, Yuzhe Ma, Siu On Chan, David Z. Pan, Bei Yu:
Rethinking Graph Neural Networks for the Graph Coloring Problem. CoRR abs/2208.06975 (2022) - 2021
- [c14]Siu On Chan, Qinghua Ding, Sing Hei Li:
Learning and Testing Irreducible Markov Chains via the k-Cover Time. ALT 2021: 458-480 - 2020
- [c13]Baoxiang Wang, Shuai Li, Jiajin Li, Siu On Chan:
The Gambler's Problem and Beyond. ICLR 2020 - [i11]Baoxiang Wang, Shuai Li, Jiajin Li, Siu On Chan:
The Gambler's Problem and Beyond. CoRR abs/2001.00102 (2020)
2010 – 2019
- 2017
- [c12]Siu On Chan, Tsz Chiu Kwok, Lap Chi Lau:
Random Walks and Evolving Sets: Faster Convergences and Limitations. SODA 2017: 1849-1865 - 2016
- [j5]Siu On Chan:
Approximation Resistance from Pairwise-Independent Subgroups. J. ACM 63(3): 27:1-27:32 (2016) - [j4]Siu On Chan, James R. Lee, Prasad Raghavendra, David Steurer:
Approximate Constraint Satisfaction Requires Large LP Relaxations. J. ACM 63(4): 34:1-34:22 (2016) - [c11]Siu On Chan, Dimitris Papailliopoulos, Aviad Rubinstein:
On the Approximability of Sparse PCA. COLT 2016: 623-646 - 2015
- [c10]Boaz Barak, Siu On Chan, Pravesh K. Kothari:
Sum of Squares Lower Bounds from Pairwise Independence. STOC 2015: 97-106 - [i10]Boaz Barak, Siu On Chan, Pravesh Kothari:
Sum of Squares Lower Bounds from Pairwise Independence. CoRR abs/1501.00734 (2015) - [i9]Siu On Chan, Tsz Chiu Kwok, Lap Chi Lau:
Random Walks and Evolving Sets: Faster Convergences and Limitations. CoRR abs/1507.02069 (2015) - [i8]Siu On Chan, Dimitris S. Papailiopoulos, Aviad Rubinstein:
On the Worst-Case Approximability of Sparse PCA. CoRR abs/1507.05950 (2015) - 2014
- [j3]Siu On Chan, Elchanan Mossel, Joe Neeman:
On Extracting Common Random Bits From Correlated Sources on Large Alphabets. IEEE Trans. Inf. Theory 60(3): 1630-1637 (2014) - [c9]Siu On Chan, Ilias Diakonikolas, Rocco A. Servedio, Xiaorui Sun:
Near-Optimal Density Estimation in Near-Linear Time Using Variable-Width Histograms. NIPS 2014: 1844-1852 - [c8]Siu On Chan, Ilias Diakonikolas, Paul Valiant, Gregory Valiant:
Optimal Algorithms for Testing Closeness of Discrete Distributions. SODA 2014: 1193-1203 - [c7]Siu On Chan, Ilias Diakonikolas, Rocco A. Servedio, Xiaorui Sun:
Efficient density estimation via piecewise polynomial approximation. STOC 2014: 604-613 - [i7]Siu On Chan, Ilias Diakonikolas, Rocco A. Servedio, Xiaorui Sun:
Near-Optimal Density Estimation in Near-Linear Time Using Variable-Width Histograms. CoRR abs/1411.0169 (2014) - 2013
- [b1]Siu On Chan:
Hardness of Maximum Constraint Satisfaction. University of California, Berkeley, USA, 2013 - [j2]Siu On Chan, Michael Molloy:
A Dichotomy Theorem for the Resolution Complexity of Random Constraint Satisfaction Problems. SIAM J. Comput. 42(1): 27-60 (2013) - [c6]Siu On Chan, James R. Lee, Prasad Raghavendra, David Steurer:
Approximate Constraint Satisfaction Requires Large LP Relaxations. FOCS 2013: 350-359 - [c5]Siu On Chan, Ilias Diakonikolas, Rocco A. Servedio, Xiaorui Sun:
Learning mixtures of structured distributions over discrete domains. SODA 2013: 1380-1394 - [c4]Siu On Chan:
Approximation resistance from pairwise independent subgroups. STOC 2013: 447-456 - [i6]Siu On Chan, Ilias Diakonikolas, Rocco A. Servedio, Xiaorui Sun:
Efficient Density Estimation via Piecewise Polynomial Approximation. CoRR abs/1305.3207 (2013) - [i5]Siu On Chan, Ilias Diakonikolas, Gregory Valiant, Paul Valiant:
Optimal Algorithms for Testing Closeness of Discrete Distributions. CoRR abs/1308.3946 (2013) - [i4]Siu On Chan, James R. Lee, Prasad Raghavendra, David Steurer:
Approximate Constraint Satisfaction Requires Large LP Relaxations. CoRR abs/1309.0563 (2013) - 2012
- [j1]Siu On Chan, Michael Molloy:
(k+1)-Cores Have k-Factors. Comb. Probab. Comput. 21(6): 882-896 (2012) - [i3]Siu On Chan, Elchanan Mossel, Joe Neeman:
On extracting common random bits from correlated sources on large alphabets. CoRR abs/1208.5946 (2012) - [i2]Siu On Chan, Ilias Diakonikolas, Rocco A. Servedio, Xiaorui Sun:
Learning mixtures of structured distributions over discrete domains. CoRR abs/1210.0864 (2012) - [i1]Siu On Chan:
Approximation Resistance from Pairwise Independent Subgroups. Electron. Colloquium Comput. Complex. TR12 (2012) - 2011
- [c3]Siavosh Benabbas, Siu On Chan, Konstantinos Georgiou, Avner Magen:
Tight Gaps for Vertex Cover in the Sherali-Adams SDP Hierarchy. FSTTCS 2011: 41-54
2000 – 2009
- 2008
- [c2]Siu On Chan, Michael Molloy:
A Dichotomy Theorem for the Resolution Complexity of Random Constraint Satisfaction Problems. FOCS 2008: 634-643 - 2006
- [c1]Leizhen Cai, Siu Man Chan, Siu On Chan:
Random Separation: A New Method for Solving Fixed-Cardinality Optimization Problems. IWPEC 2006: 239-250
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-10 01:25 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
