Improved bounds for finger search on a RAM
From MaRDI portal
Publication:1950391
DOI10.1007/s00453-012-9636-4zbMath1264.68070OpenAlexW2910834087MaRDI QIDQ1950391
Athanasios K. Tsakalidis, Spyros Sioutas, Alexis C. Kaporis, Christos D. Zaroliagis, Kostas Tsichlas, Christos Makris
Publication date: 13 May 2013
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00453-012-9636-4
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A class of algorithms which require nonlinear time to maintain disjoint sets
- Linear-time algorithms for visibility and shortest path problems inside triangulated simple polygons
- Worst-case optimal insertion and deletion methods for decomposable searching problems
- Understanding the complexity of interpolation search
- Surpassing the information theoretic bound with fusion trees
- A constant update time finger search tree
- On the Lambert \(w\) function
- Time bounded random access machines
- Optimal bounds for the predecessor problem and related problems
- Randomized search trees
- Dynamic interpolation search
- Tight(er) worst-case bounds on dynamic searching and priority queues
- Dynamic ordered sets with exponential search trees
- Searching Unindexed and Nonuniformly Generated Files in $\log \log N$ Time
- Implicit Data Structures for the Dictionary Problem
- Divide and Conquer Heuristics for Minimum Weighted Euclidean Matching
- Efficiency of a Good But Not Linear Set Union Algorithm
- Deletions That Preserve Randomness
- Interpolation search—a log log N search
- On RAM Priority Queues
- Sorting jordan sequences in linear time using level-linked search trees
- Examining Computational Geometry, Van Emde Boas Trees, and Hashing from the Perspective of the Fusion Tree
- Algorithms - ESA 2003
- Optimal finger search trees in the pointer machine
This page was built for publication: Improved bounds for finger search on a RAM
