The following pages link to Sorted Range Reporting (Q2904563):
Displaying 35 items.
- Fast construction of wavelet trees (Q294942) (← links)
- Order-preserving indexing (Q294954) (← links)
- Closed factorization (Q313756) (← links)
- Compact binary relation representations with rich functionality (Q386006) (← links)
- Two-dimensional range successor in optimal time and almost linear space (Q894470) (← links)
- Position-restricted substring searching over small alphabets (Q1679612) (← links)
- The heaviest induced ancestors problem: better data structures and applications (Q2149106) (← links)
- String indexing for top-\(k\) close consecutive occurrences (Q2163391) (← links)
- I/O-efficient data structures for non-overlapping indexing (Q2220773) (← links)
- Reporting and counting maximal points in a query orthogonal rectangle (Q2253906) (← links)
- Succinct non-overlapping indexing (Q2285052) (← links)
- Ranked document selection (Q2297857) (← links)
- On hardness of several string indexing problems (Q2342674) (← links)
- Improved and extended locating functionality on compressed suffix arrays (Q2343300) (← links)
- Top-\(k\) term-proximity in succinct space (Q2362352) (← links)
- Range selection and predecessor queries in data aware space and time (Q2397147) (← links)
- Generalized substring compression (Q2437745) (← links)
- On reporting the \(L_1\) metric closest pair in a query rectangle (Q2446069) (← links)
- Gapped indexing for consecutive occurrences (Q2696274) (← links)
- Orthogonal Range Searching for Text Indexing (Q2848980) (← links)
- Array Range Queries (Q2848983) (← links)
- Succinct Non-overlapping Indexing (Q2942256) (← links)
- Efficient range searching for categorical and plain data (Q2943571) (← links)
- Space-Efficient Frameworks for Top- <i>k</i> String Retrieval (Q3189644) (← links)
- (Q5116480) (← links)
- Non-Overlapping Indexing - Cache Obliviously (Q5140770) (← links)
- The Heaviest Induced Ancestors Problem Revisited (Q5140784) (← links)
- (Q5874525) (← links)
- Sublinear-time reductions for big data computing (Q5918726) (← links)
- A linear-space data structure for range-LCP queries in poly-logarithmic time (Q5918832) (← links)
- Linear space adaptive data structures for planar range reporting (Q5964824) (← links)
- Sublinear-time reductions for big data computing (Q5970839) (← links)
- Non-overlapping indexing in BWT-runs bounded space (Q6545434) (← links)
- Wheeler maps (Q6547930) (← links)
- Internal pattern matching queries in a text and applications (Q6621750) (← links)
