Pages that link to "Item:Q1194333"
From MaRDI portal
The following pages link to Optimal parallel detection of squares in strings (Q1194333):
Displaying 11 items.
- Efficient detection of quasiperiodicities in strings (Q688155) (← links)
- An efficient algorithm for online square detection (Q860815) (← links)
- Efficient parallel algorithms to test square-freeness and factorize strings (Q1178198) (← links)
- String-matching on ordered alphabets (Q1190451) (← links)
- Efficient CRCW-PRAM algorithms for universal substring searching (Q1208721) (← links)
- Testing string superprimitivity in parallel (Q1318749) (← links)
- Squares, cubes, and time-space efficient string searching (Q1894296) (← links)
- Optimal discovery of repetitions in 2D (Q2573235) (← links)
- Un réseau linéaire pour la reconnaissance des mots sans carré (Q3789096) (← links)
- Efficient string matching on packed texts (Q4341037) (← links)
- Optimal parallel algorithms for periods, palindromes and squares (Q5204325) (← links)