Pages that link to "Item:Q1899224"
From MaRDI portal
The following pages link to Finding all periods and initial palindromes of a string in parallel (Q1899224):
Displaying 18 items.
- Transforming comparison model lower bounds to the parallel-random-access-machine (Q287050) (← links)
- Counting distinct palindromes in a word in linear time (Q407601) (← links)
- Efficient retrieval of approximate palindromes in a run-length encoded string (Q428850) (← links)
- Parallel detection of all palindromes in a string (Q673783) (← links)
- Fast parallel string prefix-matching (Q674342) (← links)
- Searching for gapped palindromes (Q1038475) (← links)
- Parallel finding all initial palindromes and periods of a string on reconfigurable meshes (Q1266305) (← links)
- Testing string superprimitivity in parallel (Q1318749) (← links)
- String powers in trees (Q1679231) (← links)
- Finding approximate palindromes in strings (Q1860243) (← links)
- Palindromic subsequence automata and longest common palindromic subsequence (Q2363997) (← links)
- Palindromic decompositions with gaps and errors (Q2399364) (← links)
- Time-space trade-offs for longest common extensions (Q2442815) (← links)
- Time-Space Trade-Offs for Longest Common Extensions (Q2904502) (← links)
- Searching for Gapped Palindromes (Q3506939) (← links)
- Efficient string matching on packed texts (Q4341037) (← links)
- Optimal parallel algorithms for periods, palindromes and squares (Q5204325) (← links)
- Palindromic Decompositions with Gaps and Errors (Q5384622) (← links)
