Ranking and unranking bordered and unbordered words
From MaRDI portal
Publication:6121434
DOI10.1016/j.ipl.2023.106452arXiv2305.03000MaRDI QIDQ6121434
Publication date: 26 March 2024
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2305.03000
Cites Work
- String overlaps, pattern matching, and nontransitive games
- Periods in strings
- Ranking and unranking permutations in linear time
- Ranking binary unlabelled necklaces in polynomial time
- Ranking and unranking fixed-density necklaces and Lyndon words
- Practical algorithms to rank necklaces, Lyndon words, and de Bruijn sequences
- A fast string searching algorithm
- Linear-Time Ranking of Permutations
- Enumerating, Ranking and Unranking Binary Trees
- Ranking and Unranking of AVL-Trees
- Perturbations of Shifts of Finite Type
- Ranking and Unranking of 2-3 Trees
- Fast Pattern Matching in Strings
- A note on bifix-free sequences (Corresp.)
- Ranking and unranking of B-trees
