Tsz Chiu Kwok

Orcid: 0009-0002-9833-203X

According to our database1, Tsz Chiu Kwok authored at least 13 papers between 2012 and 2026.

Collaborative distances:

Timeline

Legend:

Book  In proceedings  Article  PhD thesis  Dataset  Other 

Links

Online presence:

On csauthors.net:

Bibliography

2026
On Solving Asymmetric Diagonally Dominant Linear Systems in Sublinear Time.
Proceedings of the 17th Innovations in Theoretical Computer Science Conference, 2026

2025
Cheeger's Inequalities for Vertex Expansion and Reweighted Eigenvalues.
SIAM J. Comput., 2025

2022
Cheeger Inequalities for Vertex Expansion and Reweighted Eigenvalues.
Proceedings of the 63rd IEEE Annual Symposium on Foundations of Computer Science, 2022

2021
Concentration bounds for almost <i>k</i>-wise independence with applications to non-uniform security.
Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms, 2021

2019
Spectral Analysis of Matrix Scaling and Operator Scaling.
Proceedings of the 60th IEEE Annual Symposium on Foundations of Computer Science, 2019

2018
The Paulsen problem, continuous operator scaling, and smoothed analysis.
Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing, 2018

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

2016
Improved Cheeger's Inequality and Analysis of Local Graph Partitioning using Vertex Expansion and Expansion Profile.
Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, 2016

2014
Lower Bounds on Expansions of Graph Powers.
Proceedings of the Approximation, 2014

2013
Improved Cheeger's inequality: analysis of spectral partitioning algorithms through higher order spectral gap.
Proceedings of the Symposium on Theory of Computing Conference, 2013

2012
Finding Small Sparse Cuts Locally by Random Walk
CoRR, 2012

Fast matrix rank algorithms and applications.
Proceedings of the 44th Symposium on Theory of Computing Conference, 2012

Finding Small Sparse Cuts by Random Walk.
Proceedings of the Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, 2012


  Loading...