Optimal dynamization of decomposable searching problems

DOI10.1016/0020-0190(81)90010-7MaRDI QIDQ1153688zbMATH OpenOpenAlexFDO

Authors Mark H. Overmars, K. 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

zbMATH Keywords

automatic transformation of static data structures into dynamic data structuressearching algorithms

Mathematics Subject Classification ID

Data structures (68P05) Searching and sorting (68P10) Algorithms in computer science (68W99)

Cites work

• Decomposable searching problems
• Some principles for dynamizing decomposable searching problems
• Two general methods for dynamizing decomposable searching problems

Cited in

(7)

• 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
• 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

This page was built for publication: Optimal dynamization of decomposable searching problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1153688)