Two general methods for dynamizing decomposable searching problems
From MaRDI portal
Publication:1149778
DOI10.1007/BF02241781zbMath0454.68060MaRDI QIDQ1149778
Jan van Leeuwen, Mark H. Overmars
Publication date: 1981
Published in: Computing (Search for Journal in Brave)
68P10: Searching and sorting
Related Items
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., An algorithm for handling many relational calculus queries efficiently.
Cites Work