Pages that link to "Item:Q1255323"
From MaRDI portal
The following pages link to A fast equivalence-checking algorithm for circular lists (Q1255323):
Displaying 6 items.
- A note on a simple computation of the maximal suffix of a string (Q396649) (← links)
- A randomized algorithm for checking equivalence of circular lists (Q599509) (← links)
- Lexicographically least circular substrings (Q1144948) (← links)
- Canonical representations of partial 2- and 3-trees (Q1196453) (← links)
- Canonical representations of partial 2-and 3-trees (Q5056113) (← links)
- Quantum algorithm for lexicographically minimal string rotation (Q6151147) (← links)