Towards Tight Lower Bounds for Range Reporting on the RAM.
From MaRDI portal
Publication:4598233
DOI10.4230/LIPICS.ICALP.2016.92zbMath1388.68086arXiv1411.0644OpenAlexW2963321552MaRDI QIDQ4598233
Allan Grønlund, Kasper Green Larsen
Publication date: 19 December 2017
Full work available at URL: https://arxiv.org/abs/1411.0644
Analysis of algorithms and problem complexity (68Q25) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Data structures (68P05)
This page was built for publication: Towards Tight Lower Bounds for Range Reporting on the RAM.