Almost fully-parallel parentheses matching

Communication-Efficient Bulk Synchronous Parallel Algorithm for Parentheses Matching

A new Parallel Algorithm for the Parentheses-Matching Problem

1 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 parenthesesmatching 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 wit...

Almost Optimal Fully LZW-Compressed Pattern Matching

Given two strings: pattern P and text T of lengths jPj =M and jT j = N . A string matching problem is to nd all occurrences of pattern P in text T . A fully compressed string matching problem is the string matching problem with input strings P and T given in compressed forms p and t respectively, where jpj = m and jtj = n. We present rst, almost optimal, string matching algorithms for LZW-compr...

Efficient EREW PRAM Algorithms for Parentheses-Matching

We present four polylog-time parallel algorithms for matching parentheses on an exclusive-read and exclusive-write (EREW) parallel random-access machine (PRAM) model. These algorithms provide new insights into the parentheses-matching problem. The first algorithm has a time complexity of O( log’ n ) employing O( & ) processors for an input string containing ~1 parentheses. Although this algorit...

Efficient Linked List Ranking Algorithms and Parentheses Matching as a New Strategy for Parallel Algorithm Design

Parallel computing has become one of the major areas of research in the computer science field with numerous journals and conferences dedicated to its development. Multiprocessor computers (parallel computers) are becoming more prevalent, with several manufacturers and models readily available, several at quite low prices. However, while the hardware is progressing rapidly, the methodologies an...