The following pages link to (Q4763432):
Displayed 22 items.
- Periodicity in rectangular arrays (Q344541) (← links)
- Efficient retrieval of approximate palindromes in a run-length encoded string (Q428850) (← links)
- 2D Lyndon words and applications (Q513297) (← links)
- Fast searching in packed strings (Q533408) (← links)
- Two-dimensional pattern matching by sampling (Q685522) (← links)
- A general compression algorithm that supports fast searching (Q845872) (← links)
- Hardness of comparing two run-length encoded strings (Q990818) (← links)
- Alphabet-independent optimal parallel search for three-dimensional patterns (Q1275083) (← links)
- Inplace run-length 2d compressed search. (Q1401164) (← links)
- Fibonacci arrays and their two-dimensional repetitions (Q1566729) (← links)
- Plane digitization and related combinatorial problems (Q1775618) (← links)
- On Fine and Wilf's theorem for bidimensional words. (Q1853743) (← links)
- Collage system: A unifying framework for compressed pattern matching. (Q1874240) (← links)
- On a conjecture on bidimensional words. (Q1874389) (← links)
- Motif patterns in 2D (Q2474071) (← links)
- Optimal discovery of repetitions in 2D (Q2573235) (← links)
- A multidimensional critical factorization theorem (Q2581347) (← links)
- Bidirectional adaptive compression (Q2689643) (← links)
- Optimal Parallel Searching an Array for Certain Repetitions (Q3438903) (← links)
- Fast Searching in Packed Strings (Q3637108) (← links)
- Optimal two-dimensional compressed matching (Q4632428) (← links)
- On linear-time alphabet-independent 2-dimensional pattern matching (Q5096334) (← links)