A density control algorithm for doing insertions and deletions in a sequentially ordered file in a good worst-case time
From MaRDI portal
Publication:1187029
DOI10.1016/0890-5401(92)90034-DzbMath0767.68063MaRDI QIDQ1187029
Publication date: 28 June 1992
Published in: Information and Computation (Search for Journal in Brave)
Related Items (12)
Canonical density control ⋮ Tight Lower Bounds for the Online Labeling Problem ⋮ Towards an Optimal Method for Dynamic Planar Point Location ⋮ Full-fledged real-time indexing for constant size alphabets ⋮ Dynamic Trees with Almost-Optimal Access Cost ⋮ Orthogonal range searching in linear and almost-linear space ⋮ Fragile complexity of adaptive algorithms ⋮ A LINEAR SPACE DATA STRUCTURE FOR ORTHOGONAL RANGE REPORTING AND EMPTINESS QUERIES ⋮ Fragile complexity of adaptive algorithms ⋮ Reallocation problems in scheduling ⋮ Verifiable Zero-Knowledge Order Queries and Updates for Fully Dynamic Lists and Trees ⋮ On Online Labeling with Large Label Set
Cites Work
- Unnamed Item
- New trie data structures which support very fast search operations
- Controlled density sorting
- Understanding the complexity of interpolation search
- An algorithmic and complexity analysis of interpolation search
- Parallel processing can be harmful: The unusual behavior of interpolation search
- Log-logarithmic worst-case range queries are possible in space theta(N)
- A data structure for dynamic range queries
- New Data Structures for Orthogonal Range Queries
- Searching Unindexed and Nonuniformly Generated Files in $\log \log N$ Time
- Algorithms for resolving conflicts in dynamic storage allocation
- Adding range restriction capability to dynamic data structures
- Padded Lists Revisited
- Design and implementation of an efficient priority queue
- Interpolation search—a log log N search
This page was built for publication: A density control algorithm for doing insertions and deletions in a sequentially ordered file in a good worst-case time
