Given an arrayX of n elements from a restricted domain of integers[1, n]. The integer sorting problem is the rearrangement of n integers in ascending order. We study the first optimal deterministicâ€¦ (More)

In this paper, we study the merging of two sorted arrays $A=(a_{1},a_{2},\ldots, a_{n_{1}})$ and $B=(b_{1},b_{2},\ldots,b_{n_{2}})$ on EREW PRAM with two restrictions: (1) The elements of two arraysâ€¦ (More)

We consider the problem of sorting n integers when the elements are drawn from the restricted domain [1...n]. A new deterministic parallel algorithm for sorting n integers is obtained. Its runningâ€¦ (More)

Given two sorted arrays $${A=(a_1,a_2,\ldots ,a_{n_1})}$$ and $${B=(b_1,b_2,\ldots ,b_{n_2})}$$ , where their elements are drawn from a linear range in n and nÂ =Â Max(n 1, n 2). The merging of twoâ€¦ (More)

An addition sequence problem is given a set of numbers X = {n 1, n 2, . . . , n m }, what is the minimal number of additions needed to compute all m numbers starting from 1? This problem isâ€¦ (More)

We present a new optimal deterministic parallel algorithm for merging two sorted arrays A = (a<sub>0</sub>, a<sub>1</sub>, ... , a<sub>n1</sub> - 1) and B = (b<sub>0</sub>, b<sub>1</sub>, ... ,â€¦ (More)