Pages that link to "Item:Q2397155"
From MaRDI portal
The following pages link to Practical algorithms to rank necklaces, Lyndon words, and de Bruijn sequences (Q2397155):
Displayed 5 items.
- Ranking binary unlabelled necklaces in polynomial time (Q2112175) (← links)
- Ranking and unranking fixed-density necklaces and Lyndon words (Q2272399) (← links)
- Finding the largest fixed-density necklace and Lyndon word (Q2628279) (← links)
- Ranking and unranking bordered and unbordered words (Q6121434) (← links)
- Ranking and Unranking k-Subsequence Universal Words (Q6134861) (← links)