Adding range restriction capability to dynamic data structures
From MaRDI portal
Publication:3766892
Cited in
(53)- Sum-of-local-effects data structures for separable graphs
- Triangles and girth in disk graphs and transmission graphs
- Connected component and simple polygon intersection searching
- Hidden surface removal for \(c\)-oriented polyhedra
- A data structure for dynamic range queries
- A deterministic skip list for \(k\)-dimensional range search
- Dynamic deferred data structuring
- Hidden surface removal for rectangles
- Maintaining multiple representations of dynamic data structures
- A new approach to the dynamic maintenance of maximal points in a plane
- A technique for adding range restrictions to generalized searching problems
- Fast algorithms for collision and proximity problems involving moving geometric objects
- Towards using computational methods for real-time negotiations in electronic commerce
- Computing a poset from its realizer
- Efficient top-\(k\) queries for orthogonal ranges
- Dynamic Trees and Dynamic Point Location
- Dynamic fractional cascading
- Dynamic output-sensitive hidden surface removal for \(c\)-oriented polyhedra
- Efficient algorithms for finding a longest common increasing subsequence
- Resolving SINR Queries in a Dynamic Setting
- Independent sets and hitting sets of bicolored rectangular families
- Connected dominating sets on dynamic geometric graphs
- Computing rectangle enclosures
- OPTIMAL FACILITY LOCATION UNDER VARIOUS DISTANCE FUNCTIONS
- Further results on generalized intersection searching problems: Counting, reporting, and dynamization
- A density control algorithm for doing insertions and deletions in a sequentially ordered file in a good worst-case time
- Approximate colored range and point enclosure queries
- Approximate covering detection among content-based subscriptions using space filling curves
- Dynamic orthogonal range queries in OLAP.
- Resolving SINR queries in a dynamic setting
- Maintaining range trees is secondary memory. Part II: Lower bounds
- Lower bounds for the addition-subtraction operations in orthogonal range queries and related problems
- Persistence, randomization and parallelization: On some combinatorial games and their applications (abstract)
- Efficient splitting and merging algorithms for order decomposable problems.
- Data structures in real-time environment
- Straight-path queries in trajectory data
- New upper bounds for generalized intersection searching problems
- Near-optimal quantum algorithms for string problems
- On the representation of the search region in multi-objective optimization
- Efficient splitting and merging algorithms for order decomposable problems
- Dynamic Euclidean minimum spanning trees and extrema of binary functions
- Space efficient data structures for dynamic orthogonal range counting
- Using persistent data structures for adding range restrictions to searching problems
- An algorithm for handling many relational calculus queries efficiently.
- Efficient dynamic algorithms for some geometric intersection problems
- Maximum matchings in geometric intersection graphs
- On-line updating of solutions to a class of matroid intersection problems
- An application of $m$-ary trees to the design of data structures for geometric searching problems
- Maintaining range trees in secondary memory. Part I: Partitions
- Online timestamped text indexing
- General methods for adding range restrictions to decomposable searching problems
- Divided \(k-d\) trees
- Kinetic spanners in \(\mathbb R^{d}\)
This page was built for publication: Adding range restriction capability to dynamic data structures
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3766892)
