Summary: PREPRINT. Journal of Computer and System Sciences, vol 57, pp 7493, 1998.
Sorting in Linear Time? \Lambda
Arne Andersson y Torben Hagerup z
Stefan Nilsson x Rajeev Raman --
\Lambda A preliminary version of this paper was presented at the 27th Annual ACM Symposium on the Theory
of Computing in Las Vegas, Nevada in May 1995.
y Department of Computer Science, Lund University, Box 118, S--221 00 Lund, Sweden. email@example.com
z MaxPlanckInstitut fšur Informatik, D--66123 Saarbršucken, Germany. Supported by the ESPRIT Basic
Research Actions Program of the EU under contract No. 7141 (project ALCOM II). firstname.lastname@example.org
x Helsinki University of Technology, Department of Computer Science, Otakaari 1, 02150 Espoo, Finland.
The work was done while this author was at the Department of Computer Science, Lund University, Sweden.
-- Department of Computer Science, King's College London, Strand, London WC2R 2LS, U. K.
Proposed running head: Sorting in Linear Time?
Contact author: Torben Hagerup, MaxPlanckInstitut fšur Informatik, D--66123 Saar
bršucken, Germany. email@example.com