Pages that link to "Item:Q1005331"
From MaRDI portal
The following pages link to Orthogonal range searching in linear and almost-linear space (Q1005331):
Displaying 13 items.
- Space efficient data structures for dynamic orthogonal range counting (Q390134) (← links)
- Space-efficient data-analysis queries on grids (Q390915) (← links)
- Towards optimal range medians (Q541663) (← links)
- Untangled monotonic chains and adaptive range search (Q553358) (← links)
- Improved data structures for the orthogonal range successor problem (Q617543) (← links)
- Dynamic path queries in linear space (Q1799220) (← links)
- The fine-grained complexity of multi-dimensional ordering properties (Q2093566) (← links)
- Compressed text indexing with wildcards (Q2434928) (← links)
- Array Range Queries (Q2848983) (← links)
- Succinct Orthogonal Range Search Structures on a Grid with Applications to Text Indexing (Q3183444) (← links)
- Submatrix Maximum Queries in Monge Matrices Are Equivalent to Predecessor Search (Q3448817) (← links)
- Efficient Data Structures for the Orthogonal Range Successor Problem (Q5323054) (← links)
- Sublinear time Lempel-Ziv (LZ77) factorization (Q6545423) (← links)
