Embedding small digraphs and permutations in binary trees and split trees

DOI10.4230/LIPIcs.AofA.2018.9zbMath1482.05003arXiv1901.02328OpenAlexW2809600437MaRDI QIDQ4993531

Tony Johansson, Fiona Skerman, Cecilia Holmgren, Michael Henry Albert

Publication date: 15 June 2021

Full work available at URL: https://arxiv.org/abs/1901.02328

zbMATH Keywords

permutationscumulantrandom treesinversionssplit trees

Mathematics Subject Classification ID

Trees (05C05) Permutations, words, matrices (05A05) Combinatorial probability (60C05)

Related Items (1)

Embedding small digraphs and permutations in binary trees and split trees

Uses Software

• Quicksort

Cites Work

• Novel characteristics of split trees by use of renewal theory
• The total path length of split trees
• Weighted height of random trees
• Quad trees: A data structure for retrieval by composite keys
• Universal Limit Laws for Depths in Random Trees
• Unnamed Item

This page was built for publication: Embedding small digraphs and permutations in binary trees and split trees