The spanning bound as a measure of range query complexity

DOI10.1016/0196-6774(81)90009-2zbMATH Open0456.68026OpenAlexW2082123814MaRDI QIDQ3906396FDOQ3906396

Authors: Michael L. Fredman 

Publication date: 1981

Published in: Journal of Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0196-6774(81)90009-2

zbMATH Keywords

complexity of data structures

Mathematics Subject Classification ID

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

Cited In (1)

• Lower bounds for the addition-subtraction operations in orthogonal range queries and related problems

This page was built for publication: The spanning bound as a measure of range query complexity

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