The Community for Technology Leaders
Parallel Algorithms / Architecture Synthesis, AIZU International Symposium on (1997)
Aizu-Wakamatsu, Fukushima, JAPAN
Mar. 17, 1997 to Mar. 21, 1997
ISBN: 0-8186-7870-4
pp: 364
ABSTRACT
The parentheses-matching problem is of crucial importance in the construction of expression tree in order to evaluate, for instance, arithmetic expressions. A new parallel algorithm is introduced in this paper to solve the parentheses-matching problem optimally (in {\cal O}(\log_2 n) parallel time with {\cal O}(n/\log_2 n) processors) on an EREW-PRAM model. An algorithm for an input string of n parentheses with a maximal nested level of \log n is also presented.
INDEX TERMS
parallel algorithms on PRAM (Parallel Random Access Machine) model, parentheses-matching problem.
CITATION
Christophe Cerin, "A new Parallel Algorithm for the Parentheses-Matching Problem", Parallel Algorithms / Architecture Synthesis, AIZU International Symposium on, vol. 00, no. , pp. 364, 1997, doi:10.1109/AISPAS.1997.581700
83 ms
(Ver 3.3 (11022016))