On estimating the complexity of logarithmic decomposition

DOI10.1016/0020-0190(88)90190-1zbMath0665.68009OpenAlexW2048495815MaRDI QIDQ1116321

Jan van Leeuwen, Marc Bezem

Publication date: 1988

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(88)90190-1

zbMATH Keywords

smoothnessdynamic data structuresbinary representation

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Data structures (68P05)

Cites Work

• Unnamed Item
• The design of dynamic data structures
• Decomposable searching problems
• Decomposable searching problems I. Static-to-dynamic transformation

This page was built for publication: On estimating the complexity of logarithmic decomposition