Maintaining range trees is secondary memory. Part II: Lower bounds

DOI10.1007/BF00289019zbMath0672.68020OpenAlexW2032660345MaRDI QIDQ1120282

Mark H. Overmars, Michiel H. M. Smid

Publication date: 1990

Published in: Acta Informatica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf00289019

zbMATH Keywords

data structurelower bounds for partitions

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Searching and sorting (68P10) Data structures (68P05) Information storage and retrieval of data (68P20)

Related Items (1)

Topology B-trees and their applications

Cites Work

• Maintaining range trees in secondary memory. Part I: Partitions
• Decomposable searching problems
• Adding range restriction capability to dynamic data structures
• Unnamed Item

This page was built for publication: Maintaining range trees is secondary memory. Part II: Lower bounds