Optimal dynamization of decomposable searching problems
From MaRDI portal
Publication:1153688
DOI10.1016/0020-0190(81)90010-7zbMath0463.68056MaRDI QIDQ1153688
Mark H. Overmars, Kurt Mehlhorn
Publication date: 1981
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0020-0190(81)90010-7
searching algorithms; automatic transformation of static data structures into dynamic data structures
Related Items
Efficient splitting and merging algorithms for order decomposable problems, AN EFFICIENT PARALLEL ALGORITHM FOR THE ASSIGNMENT PROBLEM ON THE PLANE∗, An incremental reconstruction method for dynamic planar point location, Worst-case optimal insertion and deletion methods for decomposable searching problems, Complexity models for incremental computation, Efficient splitting and merging algorithms for order decomposable problems., Lower bounds on the efficiency of transforming static data structures into dynamic structures
Cites Work