The following pages link to Two-way string-matching (Q4302850):
Displaying 47 items.
- Necklaces and bracelets in R (Q99679) (← links)
- Simple real-time constant-space string matching (Q390869) (← links)
- A note on a simple computation of the maximal suffix of a string (Q396649) (← links)
- An algorithmic toolbox for periodic partial words (Q477348) (← links)
- On the density of Lyndon roots in factors (Q507403) (← links)
- A proof of the extended Duval's conjecture (Q557916) (← links)
- The Ehrenfeucht-Silberger problem (Q662035) (← links)
- How the character comparison order shapes the shift function of on-line pattern matching algorithms (Q671355) (← links)
- Linear-time computation of local periods (Q703549) (← links)
- Characteristic Sturmian words are extremal for the critical factorization theorem (Q714825) (← links)
- The structure of subword graphs and suffix trees of Fibonacci words (Q860864) (← links)
- The factors analysis and algorithm implementation of single-pattern matching (Q1028393) (← links)
- Unbordered partial words (Q1028413) (← links)
- Repetitions in strings: algorithms and combinatorics (Q1034529) (← links)
- Usefulness of the Karp-Miller-Rosenberg algorithm in parallel computations on strings and arrays (Q1177175) (← links)
- String-matching on ordered alphabets (Q1190451) (← links)
- Efficient CRCW-PRAM algorithms for universal substring searching (Q1208721) (← links)
- Constant-space string-matching in sublinear average time (Q1292492) (← links)
- Saving comparisons in the Crochemore-Perrin string-matching algorithm (Q1365685) (← links)
- The zooming method: A recursive approach to time-space efficient string-matching (Q1367541) (← links)
- Partial words and the critical factorization theorem (Q1770435) (← links)
- On maximal suffixes and constant-space linear-time versions of KMP algorithm. (Q1874422) (← links)
- Squares, cubes, and time-space efficient string searching (Q1894296) (← links)
- Bifix codes and Sturmian words (Q1946105) (← links)
- Indeterminate string factorizations and degenerate text transformations (Q2363995) (← links)
- String matching with simple devices (Q2380036) (← links)
- Inferring strings from Lyndon factorization (Q2402270) (← links)
- Towards optimal packed string matching (Q2437754) (← links)
- Partial words and the critical factorization theorem revisited (Q2456370) (← links)
- On unique factorizations of primitive words. (Q2490818) (← links)
- Periods in extensions of words (Q2509152) (← links)
- A multidimensional critical factorization theorem (Q2581347) (← links)
- Words with unbounded periodicity complexity (Q2934268) (← links)
- Simple Real-Time Constant-Space String Matching (Q3011852) (← links)
- Dictionary Matching in a Stream (Q3452800) (← links)
- Approximating LZ77 via Small-Space Multiple-Pattern Matching (Q3452816) (← links)
- On the Relation between Periodicity and Unbordered Factors of Finite Words (Q3533028) (← links)
- Fast parallel Lyndon factorization with applications (Q4327381) (← links)
- Density of Critical Factorizations (Q4800261) (← links)
- Generic Algorithms for Factoring Strings (Q4915247) (← links)
- Constructing Words with High Distinct Square Densities (Q5016360) (← links)
- Critical factorisation in square-free words (Q5066974) (← links)
- (Q5091170) (← links)
- Longest Lyndon Substring After Edit (Q5140783) (← links)
- Watson-Crick Conjugate and Commutative Words (Q5452701) (← links)
- Elastic-Degenerate String Matching via Fast Matrix Multiplication (Q5864665) (← links)
- Recurrence and periodicity in infinite words from local periods (Q5958124) (← links)
