Pages that link to "Item:Q1190455"
From MaRDI portal
The following pages link to Optimal algorithms for computing the canonical form of a circular string (Q1190455):
Displaying 11 items.
- A linear partitioning algorithm for hybrid Lyndons using \(V\)-order (Q390899) (← links)
- Parallel RAM algorithms for factorizing words (Q1325834) (← links)
- An efficient parallel algorithm for the single function coarsest partition problem (Q1329732) (← links)
- On the language of primitive words (Q1351946) (← links)
- Sorting strings and constructing digital search trees in parallel (Q1365679) (← links)
- Lyndon-like and V-order factorizations of strings (Q1827280) (← links)
- Towards optimal packed string matching (Q2437754) (← links)
- String Comparison and Lyndon-Like Factorization Using V-Order in Linear Time (Q3011844) (← links)
- (Q5140773) (← links)
- Quantum algorithm for lexicographically minimal string rotation (Q6151147) (← links)
- Near-optimal quantum algorithms for string problems (Q6174814) (← links)
