Maintaining range trees is secondary memory. Part II: Lower bounds
From MaRDI portal
Publication:1120282
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
Analysis of algorithms and problem complexity (68Q25) Searching and sorting (68P10) Data structures (68P05) Information storage and retrieval of data (68P20)
Related Items
Cites Work