A Constant Amortized Time Algorithm for Generating Left-Child Sequences in Lexicographic Order (Q4632217): Difference between revisions

From MaRDI portal
Created claim: Wikidata QID (P12): Q60691781, #quickstatements; #temporary_batch_1703766359865
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 4 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: OEIS / rank
 
Normal rank
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.1007/978-3-319-59605-1_20 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2618088226 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simple constant amortized time generation of fixed length numeric partitions / 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: Rotation sequences and edge-colouring of binary tree pairs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Morphing simple polygons / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4886071 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4681162 / 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: A Survey on Binary Tree Codings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Amortized Efficiency of Ranking and Unranking Left-Child Sequences in Lexicographic Order / 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: A loopless algorithm for generating binary tree sequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generating Binary 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: On the loopless generation of 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: 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: Lexicographic generation of ordered trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generating Trees and Other Combinatorial Objects Lexicographically / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 02:27, 19 July 2024

scientific article; zbMATH DE number 7048114
Language Label Description Also known as
English
A Constant Amortized Time Algorithm for Generating Left-Child Sequences in Lexicographic Order
scientific article; zbMATH DE number 7048114

    Statements

    A Constant Amortized Time Algorithm for Generating Left-Child Sequences in Lexicographic Order (English)
    0 references
    0 references
    0 references
    0 references
    26 April 2019
    0 references
    0 references
    0 references
    0 references
    0 references
    constant-amortized-time algorithm
    0 references
    binary trees
    0 references
    left-child sequences
    0 references
    lexicographic order
    0 references
    generation algorithms
    0 references
    amortized cost
    0 references
    0 references
    0 references