The following pages link to Decomposable searching problems (Q1256856):
Displayed 11 items.
- Static and dynamic algorithms for k-point clustering problems (Q5060119) (← links)
- A New Lower Bound for Semigroup Orthogonal Range Searching (Q5088928) (← links)
- Near-Optimal Algorithms for Shortest Paths in Weighted Unit-Disk Graphs. (Q5088993) (← links)
- Concatenable segment trees (Q5096181) (← links)
- Geometric Applications of Posets (Q5096956) (← links)
- Rooted Uniform Monotone Minimum Spanning Trees (Q5283385) (← links)
- Space Efficient Multi-dimensional Range Reporting (Q5323066) (← links)
- Range updates and range sum queries on multidimensional points with monoid weights (Q6110077) (← links)
- Dynamic convex hulls under window-sliding updates (Q6139052) (← links)
- Data Structures for Data-Intensive Applications: Tradeoffs and Design Guidelines (Q6180227) (← links)
- Balancing graph Voronoi diagrams with one more vertex (Q6196878) (← links)