Introduction Let P be a finite set of points in R d and Q a query range in R d .
New Data Structures for Orthogonal Range Searching. S. Alstrup, G.S. Brodal, T. Rauhe. New Data Structures for Orthogonal Range Searching. On data structures and asymmetric communication complexity - Miltersen, Nisan et al. Doc 3 time and linear space using addition - Thorup, in et al.