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

Authors:
Zbigniew Kokosinski
Affiliations:
-
Venue:
PPAM '01 Proceedings of the th International Conference on Parallel Processing and Applied Mathematics-Revised Papers
Year:
2001

Citing 22
Cited 0

Constructive combinatorics

Constructive combinatorics
Left distance binary tree representations

BIT
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
Constructing a binary tree from its traversals

BIT
A random binary tree generator

CSC '89 Proceedings of the 17th conference on ACM Annual Computer Science Conference
On generation of permutations through decomposition of symmetric groups into cosets

BIT
A loopless algorithm for generating binary tree sequences

Information Processing Letters
Efficient generation of k-ary trees in natural order

The Computer Journal - Special issue on information retrieval
A survey on binary tree codings

The Computer Journal - Special issue on data structures
Introduction to parallel computing: design and analysis of algorithms

Introduction to parallel computing: design and analysis of algorithms
New methods for the generation of permutations, combinations, and other combinatorial objects in parallel

Journal of Parallel and Distributed Computing
Sequential and parallel processing in depth search machines

Sequential and parallel processing in depth search machines
Loopless generation of k-ary tree sequences

Information Processing Letters
The art of computer programming, volume 1 (3rd ed.): fundamental algorithms

The art of computer programming, volume 1 (3rd ed.): fundamental algorithms
Parallel computation: models and methods

Parallel computation: models and methods
Permutation Generation Methods

ACM Computing Surveys (CSUR)
A numbering system for binary trees

Communications of the ACM
Associative Processing and Processors

Associative Processing and Processors
Generating t-ary trees in parallel

Nordic Journal of Computing
Linear array with a reconfigurable pipelined bus system - Concepts and applications

Information Sciences: an International Journal

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper a new parallel algorithm is presented for generation of t-ary trees. Computations run in an associative processor model. Tree sequences are generated in lexicographic order, with O(1) time per object, in a new representation, as combinations with repetitions with restricted growth. The corresponding full t-ary trees (x-sequences) appear in antilexicographic order.