Pages that link to "Item:Q5404401"
From MaRDI portal
The following pages link to Orthogonal range searching on the RAM, revisited (Q5404401):
Displaying 50 items.
- Document retrieval with one wildcard (Q287451) (← links)
- Fast construction of wavelet trees (Q294942) (← links)
- Less space: indexing for queries with wildcards (Q300263) (← links)
- Compact binary relation representations with rich functionality (Q386006) (← links)
- Extracting powers and periods in a word from its runs structure (Q389938) (← links)
- Sequential dependency computation via geometric data structures (Q390107) (← links)
- Entropy-bounded representation of point grids (Q390358) (← links)
- Compressed indexes for text with wildcards (Q390873) (← links)
- Space-efficient data-analysis queries on grids (Q390915) (← links)
- Group nearest-neighbor queries in the \(L_1\) plane (Q500965) (← links)
- Substring range reporting (Q517792) (← links)
- Fast local searches and updates in bounded universes (Q691776) (← links)
- Optimal deterministic algorithms for 2-d and 3-d shallow cuttings (Q728495) (← links)
- Two-dimensional range successor in optimal time and almost linear space (Q894470) (← links)
- Kinetic \(k\)-semi-Yao graph and its applications (Q1622343) (← links)
- The range 1 query (R1Q) problem (Q1659997) (← links)
- Position-restricted substring searching over small alphabets (Q1679612) (← links)
- Time-space trade-offs for Lempel-Ziv compressed indexing (Q1694685) (← links)
- Dictionary matching with a bounded gap in pattern or in text (Q1709592) (← links)
- Universal compressed text indexing (Q1729689) (← links)
- Path queries on functions (Q1740690) (← links)
- Optimal deterministic shallow cuttings for 3-d dominance ranges (Q1755735) (← links)
- Flexible indexing of repetitive collections (Q2011648) (← links)
- Data structures for categorical path counting queries (Q2089697) (← links)
- The fine-grained complexity of multi-dimensional ordering properties (Q2093566) (← links)
- An LMS-based grammar self-index with local consistency properties (Q2146131) (← links)
- The heaviest induced ancestors problem: better data structures and applications (Q2149106) (← links)
- Dynamic and internal longest common substring (Q2211363) (← links)
- Dynamic geometric data structures via shallow cuttings (Q2223621) (← links)
- Ranked document selection (Q2297857) (← links)
- Two approaches to building time-windowed geometric data structures (Q2319633) (← links)
- On hardness of several string indexing problems (Q2342674) (← links)
- Dictionary matching with a few gaps (Q2346375) (← links)
- On constant factors in comparison-based geometric algorithms and data structures (Q2349854) (← links)
- Succinct indices for path minimum, with applications (Q2362355) (← links)
- On position restricted substring searching in succinct space (Q2376796) (← links)
- Orthogonal range searching in moderate dimensions: k-d trees and range trees strike back (Q2415385) (← links)
- Compressed text indexing with wildcards (Q2434928) (← links)
- Generalized substring compression (Q2437745) (← links)
- Wavelet trees for all (Q2442812) (← links)
- Fast relative Lempel-Ziv self-index for similar sequences (Q2445867) (← links)
- On reporting the \(L_1\) metric closest pair in a query rectangle (Q2446069) (← links)
- Grammar-compressed indexes with logarithmic search time (Q2656171) (← links)
- Internal shortest absent word queries in constant time and linear space (Q2672592) (← links)
- Succinct and Implicit Data Structures for Computational Geometry (Q2848977) (← links)
- Orthogonal Range Searching for Text Indexing (Q2848980) (← links)
- Composite Repetition-Aware Data Structures (Q2942243) (← links)
- Fast String Dictionary Lookup with One Error (Q2942250) (← links)
- Dictionary Matching with Uneven Gaps (Q2942261) (← links)
- Time-Optimal Top-$k$ Document Retrieval (Q2963583) (← links)
