The CRT is the scaling limit of unordered binary trees

From MaRDI portal
Revision as of 16:47, 8 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:5198666

DOI10.1002/RSA.20332zbMath1223.05027arXiv0902.4570OpenAlexW2036271708MaRDI QIDQ5198666

Jean-François Marckert, Grégory Miermont

Publication date: 9 August 2011

Published in: Random Structures & Algorithms (Search for Journal in Brave)

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




Related Items (16)




Cites Work




This page was built for publication: The CRT is the scaling limit of unordered binary trees