MPI-I-97-1-016
Faster deterministic sorting and priority queues in linear space
Thorup, Mikkel
July 1997, 9 pages.
.
Status: available - back from printing
The RAM complexity of deterministic linear space sorting of
integers in words is improved from $O(n\sqrt{\log n})$ to
$O(n(\log\log n)^2)$. No better
bounds are known for polynomial space. In fact, the techniques give a
deterministic linear space priority queue supporting insert and delete in
$O((\log\log n)^2)$ amortized time and find-min in constant time. The priority
queue can be implemented using addition, shift, and
bit-wise boolean operations.
-
- Attachement: MPI-I-97-1-016.ps (123 KBytes)
URL to this document: https://domino.mpi-inf.mpg.de/internet/reports.nsf/NumberView/1997-1-016
BibTeX
@TECHREPORT{Mikkel97,
AUTHOR = {Thorup, Mikkel},
TITLE = {Faster deterministic sorting and priority queues in linear space},
TYPE = {Research Report},
INSTITUTION = {Max-Planck-Institut f{\"u}r Informatik},
ADDRESS = {Im Stadtwald, D-66123 Saarbr{\"u}cken, Germany},
NUMBER = {MPI-I-97-1-016},
MONTH = {July},
YEAR = {1997},
ISSN = {0946-011X},
}