Pages that link to "Item:Q1118417"
From MaRDI portal
The following pages link to General methods for adding range restrictions to decomposable searching problems (Q1118417):
Displayed 8 items.
- A technique for adding range restrictions to generalized searching problems (Q293144) (← links)
- Efficient splitting and merging algorithms for order decomposable problems. (Q1854311) (← links)
- Connected component and simple polygon intersection searching (Q1918994) (← 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)
- Simplex Range Searching and Its Variants: A Review (Q4604367) (← links)
- Connected component and simple polygon intersection searching (Q5060096) (← links)
- Data Structures for Data-Intensive Applications: Tradeoffs and Design Guidelines (Q6180227) (← links)