Embedding small digraphs and permutations in binary trees and split trees (Q2292861): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
Import241208061232 (talk | contribs)
Normalize DOI.
 
(One intermediate revision by one other user not shown)
Property / DOI
 
Property / DOI: 10.1007/s00453-019-00667-5 / rank
Normal rank
 
Property / cites work
 
Property / cites work: Embedding small digraphs and permutations in binary trees and split trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rooted forests that avoid sets of permutations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Inversions in Split Trees and Conditional Galton–Watson Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Enumerating alternating trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Universal Limit Laws for Depths in Random Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quad trees: A data structure for retrieval by composite keys / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the analysis of linear probing hashing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Enumeration of trees by inversions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quicksort / rank
 
Normal rank
Property / cites work
 
Property / cites work: Novel characteristics of split trees by use of renewal theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Runs in labelled trees and mappings / rank
 
Normal rank
Property / cites work
 
Property / cites work: The inversion enumerator for labeled trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Limiting distributions for the number of inversions in labelled tree families / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5521185 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalized parking functions, tree inversions, and multicolored graphs / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/S00453-019-00667-5 / rank
 
Normal rank

Latest revision as of 20:45, 17 December 2024

scientific article
Language Label Description Also known as
English
Embedding small digraphs and permutations in binary trees and split trees
scientific article

    Statements

    Embedding small digraphs and permutations in binary trees and split trees (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    6 February 2020
    0 references
    random trees
    0 references
    split trees
    0 references
    permutations
    0 references
    inversions
    0 references
    cumulants
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references