Summary: PREPRINT. In Proc. 37th IEEE Symposium on Foundations of Computer Science, 1996.
Faster deterministic sorting and searching in linear space
Arne Andersson
Department of Computer Science, Lund University
Box 118, S­221 00 Lund, Sweden
arne@dna.lth.se
Abstract
We present a significant improvement on linear space de-
terministic sorting and searching. On a unit-cost RAM with
word size , an ordered set of ¡ -bit keys (viewed as bi-
nary strings or integers) can be maintained in
¢
£¤¦¥¨§©
! ¡"# %$'&
"# %$'(0) !1! ¡
2

21! ¡
34
5

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

Collections: Computer Technologies and Information Sciences