One-Dimensional finger searching in RAM model revisited

Authors:
S. Sioutas;Y. Panagis;E. Theodoridis;A. Tsakalidis
Affiliations:
Computer Engineering and Informatics Dept., University of Patras, Greece;Computer Engineering and Informatics Dept., University of Patras, Greece;Computer Engineering and Informatics Dept., University of Patras, Greece;Computer Technology Institute, University of Patras Campus
Venue:
PCI'05 Proceedings of the 10th Panhellenic conference on Advances in Informatics
Year:
2005

Citing 9
Cited 0

Maintaining order in a generalized linked list

Acta Informatica
Hash functions for priority queues

Information and Control
Eliminating amortization: on data structures with guaranteed response time

Eliminating amortization: on data structures with guaranteed response time
Surpassing the information theoretic bound with fusion trees

Journal of Computer and System Sciences - Special issue: papers from the 22nd ACM symposium on the theory of computing, May 14–16, 1990
Optimal bounds for the predecessor problem

STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Tight(er) worst-case bounds on dynamic searching and priority queues

STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
The Design and Analysis of Computer Algorithms

The Design and Analysis of Computer Algorithms
Faster deterministic sorting and searching in linear space

FOCS '96 Proceedings of the 37th Annual Symposium on Foundations of Computer Science
Optimal finger search trees in the pointer machine

Journal of Computer and System Sciences - STOC 2002

Quantified Score

Hi-index	0.00

Visualization

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 fin ger searching queries in $\Theta(\sqrt{{\rm log} d/ {\rm 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.