Generating t-ary trees in A-order
Information Processing Letters
The design and analysis of parallel algorithms
The design and analysis of parallel algorithms
Efficient generation of k-ary trees in natural order
The Computer Journal - Special issue on information retrieval
An optimal systolic algorithm for generating permutations in lexicographic order
Journal of Parallel and Distributed Computing
A numbering system for binary trees
Communications of the ACM
Generating t-ary trees in parallel
Nordic Journal of Computing
Hi-index | 0.00 |
We present a new parallel algorithm for generating binary trees; it generates trees in A-order using A-sequences representation. This algorithm is adaptive and cost-optimal and is executed on a shared memory multiprocessor. We know of no other parallel algorithm in the literature that generates trees in A-order. This parallel algorithm is designed based on a presented sequential generation algorithm for A-sequences, with O(1) average time complexity.