Pages that link to "Item:Q4140392"
From MaRDI portal
The following pages link to A Linear-Time On-Line Recognition Algorithm for ``Palstar'' (Q4140392):
Displayed 17 items.
- Counting the palstars (Q405318) (← links)
- Parallel detection of all palindromes in a string (Q673783) (← links)
- Palindromic rich words and run-length encodings (Q738876) (← links)
- Steady-paced-output and fractional-on-line algorithms on a RAM (Q1170881) (← links)
- Usefulness of the Karp-Miller-Rosenberg algorithm in parallel computations on strings and arrays (Q1177175) (← links)
- The derivation of on-line algorithms, with an application to finding palindromes (Q1314430) (← links)
- EERTREE: an efficient data structure for processing palindromes in strings (Q1678105) (← links)
- Finding maximal 2-dimensional palindromes (Q1740657) (← links)
- Detecting leftmost maximal periodicities (Q1825029) (← links)
- Tight tradeoffs for real-time approximation of longest palindromes in streams (Q2319637) (← links)
- Palindromic decompositions with gaps and errors (Q2399364) (← links)
- (Q5089256) (← links)
- Detecting One-Variable Patterns (Q5150937) (← links)
- Counting Palindromes in Substrings (Q5150941) (← links)
- Palindromic Decompositions with Gaps and Errors (Q5384622) (← links)
- Finding Palindromes: Variants and Algorithms (Q5410458) (← links)
- Maximal degenerate palindromes with gaps and mismatches (Q6073887) (← links)