2 search results - page 1 / 1 » A Work-Optimal Coarse-Grained PRAM Algorithm for Lexicograph... |
ICTCS
2003
Springer
13 years 9 months ago
2003
Springer
IPPS
2000
IEEE
13 years 9 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...