Abstract
We present an efficient parallel algorithm for building the separating tree for a separable permutation. Our algorithm runs in O ( log 2 n ) time using O ( n log 1.5 n ) operations on the CREW PRAM and O ( log 2 n ) time using O ( n log n log log n ) operations on the COMMON CRCW PRAM.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
