Path: utzoo!utgpu!news-server.csri.toronto.edu!cs.utexas.edu!swrinde!zaphod.mps.ohio-state.edu!sol.ctr.columbia.edu!emory!hubcap!sarnath
From: sarnath@sybil.cs.buffalo.edu (Ramnath Sarnath)
Newsgroups: comp.parallel
Subject: Integer sorting
Message-ID: <13061@hubcap.clemson.edu>
Date: 11 Feb 91 20:47:29 GMT
Sender: fpst@hubcap.clemson.edu
Followup-To: comp.parallel
Organization: State University of New York at Buffalo/Comp Sci
Lines: 11
Approved: parallel@hubcap.clemson.edu

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