Summary: PREPRINT. Journal of Computer and System Sciences, vol 57, pp 74­93, 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. arne@dna.lth.se
z Max­Planck­Institut 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). torben@mpi­sb.mpg.de
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.
sni@cs.hut.fi
-- Department of Computer Science, King's College London, Strand, London WC2R 2LS, U. K.
raman@dcs.kcl.ac.uk
1

Proposed running head: Sorting in Linear Time?
Contact author: Torben Hagerup, Max­Planck­Institut f¨ur Informatik, D--66123 Saar­
br¨ucken, Germany. torben@mpi­sb.mpg.de
2

Source: Andersson, Arne - Department of Information Technology, Uppsala Universitet

Collections: Computer Technologies and Information Sciences