2 search results - page 1 / 1 » A Work-Optimal Coarse-Grained PRAM Algorithm for Lexicograph... |
IPPS
2000
IEEE
15 years 7 months ago
2000
IEEE
Abstract. In this paper, we consider parallelizability of some Pcomplete problems. First we propose a parameter which indicates parallelizability for a convex layers problem. We pr...