Finding all the palindromes in a binary tree in linear time and space (Q1201867): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Usefulness of the Karp-Miller-Rosenberg algorithm in parallel computations on strings and arrays / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Finding all the palindromes in a binary tree in linear time and space / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4140367 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Two fast simulations which imply some fast string matching and palindrome-recognition algorithms / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Fast Pattern Matching in Strings / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A New Linear-Time ``On-Line'' Algorithm for Finding the Smallest Initial Palindrome of a String / rank | |||
Normal rank |
Latest revision as of 14:13, 17 May 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Finding all the palindromes in a binary tree in linear time and space |
scientific article |
Statements
Finding all the palindromes in a binary tree in linear time and space (English)
0 references
17 January 1993
0 references
design of algorithms
0 references
tree matching
0 references
palindrome
0 references
0 references
0 references