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.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Brodal, G.S., Lagogiannis, G., Makris, C., Tsakalidis, A.K., Tsichlas, K.: Optimal finger search trees in the pointer machine. JCSS 67(2), 381–418 (2003)
Raman, R.: Eliminating Amortization: On Data Structures with Guaranteed Response Time. PhD Thesis, University of Rochester, New York, Computer Science Dept. U. Rochester, Tech¬nical Report TR-439 (1992)
Overmars, M., Leeuwen, J.v.: Worst case optimal insertion and deletion methods for decom¬posable searching problems. Information Processing Letters 12, 168–173 (1981)
Ajtai, M., Fredman, M., Komlos, J.: Hash functions for priority queues. Information and Con¬trol 63, 217–225 (1984)
Aho, A.V., Hopcroft, J.E., Ullman, J.D.: The Design and Analysis of Computer Algorithms. Addison-Wesley, Reading (1974)
Ranjan, D., Pontelli, E., Gupta, G., Longpre, L.: The Temporal Precedence Problem. In: Algorith¬mica (1999) (to appear)
Beame, P., Fich, F.: Optimal Bounds for the Predecessor Problem. In: Proceedings of the Thirty First Annual ACM Symposium on Theory of Computing, Atlanta, GA (May 1999)
Overmars, M.: A O(1) average time update scheme for balanced binary search trees. Bulletin of the EATCS 18, 27–29 (1982)
Tsakalidis, A.: Maintaining order in a generalized linked list. ACTA Informatica 21 (1984)
Anderson, A.: Faster deterministic sorting and searching in linear space. In: 37th Annual IEEE Symposium on Foundations of Computer Science (1996)
Anderson, A., Thorup, M.: Exponential search trees for faster deterministic searching, sorting and priority queues in linear space (Manuscript)
Anderson, A., Thorup, M.: Tight(er) Worst – Case Bounds on Dynamic Searching and Prior¬ity Queues. In: ACM STOC 2000 (2000)
Willard, D.E.: Log_logarithmic worst-case range queries are possible in space Θ(n). Information Processing Letters 17, 81–84 (1983)
Fredman, M.L., Willard, D.E.: Surpassing the information theoretic bound with fusion trees. Comput. Syst. Sci 47, 424–436 (1993); Announced at STOC (1990)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Sioutas, S., Panagis, Y., Theodoridis, E., Tsakalidis, A. (2005). One-Dimensional Finger Searching in RAM Model Revisited. In: Bozanis, P., Houstis, E.N. (eds) Advances in Informatics. PCI 2005. Lecture Notes in Computer Science, vol 3746. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11573036_13
Download citation
DOI: https://doi.org/10.1007/11573036_13
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-29673-7
Online ISBN: 978-3-540-32091-3
eBook Packages: Computer ScienceComputer Science (R0)