A new Parallel Algorithm for the Parentheses-Matching Problem

Authors:
Christophe Cerin
Affiliations:
-
Venue:
PAS '97 Proceedings of the 2nd AIZU International Symposium on Parallel Algorithms / Architecture Synthesis
Year:
1997

Citing 10
Cited 0

Optimal parallel generation of a computation tree form

ACM Transactions on Programming Languages and Systems (TOPLAS) - Lecture notes in computer science Vol. 174
Parallel merge sort

SIAM Journal on Computing
On optimal parallel computations for sequences of brackets

Theoretical Computer Science
Optimal routing of parentheses on the hypercube

SPAA '92 Proceedings of the fourth annual ACM symposium on Parallel algorithms and architectures
Matching parentheses in parallel

Discrete Applied Mathematics - Special issue: graphs in electrical engineering, discrete algorithms and complexity
Constant Time BSR Solutions to Parenthesis Matching, Tree Decoding, and Tree Reconstruction From Its Traversals

IEEE Transactions on Parallel and Distributed Systems
Parallel Generation of Postfix and Tree Forms

ACM Transactions on Programming Languages and Systems (TOPLAS)
Efficient Parallel Algorithms

Efficient Parallel Algorithms
Embedding Binary Trees into Crossed Cubes

IEEE Transactions on Computers
Efficient EREW PRAM Algorithms for Parentheses-Matching

IEEE Transactions on Parallel and Distributed Systems

Quantified Score

Hi-index	0.00

Visualization

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.