Joe K.W. Chong

Hello!  This is Joe.  Welcome to my homepage.  I got my B.Sc and Ph.D in the Department
of Computer Science in 1991 and 1996 respectively.  Before joining this department,
I had been working in the Max-Planck-Institut fuer Informatik  in Germany as a Postdoctoral Research
Fellow for two years.
 

Office:  Room 429, Chow Yei Ching Building
Dept. Computer Science
The University of Hong Kong
Pokfulam Road
Hong Kong
Tel: (852) 2857 8461
Fax: (852) 2559 8447
E-mail: kwchong@cs.hku.hk 

Recent Publications:
 

• K.W. Chong, Stavros D. Nikolopoulos, and Leonidas Palios: An Optimal Parallel Co-Connectivity Algorithm. Theory of Computing Systems V37(4): 526-546 (2004)
• K.W. Chong, Y. Han, T.W. Lam: Concurrent threads and optimal parallel minimum spanning trees algorithm. JACM 48(2): 297-323 (2001)
• K.W. Chong, Y. Han, and T.W. Lam, On the parallel time complexity of undirected connectivity and minimum spanning trees, Tenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA'99), January 1999.
• K.W. Chong and Edgar A. Ramos, Improved Deterministic Parallel Paddded Sorting, ESA'98, to appear.
• K.W. Chong and T.W. Lam, Approximating biconnectivity in Parallel, Algorithmica, 1998, vol. 21, pp 395--410.
• K.W. Chong, Finding Minimum Spanning Trees on the EREW PRAM, 1996 International Computer Symposium (ICS'96), Taiwan, December 1996.
• K.W. Chong and T.W. Lam, Towards more precise parallel biconnectivity approximation, to appear in the Seventh Annual International Symposium on Algorithms and Computation, Japan, December 1996.
• K.W. Chong and T.W. Lam, Improving Biconnectivity Approximation via Local Optimization, 7th Annual ACM-SIAM Symposium on Discrete Algorithms, January 1996, 26-35.
• K.W. Chong and T.W. Lam, Approximating biconnectivity in parallel, 7th Annual ACM Symposium on Parallel Algorithms and Architectures, 224-233, July 1995.