Adding range restriction capability to dynamic data structures

Cited In (53)

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

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)