Results 231 to 240 of about 5,925 (246)

On the Generation of Random Binary Search Trees

SIAM Journal on Computing, 1995
Summary: We consider the computer generation of random binary search trees with \(n\) nodes for the standard random permutation model. The algorithms discussed here output the number of external nodes at each level, but not the shape of the tree. This is important, for example, when one wishes to simulate the height of the binary search tree.
Luc Devroye, J. M. Robson
openaire   +1 more source

A Comparison of Random Binary Tree Generators

The Computer Journal, 2002
Summary: This paper empirically compares five linear-time algorithms for generating unbiased random binary trees. More specifically, we compare the relative asymptotic performance of the algorithms in terms of the numbers of various basic operations executed on average per tree node.
Jarmo Siltaneva, Erkki Mäkinen
openaire   +2 more sources

Parallel Generation of Binary Search Trees

IEEE Transactions on Computers, 1974
A method of constructing binary search trees in a multiprocessor computer system is proposed. Asymptotically, this method achieves the maximum possible increase in speed as compared with a single processor computer system. To make better use of this method, a parametrized restructuring of binary search trees is also discussed.
C. K. Wong, Shi-Kuo Chang
openaire   +1 more source

Binary generalized synchronization

Chaos, Solitons & Fractals, 2016
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Alexey A. Koronovskii, Olga I. Moskalenko, Vladimir I. Ponomarenko, Mikhail D. Prokhorov, Alexander E. Hramov   +4 more
openaire   +1 more source

Generating and counting binary bent sequences

IEEE Transactions on Information Theory, 1990
Two general classes of binary bent sequences, bent-based and linear-based, are introduced. Algorithms that allow easy generation of bent sequences from either class are given. Based on some simple computation and a computer search, the authors conjecture a lower bound on the total number of binary bent sequences of a given order.
Carlisle M. Adams, Stafford E. Tavares
openaire   +2 more sources

Generating binary trees of bounded height

Acta Informatica, 1986
We present a new encoding scheme for binary trees with n internal nodes whose heights are bounded by a given value h, \(h\geq \lceil \log_ 2(n+1)\rceil\). The scheme encodes the internal nodes of the tree level by level and enables us to develop an algorithm for generating all binary trees within this class in a certain predetermined order ...
C. C. Lee 0002, D. T. Lee, C. K. Wong
openaire   +1 more source

GENERALIZED COMPOSITION OF BINARY AGGREGATION OPERATORS

International Journal of Uncertainty, Fuzziness and Knowledge-Based Systems, 2005
We study a construction method for binary aggregation operators that generalizes the classical composition. Several examples are given, specially, in the class of aggregation operators with neutral element 1, e.g. semicopulas and copulas.
openaire   +2 more sources

Generation of Unordered Binary Trees

2004
A binary unordered tree is a tree where each internal node has two children and the relative order of the subtrees of a node is not important (i.e. two trees are different if they differ only in the respective ordering of subtrees of nodes). We present a new method to generate all binary rooted unordered trees with n internal nodes, without ...
openaire   +2 more sources

Generating random binary trees — A survey

Information Sciences, 1999
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +2 more sources

Some generalizations of the calculus of binary events

Computing, 1997
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +1 more source