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