Embedding small digraphs and permutations in binary trees and split trees (Q2292861): Difference between revisions
From MaRDI portal
Changed an Item |
Changed an Item |
||
| Property / describes a project that uses | |||
| Property / describes a project that uses: Quicksort / rank | |||
Normal rank | |||
Revision as of 05:45, 29 February 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
6 February 2020
0 references
random trees
0 references
split trees
0 references
permutations
0 references
inversions
0 references
cumulants
0 references
