The generation of binary trees as a numerical problem

DOI10.1145/128749.128753MaRDI QIDQ4302813zbMATH OpenOpenAlexWikidataFDO

Authors Renzo Sprugnoli

Publication date 21 August 1994

Published in Journal of the ACM (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/128749.128753

zbMATH Keywords

generation of binary treesrandom trees

Mathematics Subject Classification ID

Data structures (68P05) Combinatorics in computer science (68R05) Parallel algorithms in computer science (68W10)

Recommendations

• scientific article; zbMATH DE number 3900794
• Generating random binary trees -- a survey
• Generating binary trees at random
• The generation of random, binary unordered trees

Cited in

(31)

• Generating binary trees by Glivenko classes on Tamari lattices
• The generation of random, binary unordered trees
• Generating binary trees at random
• Uniform generation of forests of restricted height
• Uniform generation of binary trees in parallel
• On generating \(k\)-ary trees in computer representation
• Generating random binary trees -- a survey
• Efficient random sampling of binary and unary-binary trees via holonomic equations
• Generating strictly binary trees at random based on convex polygon triangulations
• Uniform generation of a Schröder tree
• Generating and enumerating digitally convex sets of trees
• Random generation using binomial approximations
• Generating rooted trees of m nodes uniformly at random
• Uniformly random tree generation
• scientific article; zbMATH DE number 3900794 (Why is no real title available?)
• Towards a More Precise Analysis of an Algorithm to Generate Binary Trees: A Tutorial
• A note on the generation of binary trees
• Generating binary trees in A-order from codewords defined on a four-letter alphabet
• Interval algorithm for random number generation
• A Tree for Generating Bernoulli Numbers
• A Comparison of Random Binary Tree Generators
• Building uniformly random subtrees
• On the Generation of Random Binary Search Trees
• Clean reversible simulations of ranking binary trees
• On the probability distribution of the values of binary trees
• Fast random generation of binary, t-ary and other types of trees
• Counting labels in binary trees
• Holonomic equations and efficient random generation of binary trees
• Simple random sampling of binary forests with fixed number of nodes and trees
• Simple random sampling of binary forests with fixed number of nodes and trees
• Generating binary trees with uniform probability

This page was built for publication: The generation of binary trees as a numerical problem

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