Pages that link to "Item:Q1134522"
From MaRDI portal
The following pages link to Efficient worst-case data structures for range searching (Q1134522):
Displayed 25 items.
- Efficient dynamic range searching using data replication (Q293421) (← links)
- On the number of range queries in k-space (Q598818) (← links)
- Improved data structures for the orthogonal range successor problem (Q617543) (← links)
- On the minimum total length of interval systems expressing all intervals, and range-restricted queries (Q1000921) (← links)
- The relative neighborhood graph for mixed feature variables (Q1057662) (← links)
- The region approach for computing relative neighbourhood graphs in the \(L_ p\) metric (Q1093374) (← links)
- General methods for adding range restrictions to decomposable searching problems (Q1118417) (← links)
- Lower bounds for the addition-subtraction operations in orthogonal range queries and related problems (Q1124391) (← links)
- Polygonal intersection searching (Q1165007) (← links)
- Computing the relative neighborhood graph in the \(L_ 1\) and L//infinity metrics (Q1165014) (← links)
- Dynamic orthogonal range queries in OLAP. (Q1401285) (← links)
- The new \(k\)-windows algorithm for improving the \(k\)-means clustering algorithm (Q1599210) (← links)
- A deterministic skip list for \(k\)-dimensional range search (Q1772103) (← links)
- An algorithm for handling many relational calculus queries efficiently. (Q1872707) (← links)
- A unified algorithm for finding maximum and minimum object enclosing rectangles and cuboids (Q1894952) (← links)
- On position restricted substring searching in succinct space (Q2376796) (← links)
- Information storage and search complexity theory (Q2453382) (← links)
- On the difficulty of range searching. (Q2482904) (← links)
- Efficient data structures for adaptive remeshing with the FEM (Q2639620) (← links)
- A robust map matching method by considering memorized multiple matching candidates (Q2680854) (← links)
- Selection by rank in<i>K</i>-dimensional binary search trees (Q2877767) (← links)
- An almost naive algorithm for finding relative neighbourhood graphs in $L_p$ metrics (Q3773333) (← links)
- An application of $m$-ary trees to the design of data structures for geometric searching problems (Q4730791) (← links)
- Neighbours on a grid (Q5054822) (← links)
- On the difficulty of range searching (Q5057458) (← links)