Two general methods for dynamizing decomposable searching problems
From MaRDI portal
Publication:1149778
DOI10.1007/BF02241781zbMath0454.68060OpenAlexW1595672100MaRDI QIDQ1149778
Mark H. Overmars, Jan van Leeuwen
Publication date: 1981
Published in: Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf02241781
Related Items (6)
An algorithm for handling many relational calculus queries efficiently. ⋮ Lower bounds for the addition-subtraction operations in orthogonal range queries and related problems ⋮ Some principles for dynamizing decomposable searching problems ⋮ Worst-case optimal insertion and deletion methods for decomposable searching problems ⋮ Optimal dynamization of decomposable searching problems ⋮ Efficient splitting and merging algorithms for order decomposable problems.
Cites Work
This page was built for publication: Two general methods for dynamizing decomposable searching problems
