Worst-case optimal insertion and deletion methods for decomposable searching problems
From MaRDI portal
Publication:1152223
DOI10.1016/0020-0190(81)90093-4zbMath0459.68026OpenAlexW2083694582MaRDI QIDQ1152223
Jan van Leeuwen, Mark H. Overmars
Publication date: 1981
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://dspace.library.uu.nl/handle/1874/15911
Related Items (25)
Dynamic layers of maxima with applications to dominating queries ⋮ Computing rectangle enclosures ⋮ Efficient dynamic range searching using data replication ⋮ Halfplanar range search in linear space and \(O(n^{0.695})\) query time ⋮ AN EFFICIENT PARALLEL ALGORITHM FOR THE ASSIGNMENT PROBLEM ON THE PLANE∗ ⋮ Towards an Optimal Method for Dynamic Planar Point Location ⋮ A balanced search tree O(1) worst-case update time ⋮ Efficient splitting and merging algorithms for order decomposable problems ⋮ Efficient independent set approximation in unit disk graphs ⋮ ISB-tree: A new indexing scheme with efficient expected behaviour ⋮ Data Structures for Data-Intensive Applications: Tradeoffs and Design Guidelines ⋮ Time-Optimal Top-$k$ Document Retrieval ⋮ Improved bounds for finger search on a RAM ⋮ Efficient dynamic algorithms for some geometric intersection problems ⋮ On the equivalence of some rectangle problems ⋮ Two-tier relaxed heaps ⋮ Maintaining discrete probability distributions optimally ⋮ Divided \(k-d\) trees ⋮ Applications of a new space-partitioning technique ⋮ Dynamic graph coloring ⋮ Dynamic interpolation search revisited ⋮ Unnamed Item ⋮ Resolving SINR Queries in a Dynamic Setting ⋮ A dynamic fixed windowing problem ⋮ Efficient splitting and merging algorithms for order decomposable problems.
Cites Work
This page was built for publication: Worst-case optimal insertion and deletion methods for decomposable searching problems
