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. (C) 1994 Academic Press, Inc.</p
Simulations on parallel computors require distinct streams of pseudo-random deviates for each proces...
Abstract — The necessity of random number generators is found in numerous applications like simulati...
AbstractUniform random generators deliver a simple empirical means to estimate the average complexit...
An unbiased random generator for binary trees is developed for a CREW-PRAM. The generator is capable...
We describe several RNC algorithms for generating graphs and subgraphs uniformly at random. For exam...
Motzkin trees are also called unary-binary trees. This paper proposes a linear algorithm for uniform...
We present a linear algorithm which generates randomly and with uniform probability many kinds of tr...
We present a linear-time sequential algorithm for the construction of a binary tree, given its preor...
We present a linear-time sequential algorithm for the construction of a binary tree, given its preor...
International audienceGeneralizing an idea used by Alonso to generate uniformly at random Motzkin wo...
International audienceGeneralizing an idea used by Alonso to generate uniformly at random Motzkin wo...
International audienceA binary unordered tree is a tree where each internal node has two children an...
International audienceGeneralizing an idea used by Alonso to generate uniformly at random Motzkin wo...
International audienceGeneralizing an idea used by Alonso to generate uniformly at random Motzkin wo...
A widely used class of binary trees is studied in order to provide information useful in evaluating ...
Simulations on parallel computors require distinct streams of pseudo-random deviates for each proces...
Abstract — The necessity of random number generators is found in numerous applications like simulati...
AbstractUniform random generators deliver a simple empirical means to estimate the average complexit...
An unbiased random generator for binary trees is developed for a CREW-PRAM. The generator is capable...
We describe several RNC algorithms for generating graphs and subgraphs uniformly at random. For exam...
Motzkin trees are also called unary-binary trees. This paper proposes a linear algorithm for uniform...
We present a linear algorithm which generates randomly and with uniform probability many kinds of tr...
We present a linear-time sequential algorithm for the construction of a binary tree, given its preor...
We present a linear-time sequential algorithm for the construction of a binary tree, given its preor...
International audienceGeneralizing an idea used by Alonso to generate uniformly at random Motzkin wo...
International audienceGeneralizing an idea used by Alonso to generate uniformly at random Motzkin wo...
International audienceA binary unordered tree is a tree where each internal node has two children an...
International audienceGeneralizing an idea used by Alonso to generate uniformly at random Motzkin wo...
International audienceGeneralizing an idea used by Alonso to generate uniformly at random Motzkin wo...
A widely used class of binary trees is studied in order to provide information useful in evaluating ...
Simulations on parallel computors require distinct streams of pseudo-random deviates for each proces...
Abstract — The necessity of random number generators is found in numerous applications like simulati...
AbstractUniform random generators deliver a simple empirical means to estimate the average complexit...
DOI
Add to ORKG