Decomposable searching problems

Cited in

(68)

Cache-oblivious R-trees
Fast dynamic intersection searching in a set of isothetic line segments
On estimating the complexity of logarithmic decomposition
General methods for adding range restrictions to decomposable searching problems
Maintaining range trees in secondary memory. Part I: Partitions
Maintaining range trees is secondary memory. Part II: Lower bounds
Some principles for dynamizing decomposable searching problems
Two general methods for dynamizing decomposable searching problems
General methods for 'all elements' and 'all pairs' problems
Worst-case optimal insertion and deletion methods for decomposable searching problems
Optimal dynamization of decomposable searching problems
Maintenance of configurations in the plane
Divided \(k-d\) trees
Efficient partition trees
Geometric applications of posets
Rectilinear Steiner tree heuristics and minimum spanning tree algorithms using geographic nearest neighbors
An algorithm to compute bounds for the star discrepancy
Lagrangian particle method for compressible fluid dynamics
The range 1 query (R1Q) problem
Data structures in real-time environment
A data structure for dynamic range queries
Efficient splitting and merging algorithms for order decomposable problems.
I/O-efficient dynamic planar point location
On the power of multiple anonymous messages: frequency estimation and selection in the shuffle model of differential privacy
Online recognition of dictionary with one gap
Near-optimal algorithms for shortest paths in weighted unit-disk graphs
A limit field for orthogonal range searches in two-dimensional random point search trees
On the difficulty of range searching.
An optimal algorithm for \(L_1\) shortest paths in unit-disk graphs
Succinct and Implicit Data Structures for Computational Geometry
A technique for adding range restrictions to generalized searching problems
On prefix/suffix-square free words
Improved points approximation algorithms based on simplicial thickness data structures
An optimal time and minimal space algorithm for rectangle intersection problems
Space efficient data structures for dynamic orthogonal range counting
Lower bounds on the efficiency of transforming static data structures into dynamic structures
Reasoning about visibility
Using persistent data structures for adding range restrictions to searching problems
Efficient splitting and merging algorithms for order decomposable problems
An application of m-ary trees to the design of data structures for geometric searching problems
Efficient maximum matching algorithms for trapezoid graphs
Fast diameter computation within split graphs
Dynamic partition trees
On the difficulty of range searching
Static and dynamic algorithms for k-point clustering problems
A New Lower Bound for Semigroup Orthogonal Range Searching
Near-Optimal Algorithms for Shortest Paths in Weighted Unit-Disk Graphs.
Concatenable segment trees (extended abstract)
Geometric applications of posets
Rooted Uniform Monotone Minimum Spanning Trees
Space Efficient Multi-dimensional Range Reporting
Maintaining multiple representations of dynamic data structures
A series of algorithmic results related to the iterated hairpin completion
Range updates and range sum queries on multidimensional points with monoid weights
Dynamic convex hulls under window-sliding updates
Data Structures for Data-Intensive Applications: Tradeoffs and Design Guidelines
Balancing graph Voronoi diagrams with one more vertex
Hierarchical categories in colored searching
Sum-of-local-effects data structures for separable graphs
An improved algorithm for shortest paths in weighted unit-disk graphs
Dynamic convex hulls under window-sliding updates
On space efficient two dimensional range minimum data structures
Pargeo: a library for parallel computational geometry
Competitive data-structure dynamization
An almost optimal edit distance oracle
Compact and succinct data structures for multidimensional orthogonal range searching
Dynamic partition trees
Dynamic fractional cascading

This page was built for publication: Decomposable searching problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1256856)