One-dimensional finger searching in RAM model revisited

Abstract

In the particular case we have insertions/deletions at the tail of a given set S of n one-dimensional elements, we present a simpler and more concrete algorithm than the one presented in [12] achieving the same worst-case upper bounds for finger searching queries in ⊖(√log d/log log d) time. Furthermore, in the general case where we have insertions/deletions anywhere we present a new simple randomized algorithm achieving the same time bounds with high probability. © Springer-Verlag Berlin Heidelberg 2005.