1. Linear approximation of shortest superstrings;Blum,1991
2. A fast and efficient NC algorithm for maximal matching;Chen;Inform. Process. Lett.,1995
3. Parallel constructions of maximal path sets and applications to short superstrings;Chen;Theoret. Comput. Sci.,1996
4. Parallel and sequential approximation of shortest superstrings;Czumaj,1994
5. Optimal EREW parallel algorithms for connectivity, ear decomposition and st-numbering of planar graphs;Gazit,1991