The following pages link to (Q5417615):
Displaying 28 items.
- Discrete coalescent trees (Q96722) (← links)
- Fast construction of wavelet trees (Q294942) (← links)
- Order-preserving indexing (Q294954) (← links)
- Entropy-bounded representation of point grids (Q390358) (← links)
- Top-\(k\) Manhattan spatial skyline queries (Q522965) (← links)
- Faster algorithms for computing the R* consensus tree (Q727985) (← links)
- Dynamic layers of maxima with applications to dominating queries (Q827327) (← links)
- The range 1 query (R1Q) problem (Q1659997) (← links)
- An \(O(n^2\log m)\)-time algorithm for the boxed-mesh permutation pattern matching problem (Q1698703) (← links)
- Flexible level-1 consensus ensuring stable social choice: analysis and algorithms (Q1703364) (← links)
- Constructing the R* consensus tree of two trees in subcubic time (Q1950390) (← links)
- The multi-parent biased random-key genetic algorithm with implicit path-relinking and its real-world applications (Q2028795) (← links)
- Internal dictionary matching (Q2037109) (← links)
- Smallest \(k\)-enclosing rectangle revisited (Q2046452) (← links)
- Persistent homology in \(\ell_\infty\) metric (Q2064022) (← links)
- Fast algorithms for the rooted triplet distance between caterpillars (Q2140512) (← links)
- Linear-space data structures for range mode query in arrays (Q2254510) (← links)
- Counting inversions adaptively (Q2348707) (← links)
- Orthogonal range searching in moderate dimensions: k-d trees and range trees strike back (Q2415385) (← links)
- Biased range trees (Q2428657) (← links)
- Smallest k-enclosing rectangle revisited (Q5088950) (← links)
- (Q5115793) (← links)
- (Q5874525) (← links)
- Syntactic view of sigma-tau generation of permutations (Q5918363) (← links)
- (Q6065422) (← links)
- Absent Subsequences in Words (Q6070611) (← links)
- Computing longest Lyndon subsequences and longest common Lyndon subsequences (Q6119829) (← links)
- Longest bordered and periodic subsequences (Q6161459) (← links)
