| 2004 |
|---|
| 12 | EE | Ka Wong Chong,
Stavros D. Nikolopoulos,
Leonidas Palios:
An Optimal Parallel Co-Connectivity Algorithm.
Theory Comput. Syst. 37(4): 527-546 (2004) |
| 2003 |
|---|
| 11 | | Ka Wong Chong,
Yijie Han,
Yoshihide Igarashi,
Tak Wah Lam:
Improving the efficiency of parallel minimum spanning tree algorithms.
Discrete Applied Mathematics 126(1): 33-54 (2003) |
| 2001 |
|---|
| 10 | EE | Ka Wong Chong,
Yijie Han,
Tak Wah Lam:
Concurrent threads and optimal parallel minimum spanning trees algorithm.
J. ACM 48(2): 297-323 (2001) |
| 1999 |
|---|
| 9 | EE | Ka Wong Chong,
Yijie Han,
Yoshihide Igarashi,
Tak Wah Lam:
Improving Parallel Computation with Fast Integer Sorting.
COCOON 1999: 452-461 |
| 8 | EE | 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 |
|---|
| 7 | EE | Ka Wong Chong,
Edgar A. Ramos:
Improved Deterministic Parallel Padded Sorting.
ESA 1998: 405-416 |
| 6 | | Ka Wong Chong,
Tak Wah Lam:
Approximating Biconnectivity in Parallel.
Algorithmica 21(4): 395-410 (1998) |
| 1996 |
|---|
| 5 | | Ka Wong Chong,
Tak Wah Lam:
Towards More Precise Parallel Biconnectivity Approximation.
ISAAC 1996: 223-232 |
| 4 | | Ka Wong Chong,
Tak Wah Lam:
Improving Biconnectivity Approximation via Local Optimization.
SODA 1996: 26-35 |
| 1995 |
|---|
| 3 | EE | Ka Wong Chong,
Tak Wah Lam:
Approximating Biconnectivity in Parallel.
SPAA 1995: 224-233 |
| 2 | | 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) |
| 1993 |
|---|
| 1 | | 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 |
