A cost-optimal parallel algorithm for the parentheses matching problem on an EREW PRAM
C.C.-Y. Chen, Sajal Kumar Das · 2002
The article presents a cost-optimal parallel algorithm for the parentheses matching problem on the EREW PRAM model. For n parentheses, the algorithm requires O(n/p+log n) time and O(n+p log p) space, employing p processors. Thus, for p>