Pages that link to "Item:Q2931388"
From MaRDI portal
The following pages link to Time-space trade-offs for predecessor search (Q2931388):
Displaying 40 items.
- Optimal encodings for range majority queries (Q270016) (← links)
- Longest common extensions in trees (Q294947) (← links)
- Entropy-bounded representation of point grids (Q390358) (← links)
- Space-efficient data-analysis queries on grids (Q390915) (← links)
- Optimal indexes for sparse bit vectors (Q472491) (← links)
- Substring range reporting (Q517792) (← links)
- Biased predecessor search (Q727976) (← links)
- I/O-efficient 2-d orthogonal range skyline and attrition priority queues (Q827322) (← links)
- A note on predecessor searching in the pointer machine model (Q989469) (← links)
- The nearest colored node in a tree (Q1698706) (← links)
- Universal compressed text indexing (Q1729689) (← links)
- Building an optimal point-location structure in \(O(\operatorname{sort}(n))\) I/Os (Q1741853) (← links)
- Approximate query processing over static sets and sliding windows (Q1981762) (← links)
- Faster compressed quadtrees (Q2084740) (← links)
- Adaptive succinctness (Q2118203) (← links)
- Block trees (Q2221797) (← links)
- Dynamic interpolation search revisited (Q2288214) (← links)
- Compressed data structures: Dictionaries and data-aware measures (Q2465063) (← links)
- Lower bounds for predecessor searching in the cell probe model (Q2475409) (← links)
- Minimal indices for predecessor search (Q2514143) (← links)
- Fully Functional Static and Dynamic Succinct Trees (Q2799480) (← links)
- Longest Common Extensions in Trees (Q2942245) (← links)
- Efficient range searching for categorical and plain data (Q2943571) (← links)
- Substring Range Reporting (Q3011863) (← links)
- Hashed Patricia Trie: Efficient Longest Prefix Matching in Peer-to-Peer Systems (Q3078395) (← links)
- Connectivity Oracles for Graphs Subject to Vertex Failures (Q3387763) (← links)
- Submatrix Maximum Queries in Monge Matrices Are Equivalent to Predecessor Search (Q3448817) (← links)
- (Q5002701) (← links)
- (Q5009638) (← links)
- Nearly Optimal Static Las Vegas Succinct Dictionary (Q5080480) (← links)
- (Q5091256) (← links)
- (Q5111686) (← links)
- LZ-End Parsing in Linear Time (Q5111742) (← links)
- (Q5121915) (← links)
- Succinct Color Searching in One Dimension (Q5136249) (← links)
- (Q5136312) (← links)
- (Q5874525) (← links)
- Efficient and compact representations of some non-canonical prefix-free codes (Q5918490) (← links)
- Finding top-\(k\) longest palindromes in substrings (Q6057835) (← links)
- Predecessor on the Ultra-Wide Word RAM (Q6492089) (← links)
