Generating t-ary trees in parallel

Authors:
Selim G. Akl;Ivan Stojmenovic
Affiliations:
Department of Computing and Information Science, Queen's University, Kingston, Ontario, Canada K7L 3N6;Computer Science Department, University of Ottawa, Ottawa, Ontario, Canada K1N 9B4
Venue:
Nordic Journal of Computing
Year:
1996

Citing 21
Cited 4

Generating binary trees of bounded height

Acta Informatica
Constant time generation of free trees

SIAM Journal on Computing
Ranking and unranking of AVL-trees

SIAM Journal on Computing
Left distance binary tree representations

BIT
Adaptive and optimal parallel algorithms for enumerating permutations and combinations

The Computer Journal
A simple algorithm for generating non-regular trees in lexicographic order

The Computer Journal
Lexicographic listing and ranking of t-ary trees

The Computer Journal
Generating t-ary trees in A-order

Information Processing Letters
Generating ordered trees

Theoretical Computer Science - International Symposium on Mathematical Foundations of Computer Science, Bratisl
The design and analysis of parallel algorithms

The design and analysis of parallel algorithms
A random binary tree generator

CSC '89 Proceedings of the 17th conference on ACM Annual Computer Science Conference
An optimal algorithm for generating equivalence relations on a linear array of processors

BIT
A loopless algorithm for generating binary tree sequences

Information Processing Letters
A survey on binary tree codings

The Computer Journal - Special issue on data structures
Systolic generation of derangements

Proceedings of the international workshop on Algorithms and parallel VLSI architectures II
On rotations and the generation of binary trees

Journal of Algorithms
An optimal systolic algorithm for generating permutations in lexicographic order

Journal of Parallel and Distributed Computing
The art of computer programming, volume 1 (3rd ed.): fundamental algorithms

The art of computer programming, volume 1 (3rd ed.): fundamental algorithms
On the Generation of Binary Trees

Journal of the ACM (JACM)
Optimal parallel encoding and decoding algorithms for trees

CSC '91 Proceedings of the 19th annual conference on Computer Science
A numbering system for binary trees

Communications of the ACM

On Parallel Generation of t-Ary Trees in an Associative Model

PPAM '01 Proceedings of the th International Conference on Parallel Processing and Applied Mathematics-Revised Papers
Parallel Generation of k-ary Trees

HPC-ASIA '97 Proceedings of the High-Performance Computing on the Information Superhighway, HPC-Asia '97
Parallel generation of binary trees in A-order

Parallel Computing
Short communication: Parallel generation of binary trees in A-order

Parallel Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present a cost-optimal parallel algorithm for generating t-ary trees. Using a known inversion table representation, our algorithm generates all tree sequences in lexicographic order. It uses a linear array of n processors (where n is the number of nodes in the tree), each having a constant number of registers (each storing an integer of size at most tn), and each being responsible for producing one element of a given tree sequence.