Pages that link to "Item:Q1838844"
From MaRDI portal
The following pages link to A data structure for dynamic range queries (Q1838844):
Displaying 7 items.
- Lower bounds for the addition-subtraction operations in orthogonal range queries and related problems (Q1124391) (← links)
- A density control algorithm for doing insertions and deletions in a sequentially ordered file in a good worst-case time (Q1187029) (← links)
- Dynamic Euclidean minimum spanning trees and extrema of binary functions (Q1346130) (← links)
- A deterministic skip list for \(k\)-dimensional range search (Q1772103) (← links)
- An algorithm for handling many relational calculus queries efficiently. (Q1872707) (← links)
- An optimal time and minimal space algorithm for rectangle intersection problems (Q3318126) (← links)
- An application of $m$-ary trees to the design of data structures for geometric searching problems (Q4730791) (← links)
