Optimal dynamization of decomposable searching problems

DOI10.1016/0020-0190(81)90010-7zbMath0463.68056OpenAlexW2041883181MaRDI 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

zbMATH Keywords

searching algorithmsautomatic transformation of static data structures into dynamic data structures

Mathematics Subject Classification ID

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

Related Items (7)

Complexity models for incremental computation ⋮ AN EFFICIENT PARALLEL ALGORITHM FOR THE ASSIGNMENT PROBLEM ON THE PLANE∗ ⋮ Efficient splitting and merging algorithms for order decomposable problems ⋮ Worst-case optimal insertion and deletion methods for decomposable searching problems ⋮ An incremental reconstruction method for dynamic planar point location ⋮ Lower bounds on the efficiency of transforming static data structures into dynamic structures ⋮ Efficient splitting and merging algorithms for order decomposable problems.

Cites Work

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

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