Pages that link to "Item:Q3777465"
From MaRDI portal
The following pages link to Efficient data structures for range searching on a grid (Q3777465):
Displaying 11 items.
- Computing a poset from its realizer (Q287260) (← links)
- Fast local searches and updates in bounded universes (Q691776) (← links)
- Scanline algorithms on a grid (Q1111020) (← links)
- The range 1 query (R1Q) problem (Q1659997) (← links)
- An algorithm for handling many relational calculus queries efficiently. (Q1872707) (← links)
- Dynamic planar range skyline queries in log logarithmic expected time (Q2203584) (← links)
- Compressing dictionary matching index via sparsification technique (Q2354027) (← links)
- Dynamic 3-sided planar range queries with expected doubly-logarithmic time (Q2437762) (← links)
- Efficient range searching for categorical and plain data (Q2943571) (← links)
- Succinct Orthogonal Range Search Structures on a Grid with Applications to Text Indexing (Q3183444) (← links)
- Using persistent data structures for adding range restrictions to searching problems (Q4362274) (← links)