Ka Wong Chong

Affiliations:
  • Max Planck Institute for Informatics, Saarbrücken, Germany


According to our database1, Ka Wong Chong authored at least 12 papers between 1995 and 2015.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2015
An Optimal Parallel Algorithm for Minimum Spanning Trees in Planar Graphs.
Proceedings of the Algorithms, Probability, Networks, and Games, 2015

2004
An Optimal Parallel Co-Connectivity Algorithm.
Theory Comput. Syst., 2004

2003
Improving the efficiency of parallel minimum spanning tree algorithms.
Discret. Appl. Math., 2003

2001
Concurrent threads and optimal parallel minimum spanning trees algorithm.
J. ACM, 2001

1999
On the Parallel Time Complexity of Undirected Connectivity and Minimum Spanning Trees.
Proceedings of the Tenth Annual ACM-SIAM Symposium on Discrete Algorithms, 1999

Improving Parallel Computation with Fast Integer Sorting.
Proceedings of the Computing and Combinatorics, 5th Annual International Conference, 1999

1998
Approximating Biconnectivity in Parallel.
Algorithmica, 1998

Improved Deterministic Parallel Padded Sorting.
Proceedings of the Algorithms, 1998

1996
Improved algorithms for some classical graph problems
PhD thesis, 1996

Improving Biconnectivity Approximation via Local Optimization.
Proceedings of the Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, 1996

Towards More Precise Parallel Biconnectivity Approximation.
Proceedings of the Algorithms and Computation, 7th International Symposium, 1996

1995
Finding Connected Components in O(log n log log n) Time on the EREW PRAM.
J. Algorithms, 1995


  Loading...