AbstractAn O(log log m) time n log mlog log m-processor CRCW-PRAM algorithm for the string prefix-matching problem over general alphabets is presented. The algorithm can also be used to compute the KMP failure function in O(log log m) time on m log mlog log m processors. These results improve on the running time of the best previous algorithm for both problems, which was O(log m), while preserving the same number of operations
Parenthesis matching is an important step in the construction of computation tree form and parsing. ...
AbstractThe parentheses matching problem is considered. Suppose we are given a balanced sequence of ...
. Given a pattern string of length m for the string matching problem, we design an algorithm that co...
AbstractAn O(log log m) time n log mlog log m-processor CRCW-PRAM algorithm for the string prefix-ma...
An optimal O (log log n)* time parallel algorithm for string matching on CRCW-PRAM is presented. It ...
Let WRAM [PRAM]be a parallel computer with p processors (RAMs) which share a common memory and are a...
An optimal O(log log n) time CRCW-PRAM algorithm for computing all periods of a string is presented...
Breslauer and Galil have shown that the string matching problem requires \Theta(d n p e + log log ...
1 The parentheses-matching problem is of crucial importance in the construction of expression tree ...
The approximate string matching is useful in a wide area of applications such as biology. A practica...
We establish non-trivial lower bounds for several prefix problems in the CRCW PRAM model. The chaini...
AbstractWe establish non-trivial lower bounds for several prefix problems in the CRCW PRAM model. Th...
International Conference of Computational Methods in Sciences and Engineering 2006 (ICCMSE 2006)The ...
Let WRAM [PRAM] be a parallel computer with p processors (RAM's) which share a common memory and are...
Abstract:- We are interested in solving the prefix problem of n inputs using p < n processors on ...
Parenthesis matching is an important step in the construction of computation tree form and parsing. ...
AbstractThe parentheses matching problem is considered. Suppose we are given a balanced sequence of ...
. Given a pattern string of length m for the string matching problem, we design an algorithm that co...
AbstractAn O(log log m) time n log mlog log m-processor CRCW-PRAM algorithm for the string prefix-ma...
An optimal O (log log n)* time parallel algorithm for string matching on CRCW-PRAM is presented. It ...
Let WRAM [PRAM]be a parallel computer with p processors (RAMs) which share a common memory and are a...
An optimal O(log log n) time CRCW-PRAM algorithm for computing all periods of a string is presented...
Breslauer and Galil have shown that the string matching problem requires \Theta(d n p e + log log ...
1 The parentheses-matching problem is of crucial importance in the construction of expression tree ...
The approximate string matching is useful in a wide area of applications such as biology. A practica...
We establish non-trivial lower bounds for several prefix problems in the CRCW PRAM model. The chaini...
AbstractWe establish non-trivial lower bounds for several prefix problems in the CRCW PRAM model. Th...
International Conference of Computational Methods in Sciences and Engineering 2006 (ICCMSE 2006)The ...
Let WRAM [PRAM] be a parallel computer with p processors (RAM's) which share a common memory and are...
Abstract:- We are interested in solving the prefix problem of n inputs using p < n processors on ...
Parenthesis matching is an important step in the construction of computation tree form and parsing. ...
AbstractThe parentheses matching problem is considered. Suppose we are given a balanced sequence of ...
. Given a pattern string of length m for the string matching problem, we design an algorithm that co...
DOI
Add to ORKG