Amortized Efficiency of Ranking and Unranking Left-Child Sequences in Lexicographic Order (Q2958342): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/978-3-319-48749-6_37 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2546335103 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A CAT algorithm for generating permutations with a fixed number of inversions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Loopless Algorithms for Generating Permutations, Combinations, and Other Combinatorial Configurations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Short Note: An Efficient Implementation of Permutation Backtracking in Lexicographic Order / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal lower bounds for rank and select indexes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4681162 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A loopless Gray code for rooted trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Rotations and the Generation of Binary Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Left distance binary tree representations / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Survey on Binary Tree Codings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rank and select revisited and extended / rank
 
Normal rank
Property / cites work
 
Property / cites work: Enumerating, Ranking and Unranking Binary Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Binary tree gray codes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generating <i>t</i>-Ary Trees Lexicographically / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Survey of Combinatorial Gray Codes / 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: On the loopless generation of binary tree sequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: A loopless algorithm for generating binary tree sequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: A loopless algorithm for generating multiple binary tree sequences simultaneously / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ranking and unranking of non-regular trees with a prescribed branching sequence / rank
 
Normal rank
Property / cites work
 
Property / cites work: A linear time algorithm for binary tree sequences transformation using left-arm and right-arm rotations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient loopless generation of Gray codes for \(k\)-ary trees. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lexicographic generation of ordered trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generating Trees and Other Combinatorial Objects Lexicographically / rank
 
Normal rank

Latest revision as of 08:31, 13 July 2024

scientific article
Language Label Description Also known as
English
Amortized Efficiency of Ranking and Unranking Left-Child Sequences in Lexicographic Order
scientific article

    Statements

    Amortized Efficiency of Ranking and Unranking Left-Child Sequences in Lexicographic Order (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    1 February 2017
    0 references
    binary trees
    0 references
    left-child sequences
    0 references
    lexicographic order
    0 references
    ranking algorithms
    0 references
    unranking algorithms
    0 references
    amortized cost
    0 references
    0 references
    0 references

    Identifiers