Summary: PREPRINT. In Proc. 2nd ann. International Symposium
onAlgorithms, pages 273­282. Springer Verlag, 1991.
Comparison­efficient and Write­optimal
Searching and Sorting
Arne Andersson
Lund University
Lund, Sweden
Tony W. Lai
NTT Communication Science Labs
Kyoto, Japan
Abstract
We consider the problem of updating a binary search tree in O(log n)
amortized time while using as few comparisons as possible. We show
that a tree of height dlog(n+1)+1=
p
log(n + 1)e can be maintained in
O(log n) amortized time such that the difference between the longest
and shortest paths from the root to an external node is at most 2.
We also study the problem of sorting and searching in the slow
write model of computation, where we have a constant size cache of

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

Collections: Computer Technologies and Information Sciences