The following pages link to On Hardness of Jumbled Indexing (Q5167735):
Displaying 16 items.
- Permuted scaled matching (Q294926) (← links)
- Fast algorithms for abelian periods in words and greatest common divisor queries (Q340577) (← links)
- Algorithms for jumbled indexing, jumbled border and jumbled square on run-length encoded strings (Q507391) (← links)
- Efficient indexes for jumbled pattern matching with constant-sized alphabet (Q524375) (← links)
- Weighted prefix normal words: mind the gap (Q832931) (← links)
- Binary jumbled pattern matching on trees and tree-like structures (Q893318) (← links)
- Hardness of RNA folding problem with four symbols (Q1711829) (← links)
- Generating a Gray code for prefix normal words in amortized polylogarithmic time per word (Q2006779) (← links)
- Subquadratic algorithms for algebraic 3SUM (Q2415376) (← links)
- Gapped indexing for consecutive occurrences (Q2696274) (← links)
- (Q4638059) (← links)
- (Q5009597) (← links)
- (Q5088893) (← links)
- On Multidimensional and Monotone k-SUM (Q5111265) (← links)
- Improved Bounds for 3SUM, k-SUM, and Linear Degeneracy (Q5111730) (← links)
- How fast can we play Tetris greedily with rectangular pieces? (Q6149495) (← links)
