DocumentCode :
3425327
Title :
A new parallel algorithm for the parentheses-matching problem
Author :
Bergogne, Laurent ; Cérin, Christophe
Author_Institution :
Picardie Jules Verne Univ., Amiens, France
fYear :
1997
fDate :
17-21 Mar 1997
Firstpage :
364
Lastpage :
369
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 O(log2 n) parallel time with O(n/log2 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
Keywords :
computational complexity; parallel algorithms; tree searching; EREW-PRAM model; arithmetic expressions; expression tree; maximal nested level; parallel algorithm; parentheses-matching problem; Arithmetic; Calculus; Data structures; Formal languages; Impedance matching; Parallel algorithms; Phase change random access memory; Tree data structures;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Parallel Algorithms/Architecture Synthesis, 1997. Proceedings., Second Aizu International Symposium
Conference_Location :
Aizu-Wakamatsu
Print_ISBN :
0-8186-7870-4
Type :
conf
DOI :
10.1109/AISPAS.1997.581700
Filename :
581700
Link To Document :
https://search.ricest.ac.ir/dl/search/defaultta.aspx?DTC=49&DC=3425327
بازگشت