The following pages link to W. F. Smyth (Q232403):
Displaying 17 items.
- Computing covers using prefix tables (Q313747) (← links)
- The new periodicity lemma revisited (Q313759) (← links)
- A note on easy and efficient computation of full abelian periods of a word (Q313772) (← links)
- \(V\)-order: new combinatorial properties \& a simple comparison algorithm (Q323035) (← links)
- A linear partitioning algorithm for hybrid Lyndons using \(V\)-order (Q390899) (← links)
- Enhanced string covering (Q393116) (← links)
- The three squares lemma revisited (Q414439) (← links)
- Indeterminate strings, prefix arrays \& undirected graphs (Q496001) (← links)
- A prefix array for parameterized strings (Q511148) (← links)
- New complexity results for the \(k\)-covers problem (Q545371) (← links)
- Fast, practical algorithms for computing all the repeats in a string (Q626893) (← links)
- A fast and effective heuristic for the feedback arc set problem (Q688447) (← links)
- A new approach to the periodicity lemma on strings with holes (Q732016) (← links)
- Evaluating Measure of Program Quality (Q4723283) (← links)
- A storage scheme for hierarchic structures (Q4768620) (← links)
- (Q5267518) (← links)
- String Covering: A Survey (Q6145625) (← links)
