Sciweavers

JPDC
2010
109views more  JPDC 2010»
13 years 6 months ago
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(log2 n) time using O(n log n) operations on the CR...
Yijie Han, Sanjeev Saxena, Xiaojun Shen