default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDKa Wong Chong
Person information
- affiliation: Max Planck Institute for Informatics, Saarbrücken, Germany
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2015
[c8]Ka Wong Chong, Christos D. Zaroliagis
:
An Optimal Parallel Algorithm for Minimum Spanning Trees in Planar Graphs. Algorithms, Probability, Networks, and Games 2015: 169-182
2000 – 2009
- 2004
- [j5]Ka Wong Chong, Stavros D. Nikolopoulos, Leonidas Palios:
An Optimal Parallel Co-Connectivity Algorithm. Theory Comput. Syst. 37(4): 527-546 (2004) - 2003
- [j4]Ka Wong Chong, Yijie Han, Yoshihide Igarashi, Tak Wah Lam:
Improving the efficiency of parallel minimum spanning tree algorithms. Discret. Appl. Math. 126(1): 33-54 (2003) - 2001
- [j3]Ka Wong Chong, Yijie Han, Tak Wah Lam:
Concurrent threads and optimal parallel minimum spanning trees algorithm. J. ACM 48(2): 297-323 (2001)
1990 – 1999
- 1999
- [c7]Ka Wong Chong, Yijie Han, Yoshihide Igarashi, Tak Wah Lam:
Improving Parallel Computation with Fast Integer Sorting. COCOON 1999: 452-461 - [c6]Ka Wong Chong, Yijie Han, Tak Wah Lam:
On the Parallel Time Complexity of Undirected Connectivity and Minimum Spanning Trees. SODA 1999: 225-234 - 1998
- [j2]Ka Wong Chong, Tak Wah Lam:
Approximating Biconnectivity in Parallel. Algorithmica 21(4): 395-410 (1998) - [c5]Ka Wong Chong, Edgar A. Ramos:
Improved Deterministic Parallel Padded Sorting. ESA 1998: 405-416 - 1996
- [b1]Ka Wong Chong:
Improved algorithms for some classical graph problems. University of Hong Kong, 1996 - [c4]Ka Wong Chong, Tak Wah Lam:
Towards More Precise Parallel Biconnectivity Approximation. ISAAC 1996: 223-232 - [c3]Ka Wong Chong, Tak Wah Lam:
Improving Biconnectivity Approximation via Local Optimization. SODA 1996: 26-35 - 1995
- [j1]Ka Wong Chong, Tak Wah Lam:
Finding Connected Components in O(log n log log n) Time on the EREW PRAM. J. Algorithms 18(3): 378-402 (1995) - [c2]Ka Wong Chong, Tak Wah Lam:
Approximating Biconnectivity in Parallel. SPAA 1995: 224-233 - 1993
- [c1]Ka Wong Chong, Tak Wah Lam:
Finding Connected Components in O(log n log log n) Time on the EREW PRAM. SODA 1993: 11-20
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 2025-01-04 03:26 CET 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:
