Pages that link to "Item:Q3766892"
From MaRDI portal
The following pages link to Adding range restriction capability to dynamic data structures (Q3766892):
Displaying 50 items.
- Computing a poset from its realizer (Q287260) (← links)
- A technique for adding range restrictions to generalized searching problems (Q293144) (← links)
- Online timestamped text indexing (Q294884) (← links)
- On the representation of the search region in multi-objective optimization (Q319674) (← links)
- Approximate covering detection among content-based subscriptions using space filling curves (Q362593) (← links)
- Space efficient data structures for dynamic orthogonal range counting (Q390134) (← links)
- Kinetic spanners in \(\mathbb R^{d}\) (Q540440) (← links)
- Maintaining multiple representations of dynamic data structures (Q582046) (← links)
- Connected dominating sets on dynamic geometric graphs (Q691774) (← links)
- A new approach to the dynamic maintenance of maximal points in a plane (Q751238) (← links)
- Dynamic fractional cascading (Q908708) (← links)
- Dynamic deferred data structuring (Q917273) (← links)
- Hidden surface removal for rectangles (Q918209) (← links)
- Efficient dynamic algorithms for some geometric intersection problems (Q918702) (← links)
- Efficient algorithms for finding a longest common increasing subsequence (Q996830) (← links)
- Approximate colored range and point enclosure queries (Q1018093) (← links)
- On-line updating of solutions to a class of matroid intersection problems (Q1090461) (← links)
- General methods for adding range restrictions to decomposable searching problems (Q1118417) (← links)
- Maintaining range trees in secondary memory. Part I: Partitions (Q1120266) (← links)
- Maintaining range trees is secondary memory. Part II: Lower bounds (Q1120282) (← links)
- Lower bounds for the addition-subtraction operations in orthogonal range queries and related problems (Q1124391) (← links)
- Fast algorithms for collision and proximity problems involving moving geometric objects (Q1126250) (← links)
- Divided \(k-d\) trees (Q1180539) (← links)
- A density control algorithm for doing insertions and deletions in a sequentially ordered file in a good worst-case time (Q1187029) (← links)
- Hidden surface removal for \(c\)-oriented polyhedra (Q1194308) (← links)
- Dynamic output-sensitive hidden surface removal for \(c\)-oriented polyhedra (Q1196293) (← links)
- Dynamic Euclidean minimum spanning trees and extrema of binary functions (Q1346130) (← links)
- Dynamic orthogonal range queries in OLAP. (Q1401285) (← links)
- A deterministic skip list for \(k\)-dimensional range search (Q1772103) (← links)
- Data structures in real-time environment (Q1825636) (← links)
- A data structure for dynamic range queries (Q1838844) (← links)
- Efficient splitting and merging algorithms for order decomposable problems. (Q1854311) (← links)
- Towards using computational methods for real-time negotiations in electronic commerce (Q1869452) (← links)
- An algorithm for handling many relational calculus queries efficiently. (Q1872707) (← links)
- Connected component and simple polygon intersection searching (Q1918994) (← links)
- Independent sets and hitting sets of bicolored rectangular families (Q2032357) (← links)
- Computing rectangle enclosures (Q2365809) (← links)
- Straight-path queries in trajectory data (Q2634714) (← links)
- Efficient Top-k Queries for Orthogonal Ranges (Q3078389) (← links)
- Resolving SINR Queries in a Dynamic Setting (Q3387759) (← links)
- Dynamic Trees and Dynamic Point Location (Q4210167) (← links)
- Using persistent data structures for adding range restrictions to searching problems (Q4362274) (← links)
- Efficient splitting and merging algorithms for order decomposable problems (Q4571990) (← links)
- New upper bounds for generalized intersection searching problems (Q4645201) (← links)
- An application of $m$-ary trees to the design of data structures for geometric searching problems (Q4730791) (← links)
- OPTIMAL FACILITY LOCATION UNDER VARIOUS DISTANCE FUNCTIONS (Q4762912) (← links)
- (Q5002834) (← links)
- Persistence, randomization and parallelization: On some combinatorial games and their applications (abstract) (Q5060121) (← links)
- Further results on generalized intersection searching problems: Counting, reporting, and dynamization (Q5060128) (← links)
- (Q5075809) (← links)
