The following pages link to Alessio Langiu (Q287430):
Displayed 15 items.
- Abelian powers and repetitions in Sturmian words (Q287434) (← links)
- Order-preserving indexing (Q294954) (← links)
- On parsing optimality for dictionary-based text compression -- the \texttt{Zip} case (Q396650) (← links)
- Dictionary-symbolwise flexible parsing (Q450551) (← links)
- Item:Q287430 (redirect page) (← links)
- A note on the longest common compatible prefix problem for partial words (Q491152) (← links)
- On optimal parsing for LZ78-like compressors (Q1698700) (← links)
- Note on the greedy parsing optimality for dictionary-based text compression (Q2437746) (← links)
- Compressing Big Data: When the Rate of Convergence to the Entropy Matters (Q2807846) (← links)
- Algorithms for Longest Common Abelian Factors (Q2833540) (← links)
- ON-LINE CONSTRUCTION OF A SMALL AUTOMATON FOR A FINITE SET OF WORDS (Q2909196) (← links)
- Indexing a sequence for mapping reads with a single mismatch (Q2955639) (← links)
- The longest common substring problem (Q2971067) (← links)
- Dictionary-Symbolwise Flexible Parsing (Q3000525) (← links)
- Abelian Repetitions in Sturmian Words (Q5300843) (← links)