Some principles for dynamizing decomposable searching problems

DOI10.1016/0020-0190(81)90077-6MaRDI QIDQ1149253zbMATH OpenOpenAlexFDO

Authors Mark H. Overmars, J. Van Leeuwen

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/15902

zbMATH Keywords

data structuresdesign of efficient algorithmsdynamization method

Mathematics Subject Classification ID

Searching and sorting (68P10) Analysis of algorithms and problem complexity (68Q25)

Cites work

• Decomposable searching problems
• scientific article; zbMATH DE number 3303654 (Why is no real title available?)
• Two general methods for dynamizing decomposable searching problems

Cited in

(5)

• General methods for 'all elements' and 'all pairs' problems
• Optimal dynamization of decomposable searching problems
• Efficient splitting and merging algorithms for order decomposable problems.
• Efficient splitting and merging algorithms for order decomposable problems
• AN EFFICIENT PARALLEL ALGORITHM FOR THE ASSIGNMENT PROBLEM ON THE PLANE∗

This page was built for publication: Some principles for dynamizing decomposable searching problems

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