Ka Wong Chong - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 14 from 14

2015

An Optimal Parallel Algorithm for Minimum Spanning Trees in Planar GraphsKa Wong Chong, Christos D. Zaroliagis. BIRTHDAY 2015: 169-182 [doi]

2004

An Optimal Parallel Co-Connectivity AlgorithmKa Wong Chong, Stavros D. Nikolopoulos, Leonidas Palios. mst, 37(4):527-546, 2004. [doi]

2003

Improving the efficiency of parallel minimum spanning tree algorithmsKa Wong Chong, Yijie Han, Yoshihide Igarashi, Tak Wah Lam. DAM, 126(1):33-54, 2003.

2001

Concurrent threads and optimal parallel minimum spanning trees algorithmKa Wong Chong, Yijie Han, Tak Wah Lam. JACM, 48(2):297-323, 2001. [doi]

1999

On the Parallel Time Complexity of Undirected Connectivity and Minimum Spanning TreesKa Wong Chong, Yijie Han, Tak Wah Lam. soda 1999: 225-234 [doi]

Improving Parallel Computation with Fast Integer SortingKa Wong Chong, Yijie Han, Yoshihide Igarashi, Tak Wah Lam. cocoon 1999: 452-461 [doi]

1998

Improved Deterministic Parallel Padded SortingKa Wong Chong, Edgar A. Ramos. esa 1998: 405-416 [doi]

Approximating Biconnectivity in ParallelKa Wong Chong, Tak Wah Lam. algorithmica, 21(4):395-410, 1998.

1996

Improved algorithms for some classical graph problemsKa Wong Chong. PhD thesis, University of Hong Kong, 1996. [doi]

Improving Biconnectivity Approximation via Local OptimizationKa Wong Chong, Tak Wah Lam. soda 1996: 26-35

Towards More Precise Parallel Biconnectivity ApproximationKa Wong Chong, Tak Wah Lam. isaac 1996: 223-232

1995

Finding Connected Components in O(log n log log n) Time on the EREW PRAMKa Wong Chong, Tak Wah Lam. jal, 18(3):378-402, 1995.

Approximating Biconnectivity in ParallelKa Wong Chong, Tak Wah Lam. spaa 1995: 224-233 [doi]

1993

Finding Connected Components in O(log n log log n) Time on the EREW PRAMKa Wong Chong, Tak Wah Lam. soda 1993: 11-20

Sign in or sign up to see more results.

runs on WebDSL