Practical algorithms to rank necklaces, Lyndon words, and de Bruijn sequences (Q2397155): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.jda.2017.01.003 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2586556622 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The standard factorization of Lyndon words: an average point of view / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lexicographically least circular substrings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast Algorithms to Generate Necklaces, Unlabeled Necklaces, and Irreducible Polynomials over GF(2) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Factorizing words over an ordered alphabet / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lexicographic compositions and de Bruijn sequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: Necklaces of beads in k colors and k-ary de Bruijn sequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5626468 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ranking and Unranking of 2-3 Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ranking and unranking of B-trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing k-th Lyndon Word and Decoding Lexicographically Minimal de Bruijn Sequence / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient Indexing of Necklaces and Irreducible Polynomials over Finite Fields / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5519904 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ranking and Unranking of AVL-Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3154677 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ranking and unranking permutations in linear time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Enumerating, Ranking and Unranking Binary Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4144192 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generating necklaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generating Bracelets in Constant Amortized Time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ranking and Listing Algorithms for <i>k</i>-Ary Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: A unified setting for sequencing, ranking, and selection algorithms for combinatorial objects / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Unified Setting for Selection Algorithms (II) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ranking Algorithms for Lists of Partitions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4135546 / rank
 
Normal rank

Latest revision as of 22:06, 13 July 2024

scientific article
Language Label Description Also known as
English
Practical algorithms to rank necklaces, Lyndon words, and de Bruijn sequences
scientific article

    Statements

    Practical algorithms to rank necklaces, Lyndon words, and de Bruijn sequences (English)
    0 references
    0 references
    0 references
    29 May 2017
    0 references
    0 references
    necklace
    0 references
    Lyndon word
    0 references
    de Bruijn sequence
    0 references
    ranking
    0 references
    unranking
    0 references
    0 references