PowerList, ParList and PList data structures are efficient tools for functional descriptions of parallel programs that are divide&conquer in nature. The goal of this work is to develop three parallel variants for Fast Fourier Transformation using these theories. The variants are implied by the degree of the polynomial, which can be a power of two, a prime number, or a product of prime factors. The last variant includes the first two, and represents

The paper presents parallel algorithms for Lagrange and Hermite interpolation methods formally derived from specifications, and using set-distributions. Set-distributions are based on set-valued mappings, and they assign a data object to more than one process. The derivation from specifications assures the correctness, and the set-distributions assure the efficiency of the programs. The obtained parallel algorithms have very good time complexities

Data distributions have a serious impact on time complexity of parallel programs, developed based on domain decomposition. A new kind of distributions -- {em set distributions}, based on set-valued mappings, is introduced. These distributions assign a data object to more than one process. The set distributions can be used especially when the number of processes is greater than the data input size, but, sometimes using set distributions can lead to