Worst-case optimal insertion and deletion methods for decomposable searching problems
From MaRDI portal
Publication:1152223
DOI10.1016/0020-0190(81)90093-4zbMath0459.68026MaRDI 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
68P10: Searching and sorting
Related Items
AN EFFICIENT PARALLEL ALGORITHM FOR THE ASSIGNMENT PROBLEM ON THE PLANE∗, Divided \(k-d\) trees, Applications of a new space-partitioning technique, Efficient splitting and merging algorithms for order decomposable problems., Computing rectangle enclosures