Orthogonal range searching in linear and almost-linear space
type: Item
instance of: scholarly article
title: Orthogonal range searching in linear and almost-linear space
zbMATH Open document ID: 1170.68012
author: Yakov Nekrich
published in: Computational Geometry
publication date: 2009-03-09T00:00:00Z
Mathematics Subject Classification ID: 68P05
Mathematics Subject Classification ID: 68U05
zbMATH DE Number: 5526416
zbMATH Keywords: geometric data structures
zbMATH Keywords: dynamic data structures
zbMATH Keywords: orthogonal range searching
MaRDI profile type: Publication
full work available at URL: j.comgeo.2008.09.001
OpenAlex ID: W2028689405
cites work: Optimal static range reporting in one dimension
cites work: Optimal External Memory Interval Management
cites work: Q4411355
cites work: Cache-Oblivious B-Trees
cites work: Multidimensional divide-and-conquer
cites work: Q5501237
cites work: Q3579414
cites work: A Functional Approach to Data Structures and Its Use in Multidimensional Searching
cites work: Universal codeword sets and representations of the integers
cites work: Preserving order in a forest in less than logarithmic time and linear space
cites work: Design and implementation of an efficient priority queue
cites work: Divided \(k-d\) trees
cites work: Fully Dynamic Orthogonal Range Reporting on RAM
cites work: On dynamic range reporting in one dimension
cites work: Space efficient dynamic orthogonal range reporting
cites work: Q3549595
cites work: Q5501238
cites work: A class of algorithms which require nonlinear time to maintain disjoint sets
cites work: A density control algorithm for doing insertions and deletions in a sequentially ordered file in a good worst-case time
cites work: Should Tables Be Sorted?
DOI: 10.1016/J.COMGEO.2008.09.001
description: scientific article; zbMATH DE number 5526416