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
β¦ LIBER β¦
On Rotations and the Generation of Binary Trees
β Scribed by J.M. Lucas; D.R. Vanbaronaigien; F. Ruskey
- Publisher
- Elsevier Science
- Year
- 1993
- Tongue
- English
- Weight
- 789 KB
- Volume
- 15
- Category
- Article
- ISSN
- 0196-6774
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
Uniform Generation of Binary Trees in Pa
β
M.D. Atkinson; J.R. Sack
π
Article
π
1994
π
Elsevier Science
π
English
β 245 KB
Counting and randomly generating binary
β
James F. Korsh
π
Article
π
1993
π
Elsevier Science
π
English
β 269 KB
TwistβRotation Transformations of Binary
β
Ming Li; Louxin Zhang
π
Article
π
1999
π
Elsevier Science
π
English
β 101 KB
The paper studies the computational complexity and efficient algorithms for the twistαrotation transformations of binary trees, which is equivalent to the transformation of arithmetic expressions over an associative and commutative binary Ε½ . operation. The main results are 1 a full binary tree with
Simulation of Binary Trees and X-Trees o
β
A. Dingle; I.H. Sudborough
π
Article
π
1993
π
Elsevier Science
π
English
β 425 KB
Efficient generation of binary trees fro
β
M.C. Er
π
Article
π
1986
π
Elsevier Science
π
English
β 395 KB
Comments on computing the similarity of
β
J.P. Jarvis; J.K. Luedeman; D.R. Shier
π
Article
π
1983
π
Elsevier Science
π
English
β 358 KB