sarnath@sybil.cs.buffalo.edu (Ramnath Sarnath) (02/12/91)
I am looking for references to fast parallel (PRAM) integer sorting algorithms. In particular I would like to know if integer sorting can be done in poly-loglogn time using polynomially many processors. I know of optimal sub-logarithmic algorithms that use a linear no. of processors ... I am not interested in these results. thanx, sarnath