Pages that link to "Item:Q3716298"
From MaRDI portal
The following pages link to Optimal parallel algorithms for string matching (Q3716298):
Displayed 21 items.
- Parallel detection of all palindromes in a string (Q673783) (← links)
- Fast parallel string prefix-matching (Q674342) (← links)
- A string-matching algorithm for the CREW PRAM (Q688234) (← links)
- Parallel tree pattern matching (Q912610) (← links)
- Fast string matching with k differences (Q1109574) (← links)
- Usefulness of the Karp-Miller-Rosenberg algorithm in parallel computations on strings and arrays (Q1177175) (← links)
- Efficient CRCW-PRAM algorithms for universal substring searching (Q1208721) (← links)
- Parallel finding all initial palindromes and periods of a string on reconfigurable meshes (Q1266305) (← links)
- Alphabet-independent optimal parallel search for three-dimensional patterns (Q1275083) (← links)
- On two-dimensional pattern matching by optimal parallel algorithms (Q1334677) (← links)
- Finding approximate palindromes in strings (Q1860243) (← links)
- Finding all periods and initial palindromes of a string in parallel (Q1899224) (← links)
- Fast parallel and serial multidimensional approximate array matching (Q2277849) (← links)
- Approximate periodicity (Q2343134) (← links)
- Towards optimal packed string matching (Q2437754) (← links)
- Closest periodic vectors in \(L_p\) spaces (Q2446104) (← links)
- Real-Time Streaming String-Matching (Q3011851) (← links)
- Fast parallel Lyndon factorization with applications (Q4327381) (← links)
- On the lower bound for parallel string matching (Q4332447) (← links)
- Efficient string matching on packed texts (Q4341037) (← links)
- Forty Years of Text Indexing (Q4928554) (← links)