Pages that link to "Item:Q915434"
From MaRDI portal
The following pages link to Bounded ordered dictionaries in O(log log N) time and O(n) space (Q915434):
Displaying 17 items.
- Substring range reporting (Q517792) (← links)
- Four results on randomized incremental constructions (Q686138) (← links)
- Biased predecessor search (Q727976) (← links)
- Point location in fat subdivisions (Q1209353) (← links)
- Efficient labelling algorithms for the maximum noncrossing matching problem (Q1315996) (← links)
- Dynamic relative compression, dynamic partial sums, and substring concatenation (Q1755738) (← links)
- Linked dynamic tries with applications to LZ-compression in sublinear time and space (Q2350903) (← links)
- Fast and compact regular expression matching (Q2378530) (← links)
- Fingerprints in compressed strings (Q2396828) (← links)
- Algorithms for three-dimensional dominance searching in linear space. (Q2583568) (← links)
- On the longest upsequence problem for permutations (Q2731076) (← links)
- Optimal Partition of a Bipartite Graph with Prescribed Layout into Non-Crossing b-Matchings (Q3439389) (← links)
- Using persistent data structures for adding range restrictions to searching problems (Q4362274) (← links)
- Two- and three- dimensional point location in rectangular subdivisions (Q5056154) (← links)
- An algorithm for finding predecessors in integer sets (Q5060139) (← links)
- Four results on randomized incremental constructions (Q5096803) (← links)
- A new metric between polygons, and how to compute it (Q5204335) (← links)
