AbstractThe problem of palindrome recognition using a Turing machine with one multidimensional tape is proved to require Θ(n2/logn) time
We consider the question of finding the longest palindrome in a text of length n in the streaming mo...
The detection of palindromes is a classical and well-studied problem in computer science, language t...
An algorithm is presented which will determine whether any string w in Σ*, of length n, is contained...
AbstractThe problem of palindrome recognition using a Turing machine with one multidimensional tape ...
AbstractA real-time Turing machine algorithm that finds the smallest nontrivial initial palindrome i...
This paper presents two efficient concurrent-read concurrent-write parallel algorithms that find all...
This paper presents two efficient concurrent-read concurrent-write parallel algorithms that find all...
AbstractThis paper presents two efficient concurrent-read concurrent-write parallel algorithms that ...
A theory for the derivation of on-line algorithms is presented. The algorithms are derived in the B...
A palindrome is defined as a string which reads forwards the same as backwards, like, for example, t...
Let L be a language recognized by a nondeterministic (single-tape) Turing machine of time complexity...
[[abstract]]Palindromes are strings of symbols that read the same forward and backward. Palindromes ...
SIGLECopy held by FIZ Karlsruhe; available from UB/TIB Hannover / FIZ - Fachinformationszzentrum Kar...
It is shown that (1) every context-free language is T(n) = n4-recognizable by a single-tape Turing m...
We consider computing a longest palindrome in the streaming model, where the symbols arrive one-by-o...
We consider the question of finding the longest palindrome in a text of length n in the streaming mo...
The detection of palindromes is a classical and well-studied problem in computer science, language t...
An algorithm is presented which will determine whether any string w in Σ*, of length n, is contained...
AbstractThe problem of palindrome recognition using a Turing machine with one multidimensional tape ...
AbstractA real-time Turing machine algorithm that finds the smallest nontrivial initial palindrome i...
This paper presents two efficient concurrent-read concurrent-write parallel algorithms that find all...
This paper presents two efficient concurrent-read concurrent-write parallel algorithms that find all...
AbstractThis paper presents two efficient concurrent-read concurrent-write parallel algorithms that ...
A theory for the derivation of on-line algorithms is presented. The algorithms are derived in the B...
A palindrome is defined as a string which reads forwards the same as backwards, like, for example, t...
Let L be a language recognized by a nondeterministic (single-tape) Turing machine of time complexity...
[[abstract]]Palindromes are strings of symbols that read the same forward and backward. Palindromes ...
SIGLECopy held by FIZ Karlsruhe; available from UB/TIB Hannover / FIZ - Fachinformationszzentrum Kar...
It is shown that (1) every context-free language is T(n) = n4-recognizable by a single-tape Turing m...
We consider computing a longest palindrome in the streaming model, where the symbols arrive one-by-o...
We consider the question of finding the longest palindrome in a text of length n in the streaming mo...
The detection of palindromes is a classical and well-studied problem in computer science, language t...
An algorithm is presented which will determine whether any string w in Σ*, of length n, is contained...
DOI
Add to ORKG