In this paper, we investigate the BSR (Broadcast with Selective Reduction) model of computation for problems related with subsegments (basically, inputs are arrays containing elements and outputs are \some contiguous part" of inputs), namely MSSP (Maximal Sum Subsegment Problem { one and two dimensional version) and LIS (Longest Increasing Sequence). Theâ€¦ (More)

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â€¦ (More)