Binary search trees of permuton samples

DOI10.4230/LIPICS.AOFA.2024.21MaRDI QIDQ6865674zbMATH OpenFDO

Authors Benoît Corsini, Valentin Féray

Publication date 30 January 2026

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.4230/LIPICS.AOFA.2024.21

zbMATH Keywords

binary search treespermutonsrandom permutations

Mathematics Subject Classification ID

Analysis of algorithms (68W40)

Cites work

• A note on limits of sequences of binary trees
• A note on the height of binary search trees
• Entropy and maximal spacings for random partitions
• scientific article; zbMATH DE number 5988004 (Why is no real title available?)
• scientific article; zbMATH DE number 1354815 (Why is no real title available?)
• Large deviation principle for random permutations
• Limiting curves for i.i.d. records
• Limits of permutation sequences
• Locally uniform random permutations with large increasing subsequences
• Monotone subsequences in locally uniform random permutations
• The height of Mallows trees
• The height of record‐biased trees
• Universal limits of substitution-closed permutation classes

This page was built for publication: Binary search trees of permuton samples

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6865674)