Pages that link to "Item:Q1838333"
From MaRDI portal
The following pages link to Log-logarithmic worst-case range queries are possible in space theta(N) (Q1838333):
Displaying 50 items.
- Computing a poset from its realizer (Q287260) (← links)
- Order-preserving indexing (Q294954) (← links)
- Entropy-bounded representation of point grids (Q390358) (← links)
- On compressing and indexing repetitive sequences (Q390894) (← links)
- On compressing permutations and adaptive sorting (Q391981) (← links)
- Cross-document pattern matching (Q396714) (← links)
- Succinct representations of permutations and functions (Q441860) (← links)
- Worst-case efficient single and multiple string matching on packed texts in the word-RAM model (Q450552) (← links)
- Cache-oblivious index for approximate string matching (Q551183) (← links)
- Efficient index for retrieving top-\(k\) most frequent documents (Q616994) (← links)
- Faster algorithms for computing longest common increasing subsequences (Q655431) (← links)
- More efficient bottom-up multi-pattern matching in trees (Q685356) (← links)
- Improved behaviour of tries by adaptive branching (Q685503) (← links)
- Range-restricted mergeable priority queues (Q689640) (← links)
- Fast local searches and updates in bounded universes (Q691776) (← links)
- Biased predecessor search (Q727976) (← links)
- New trie data structures which support very fast search operations (Q794438) (← links)
- Bounded ordered dictionaries in O(log log N) time and O(n) space (Q915434) (← links)
- Improved approximate string matching using compressed suffix data structures (Q930602) (← links)
- Scanline algorithms on a grid (Q1111020) (← links)
- A lower bound for finding predecessors in Yao's cell probe model (Q1112590) (← links)
- A density control algorithm for doing insertions and deletions in a sequentially ordered file in a good worst-case time (Q1187029) (← links)
- On data structures and asymmetric communication complexity (Q1273860) (← links)
- Surpassing the information theoretic bound with fusion trees (Q1317486) (← links)
- The nearest colored node in a tree (Q1698706) (← links)
- Faster shortest paths in dense distance graphs, with applications (Q1698725) (← links)
- Efficient vertex-label distance oracles for planar graphs (Q1743124) (← links)
- Parallel processing can be harmful: The unusual behavior of interpolation search (Q1825662) (← links)
- Optimal bounds for the predecessor problem and related problems (Q1869935) (← links)
- Searching among intervals and compact routing tables (Q1913700) (← links)
- Flexible indexing of repetitive collections (Q2011648) (← links)
- Range minimum queries in minimal space (Q2078612) (← links)
- A comparative study of dictionary matching with gaps: limitations, techniques and challenges (Q2118199) (← links)
- The heaviest induced ancestors problem: better data structures and applications (Q2149106) (← links)
- Online parameterized dictionary matching with one gap (Q2207509) (← links)
- Online recognition of dictionary with one gap (Q2216131) (← links)
- Two-dimensional packet classification and filter conflict resolution in the internet (Q2272209) (← links)
- Indexing weighted sequences: neat and efficient (Q2288210) (← links)
- Dynamic interpolation search revisited (Q2288214) (← links)
- Efficient computation of longest single-arm-gapped palindromes in a string (Q2297859) (← links)
- Space efficient linear time algorithms for BFS, DFS and applications (Q2322695) (← links)
- Approximate periodicity (Q2343134) (← links)
- Geometric BWT: compressed text indexing via sparse suffixes and range searching (Q2346957) (← links)
- Linked dynamic tries with applications to LZ-compression in sublinear time and space (Q2350903) (← links)
- Compressing dictionary matching index via sparsification technique (Q2354027) (← links)
- Fingerprints in compressed strings (Q2396828) (← links)
- On the succinct representation of equivalence classes (Q2408100) (← links)
- Compressed text indexing with wildcards (Q2434928) (← links)
- Order-preserving matching (Q2437748) (← links)
- Fast relative Lempel-Ziv self-index for similar sequences (Q2445867) (← links)
