Siu On Chan

421 total citations
13 papers, 117 citations indexed

About

Siu On Chan is a scholar working on Computational Theory and Mathematics, Computer Networks and Communications and Numerical Analysis. According to data from OpenAlex, Siu On Chan has authored 13 papers receiving a total of 117 indexed citations (citations by other indexed papers that have themselves been cited), including 9 papers in Computational Theory and Mathematics, 4 papers in Computer Networks and Communications and 3 papers in Numerical Analysis. Recurrent topics in Siu On Chan's work include Advanced Graph Theory Research (8 papers), Complexity and Algorithms in Graphs (7 papers) and Optimization and Search Problems (2 papers). Siu On Chan is often cited by papers focused on Advanced Graph Theory Research (8 papers), Complexity and Algorithms in Graphs (7 papers) and Optimization and Search Problems (2 papers). Siu On Chan collaborates with scholars based in United States, Canada and Hong Kong. Siu On Chan's co-authors include Michael Molloy, Boaz Barak, James R. Lee, David Steurer, Prasad Raghavendra, Pravesh K. Kothari, Monkol Lek, Kaitlin E. Samocha, James Zou and Gregory Valiant and has published in prestigious journals such as Nature Communications, IEEE Transactions on Information Theory and Journal of the ACM.

In The Last Decade

Siu On Chan

12 papers receiving 106 citations

Peers

Siu On Chan

CTM

AI

CNC

GENET

MB

Toshiki Saitoh Japan

Michael Dom Germany

Florian Sikora France

Till Tantau Germany

Boting Yang Canada

Mary Cryan United Kingdom

Rudi Pendavingh Netherlands

Felix Reidl Germany

Pål Grønås Drange Norway

Barnaby Martin United Kingdom

Toshiki Saitoh Japan

Siu On Chan

80 ×1.1

CTM

48 ×1.5

AI

40 ×1.6

CNC

11 ×0.7

GENET

16 ×1.3

MB

Citations per year, relative to Siu On Chan Siu On Chan (= 1×) peers Toshiki Saitoh

Countries citing papers authored by Siu On Chan

Since Specialization

Citations

This map shows the geographic impact of Siu On Chan's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Siu On Chan with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Siu On Chan more than expected).

Fields of papers citing papers by Siu On Chan

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Siu On Chan. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Siu On Chan. The network helps show where Siu On Chan may publish in the future.

Co-authorship network of co-authors of Siu On Chan

This figure shows the co-authorship network connecting the top 25 collaborators of Siu On Chan. A scholar is included among the top collaborators of Siu On Chan based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with Siu On Chan. Siu On Chan is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

Sort: Min cites: Since: Top N: Style:

13 of 13 papers shown

1.

Chan, Siu On, et al.. (2021). Learning and Testing Irreducible Markov Chains via the k-Cover Time.. 458–480. 1 indexed citations

2.

Chan, Siu On, et al.. (2017). Random walks and evolving sets: faster convergences and limitations. Symposium on Discrete Algorithms. 1849–1865. 1 indexed citations

3.

Chan, Siu On, et al.. (2016). On the Approximability of Sparse PCA. Conference on Learning Theory. 623–646. 3 indexed citations

4.

Chan, Siu On. (2016). Approximation Resistance from Pairwise-Independent Subgroups. Journal of the ACM. 63(3). 1–32.

5.

Zou, James, Gregory Valiant, Paul Valiant, et al.. (2016). Quantifying unobserved protein-coding variants in human populations provides a roadmap for large-scale sequencing projects. Nature Communications. 7(1). 13293–13293. 30 indexed citations

6.

Barak, Boaz, Siu On Chan, & Pravesh K. Kothari. (2015). Sum of Squares Lower Bounds from Pairwise Independence. 97–106. 13 indexed citations

7.

Chan, Siu On, et al.. (2014). 3 Approximate Constraint Satisfaction Requires Large LP Relaxations. 21 indexed citations

8.

Chan, Siu On, Elchanan Mossel, & Joe Neeman. (2014). On Extracting Common Random Bits From Correlated Sources on Large Alphabets. IEEE Transactions on Information Theory. 60(3). 1630–1637. 1 indexed citations

9.

Chan, Siu On. (2013). Approximation resistance from pairwise independent subgroups. 447–456. 35 indexed citations

10.

Chan, Siu On & Michael Molloy. (2013). A Dichotomy Theorem for the Resolution Complexity of Random Constraint Satisfaction Problems. SIAM Journal on Computing. 42(1). 27–60. 4 indexed citations

11.

Chan, Siu On & Michael Molloy. (2012). (k+1)-Cores Have k-Factors. Combinatorics Probability Computing. 21(6). 882–896. 3 indexed citations

12.

Benabbas, Siavosh, Siu On Chan, Konstantinos Georgiou, & Avner Magen. (2011). Tight Gaps for Vertex Cover in the Sherali-Adams SDP Hierarchy. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics). 3 indexed citations

13.

Chan, Siu On & Michael Molloy. (2008). A Dichotomy Theorem for the Resolution Complexity of Random Constraint Satisfaction Problems. 400. 634–643. 2 indexed citations

Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.

Explore authors with similar magnitude of impact