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 29 items.
- Efficient dynamic range searching using data replication (Q293421) (← links)
- 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)
- Linear space data structures for two types of range search (Q578916) (← links)
- Improved data structures for the orthogonal range successor problem (Q617543) (← links)
- Compact and succinct data structures for multidimensional orthogonal range searching (Q776842) (← links)
- Non-orthogonal homothetic range partial-sum query on integer grids (extended abstract) (Q777306) (← links)
- Two-dimensional range successor in optimal time and almost linear space (Q894470) (← links)
- Orthogonal queries in segments (Q1355726) (← links)
- A new framework for addressing temporal range queries and some preliminary results (Q1770382) (← links)
- Dynamic path queries in linear space (Q1799220) (← links)
- Quasi-optimal range searching in spaces of finite VC-dimension (Q1823698) (← links)
- The fine-grained complexity of multi-dimensional ordering properties (Q2093566) (← links)
- The \(n\)-dimensional \(k\)-vector and its application to orthogonal range searching (Q2287830) (← links)
- Orthogonal range searching in moderate dimensions: k-d trees and range trees strike back (Q2415385) (← links)
- Compressed text indexing with wildcards (Q2434928) (← links)
- Space efficient dynamic orthogonal range reporting (Q2461544) (← links)
- Array Range Queries (Q2848983) (← links)
- Succinct Orthogonal Range Search Structures on a Grid with Applications to Text Indexing (Q3183444) (← links)
- Colored Range Searching in Linear Space (Q3188897) (← links)
- Submatrix Maximum Queries in Monge Matrices Are Equivalent to Predecessor Search (Q3448817) (← links)
- Orthogonal Range Searching in Moderate Dimensions: k-d Trees and Range Trees Strike Back (Q4580101) (← links)
- On the difficulty of range searching (Q5057458) (← links)
- Faster Linear-space Orthogonal Range Searching in Arbitrary Dimensions (Q5232525) (← links)
- Efficient Data Structures for the Orthogonal Range Successor Problem (Q5323054) (← links)
- Orthogonal range searching on the RAM, revisited (Q5404401) (← links)
- Sublinear time Lempel-Ziv (LZ77) factorization (Q6545423) (← links)