default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDLap Chi Lau
- > Home > Persons > Lap Chi Lau
Publications
- 2022
[c33]Tsz Chiu Kwok, Lap Chi Lau, Kam Chuen Tung
:
Cheeger Inequalities for Vertex Expansion and Reweighted Eigenvalues. FOCS 2022: 366-377- [i16]Tsz Chiu Kwok, Lap Chi Lau, Kam Chuen Tung:
Cheeger Inequalities for Vertex Expansion and Reweighted Eigenvalues. CoRR abs/2203.06168 (2022) - 2021
- [j23]Tsz Chiu Kwok, Lap Chi Lau, Akshay Ramachandran:
Spectral Analysis of Matrix Scaling and Operator Scaling. SIAM J. Comput. 50(3): 1034-1102 (2021) - 2019
- [c29]Tsz Chiu Kwok, Lap Chi Lau, Akshay Ramachandran:
Spectral Analysis of Matrix Scaling and Operator Scaling. FOCS 2019: 1184-1204 - [i11]Tsz Chiu Kwok, Lap Chi Lau, Akshay Ramachandran:
Spectral analysis of matrix scaling and operator scaling. CoRR abs/1904.03213 (2019) - 2018
- [c27]Tsz Chiu Kwok, Lap Chi Lau, Yin Tat Lee, Akshay Ramachandran:
The Paulsen problem, continuous operator scaling, and smoothed analysis. STOC 2018: 182-189 - 2017
- [j22]Tsz Chiu Kwok, Lap Chi Lau, Yin Tat Lee:
Improved Cheeger's Inequality and Analysis of Local Graph Partitioning using Vertex Expansion and Expansion Profile. SIAM J. Comput. 46(3): 890-910 (2017) - [c25]Siu On Chan, Tsz Chiu Kwok, Lap Chi Lau:
Random Walks and Evolving Sets: Faster Convergences and Limitations. SODA 2017: 1849-1865 - [i8]Tsz Chiu Kwok, Lap Chi Lau, Yin Tat Lee, Akshay Ramachandran:
The Paulsen Problem, Continuous Operator Scaling, and Smoothed Analysis. CoRR abs/1710.02587 (2017) - 2016
- [c24]Tsz Chiu Kwok, Lap Chi Lau, Yin Tat Lee:
Improved Cheeger's Inequality and Analysis of Local Graph Partitioning using Vertex Expansion and Expansion Profile. SODA 2016: 1848-1861 - 2015
- [i6]Tsz Chiu Kwok, Lap Chi Lau, Yin Tat Lee:
Improved Cheeger's Inequality and Analysis of Local Graph Partitioning using Vertex Expansion and Expansion Profile. CoRR abs/1504.00686 (2015) - [i5]Siu On Chan, Tsz Chiu Kwok, Lap Chi Lau:
Random Walks and Evolving Sets: Faster Convergences and Limitations. CoRR abs/1507.02069 (2015) - 2014
- [c23]Tsz Chiu Kwok, Lap Chi Lau:
Lower Bounds on Expansions of Graph Powers. APPROX-RANDOM 2014: 313-324 - 2013
- [j17]Ho Yee Cheung, Tsz Chiu Kwok, Lap Chi Lau:
Fast matrix rank algorithms and applications. J. ACM 60(5): 31:1-31:25 (2013) - [c21]Tsz Chiu Kwok, Lap Chi Lau, Yin Tat Lee, Shayan Oveis Gharan, Luca Trevisan:
Improved Cheeger's inequality: analysis of spectral partitioning algorithms through higher order spectral gap. STOC 2013: 11-20 - [i4]Tsz Chiu Kwok, Lap Chi Lau, Yin Tat Lee, Shayan Oveis Gharan, Luca Trevisan:
Improved Cheeger's Inequality: Analysis of Spectral Partitioning Algorithms through Higher Order Spectral Gap. CoRR abs/1301.5584 (2013) - 2012
- [c20]Tsz Chiu Kwok, Lap Chi Lau:
Finding Small Sparse Cuts by Random Walk. APPROX-RANDOM 2012: 615-626 - [c19]Ho Yee Cheung, Tsz Chiu Kwok, Lap Chi Lau:
Fast matrix rank algorithms and applications. STOC 2012: 549-562 - [i3]Ho Yee Cheung, Tsz Chiu Kwok, Lap Chi Lau:
Fast Matrix Rank Algorithms and Applications. CoRR abs/1203.6705 (2012) - [i2]Tsz Chiu Kwok, Lap Chi Lau:
Finding Small Sparse Cuts Locally by Random Walk. CoRR abs/1204.4666 (2012)
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-09-18 23:43 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:
