An efficient parallel algorithm for building the separating tree ?
We present an efficient parallel algorithm for building the separating tree for a separable permutation. Our algorithm runs in O(log2n) O ( log 2 n ) time using O(nlog1.5n) O ( n log 1.5 n ) operations on the CREW PRAM and O(log2n) O ( log 2 n ) time using O(nlognloglogn) O ( n log n log log n ) operations on the COMMON CRCW PRAM.
parallel algorithms algorithms separable permutation