Uniform generation of forests of restricted height

DOI10.1016/0020-0190(94)00054-9zbMath0804.68040OpenAlexW2097280289WikidataQ62037506 ScholiaQ62037506MaRDI QIDQ1330666

Michael D. Atkinson, Jörg-Rüdiger Sack

Publication date: 21 July 1994

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(94)00054-9

zbMATH Keywords

analysis of algorithmsdesign of algorithmstreesrandom generationforestsinformation storage

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Data structures (68P05) Information storage and retrieval of data (68P20)

Related Items (1)

A workbench for computational geometry

Cites Work

• Unnamed Item
• Generating binary trees of bounded height
• The average height of binary trees and other simple trees
• Generating binary trees at random
• A method and two algorithms on the theory of partitions
• Counting and randomly generating binary trees
• Uniform Random Generation of Strings in a Context-Free Language
• On Random Binary Trees
• The generation of binary trees as a numerical problem

This page was built for publication: Uniform generation of forests of restricted height