๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Counting and randomly generating binary trees

โœ Scribed by James F. Korsh

Publisher
Elsevier Science
Year
1993
Tongue
English
Weight
269 KB
Volume
45
Category
Article
ISSN
0020-0190

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Generating binary trees at random
Generating binary trees at random
โœ M.D. Atkinson; J.-R. Sack ๐Ÿ“‚ Article ๐Ÿ“… 1992 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 260 KB
Parallel Algorithms for Counting and Ran
Parallel Algorithms for Counting and Randomly Generating Integer Partitions
โœ Laura A. Sanchis; Matthew B. Squire ๐Ÿ“‚ Article ๐Ÿ“… 1996 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 228 KB

This paper presents parallel algorithms for determining the number of partitions of a given integer N, where the partitions may be subject to restrictions, such as being composed of distinct parts, of a given number of parts, and/or of parts belonging to a specified set. We present a series of adapt

Uniform Generation of Binary Trees in Pa
Uniform Generation of Binary Trees in Parallel
โœ M.D. Atkinson; J.R. Sack ๐Ÿ“‚ Article ๐Ÿ“… 1994 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 245 KB

An unbiased random generator for binary trees is developed for a CREW-PRAM. The generator is capable of generating a binary tree on \(n\) nodes in time \(O(\log n)\), space \(O(n)\), with \(O(n)\) processors; it is also capable of generating various related combinatorial objects. O 1994 Academic Pre