Parallel generation of k-ary trees

The only published algorithms for generating k-ary trees in parallel are those of Akl and Stojmenovic/spl caron/ (1996) and Vajnovszki and Phillips (1997). In the first of these two papers, trees are represented by an inversion table and the processor model is a linear array multicomputer. In the second paper, trees are represented by bit-strings and the algorithm executes on a shared-memory multiprocessor. In this paper, we present a parallel generating algorithm for k-ary trees represented by P-sequences for execution on a linear array multicomputer.