The following pages link to W. F. Smyth (Q232403):
Displaying 50 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)
- A simple fast hybrid pattern-matching algorithm (Q925062) (← links)
- Two-pattern strings. II: Frequency of occurrence and substring complexity (Q925072) (← links)
- How many runs can a string contain? (Q935160) (← links)
- Lempel-Ziv factorization using less time \& space (Q942991) (← links)
- Fast pattern-matching on indeterminate strings (Q954954) (← links)
- Algorithms for the reduction of matrix bandwidth and profile (Q1066617) (← links)
- Closed form expressions for the iterated floor function (Q1182869) (← links)
- Optimal algorithms for computing the canonical form of a circular string (Q1190455) (← links)
- Graphs of maximum diameter (Q1193709) (← links)
- Parallel RAM algorithms for factorizing words (Q1325834) (← links)
- Repetitive perhaps, but certainly not boring (Q1583539) (← links)
- Lyndon array construction during Burrows-Wheeler inversion (Q1632505) (← links)
- Reconstructing a string from its Lyndon arrays (Q1698704) (← links)
- Constructing an indeterminate string from its associated graph (Q1698711) (← links)
- String covering with optimal covers (Q1757464) (← links)
- Computing regularities in strings: a survey (Q1761494) (← links)
- Two-pattern strings. I: A recognition algorithm (Q1827270) (← links)
- A family of sparse graphs of large sum number (Q1894767) (← links)
- Computation of the suffix array, Burrows-Wheeler transform and FM-index in \(V\)-order (Q2043023) (← links)
- A new approach to regular \& indeterminate strings (Q2220865) (← links)
- Off-line and on-line algorithms for closed string factorization (Q2326384) (← links)
- Applications of \(V\)-order: suffix arrays, the Burrows-Wheeler transform \& the FM-index (Q2327532) (← links)
- More properties of the Fibonacci word on an infinite alphabet (Q2330118) (← links)
- Inferring an indeterminate string from a prefix graph (Q2343296) (← links)
- Three overlapping squares: the general case characterized \& applications (Q2355701) (← links)
- More results on overlapping squares (Q2376782) (← links)
- Counting Lyndon factors (Q2401409) (← links)
- A bijective variant of the Burrows-Wheeler transform using \(V\)-order (Q2441784) (← links)
- On optimum summable graphs (Q2508410) (← links)
- Simple Linear Comparison of Strings in V-order* (Q2805461) (← links)
- Prefix Table Construction and Conversion (Q2870015) (← links)
- A comparison of index-based lempel-Ziv LZ77 factorization algorithms (Q2875093) (← links)
- Fast and Simple Computations Using Prefix Tables Under Hamming and Edit Distance (Q2946041) (← links)
- Large-scale detection of repetitions (Q2955637) (← links)
- String Comparison and Lyndon-Like Factorization Using V-Order in Linear Time (Q3011844) (← links)
- (Q3024803) (← links)
- (Q3027040) (← links)
