%0 Conference Paper %B 27th Annual Symposium on Foundations of Computer Science %D 1986 %T Tight complexity bounds for parallel comparison sorting %A Alon,N. %A Azar,Y. %A Vishkin, Uzi %B 27th Annual Symposium on Foundations of Computer Science %P 502 - 510 %8 1986/// %G eng