Pages that link to "Item:Q2250458"
From MaRDI portal
The following pages link to Efficient counting of square substrings in a tree (Q2250458):
Displaying 10 items.
- Efficiently computing runs on a trie (Q820550) (← links)
- String powers in trees (Q1679231) (← links)
- Squares, cubes, and time-space efficient string searching (Q1894296) (← links)
- String covers of a tree (Q2146126) (← links)
- String Powers in Trees (Q2942264) (← links)
- Computing runs on a trie (Q5088914) (← links)
- Fast Counting with Bounded Treewidth (Q5505573) (← links)
- Tight bound for the number of distinct palindromes in a tree (Q6042101) (← links)
- A new linear-time algorithm for centroid decomposition (Q6536262) (← links)
- String covers of a tree revisited (Q6545440) (← links)