The following pages link to Decomposable searching problems (Q1256856):
Displayed 50 items.
- A technique for adding range restrictions to generalized searching problems (Q293144) (← links)
- Space efficient data structures for dynamic orthogonal range counting (Q390134) (← links)
- Reasoning about visibility (Q420853) (← links)
- Maintaining multiple representations of dynamic data structures (Q582046) (← links)
- A series of algorithmic results related to the iterated hairpin completion (Q606982) (← links)
- On space efficient two dimensional range minimum data structures (Q692632) (← links)
- Compact and succinct data structures for multidimensional orthogonal range searching (Q776842) (← links)
- Dynamic partition trees (Q804289) (← links)
- Dynamic fractional cascading (Q908708) (← links)
- Cache-oblivious R-trees (Q1017905) (← links)
- Fast dynamic intersection searching in a set of isothetic line segments (Q1065550) (← links)
- On estimating the complexity of logarithmic decomposition (Q1116321) (← 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)
- Some principles for dynamizing decomposable searching problems (Q1149253) (← links)
- Two general methods for dynamizing decomposable searching problems (Q1149778) (← links)
- General methods for 'all elements' and 'all pairs' problems (Q1151265) (← links)
- Worst-case optimal insertion and deletion methods for decomposable searching problems (Q1152223) (← links)
- Optimal dynamization of decomposable searching problems (Q1153688) (← links)
- Maintenance of configurations in the plane (Q1158972) (← links)
- Divided \(k-d\) trees (Q1180539) (← links)
- Efficient partition trees (Q1199132) (← links)
- Geometric applications of posets (Q1276942) (← links)
- Rectilinear Steiner tree heuristics and minimum spanning tree algorithms using geographic nearest neighbors (Q1343464) (← links)
- An algorithm to compute bounds for the star discrepancy (Q1347864) (← links)
- Lagrangian particle method for compressible fluid dynamics (Q1640858) (← links)
- The range 1 query (R1Q) problem (Q1659997) (← 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)
- I/O-efficient dynamic planar point location (Q1882856) (← links)
- On the power of multiple anonymous messages: frequency estimation and selection in the shuffle model of differential privacy (Q2056803) (← links)
- Online recognition of dictionary with one gap (Q2216131) (← links)
- Near-optimal algorithms for shortest paths in weighted unit-disk graphs (Q2223616) (← links)
- A limit field for orthogonal range searches in two-dimensional random point search trees (Q2274287) (← links)
- On the difficulty of range searching. (Q2482904) (← links)
- An optimal algorithm for \(L_1\) shortest paths in unit-disk graphs (Q2678259) (← links)
- Succinct and Implicit Data Structures for Computational Geometry (Q2848977) (← links)
- On Prefix/Suffix-Square Free Words (Q2949834) (← links)
- Improved Points Approximation Algorithms Based on Simplicial Thickness Data Structures (Q3000523) (← links)
- An optimal time and minimal space algorithm for rectangle intersection problems (Q3318126) (← links)
- Lower bounds on the efficiency of transforming static data structures into dynamic structures (Q3940857) (← 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)
- An application of $m$-ary trees to the design of data structures for geometric searching problems (Q4730791) (← links)
- Efficient maximum matching algorithms for trapezoid graphs (Q5006595) (← links)
- Fast Diameter Computation within Split Graphs (Q5024674) (← links)
- Dynamic partition trees (Q5056121) (← links)
- On the difficulty of range searching (Q5057458) (← links)