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

@inproceedings{Kokosinski2001OnPG,
  title={On Parallel Generation of t-Ary Trees in an Associative Model},
  author={Zbigniew Kokosinski},
  booktitle={PPAM},
  year={2001}
}
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. 

From This Paper

Figures, tables, and topics from this paper.

References

Publications referenced by this paper.
Showing 1-10 of 33 references

Constructive combinatorics

  • D. Stanton, D. White
  • Wiley–Interscience
  • 1996
1 Excerpt

Generating combinatorial objects on a linear array of processors

  • S. G. Akl, I. Stojmenović
  • [in:] Zomaya, A.Y. (editor): Parallel computing…
  • 1996
1 Excerpt

Parallel computing ; paradigms and applications

  • A. Y. Zomaya
  • Int . Thompson Comp . Press
  • 1996

Similar Papers

Loading similar papers…