On Parallel Generation of Combinations in Associative Processor Architectures

@inproceedings{Kokosinski1997OnPG,
  title={On Parallel Generation of Combinations in Associative Processor Architectures},
  author={Zbigniew Kokosinski},
  booktitle={Euro-PDS},
  year={1997}
}
In this paper two new parallel algorithms are presented for generation of (n,k)-combinations. Computations run in associative processor models. Objects are generated in lexicographic order, with O(1) time per object, in two di erent representations. The rst algorithm uses the conventional representation of combinations while the second algorithm generates combinations in the form of binary vectors and therefore is particularly well suited for row/columnmasks generation in associative processors… CONTINUE READING

From This Paper

Figures, tables, and topics from this paper.

References

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

A note of enumerating combinations in lexicographic order

  • I. Semba
  • J. Information Processing,
  • 1981
Highly Influential
1 Excerpt

Algorithmic Combinatorics, Macmillan

  • S. Even
  • New York
  • 1973
Highly Influential
1 Excerpt

eds): Associative processing and processors

  • C. C. Krikeslis A. Weems
  • IEEE Computer Society Press, Los Alamitos,
  • 1997
1 Excerpt

Generating combinatorial objects on a linear array of processors, [in:] Zomaya A.Y. (editor): Parallel Computing; Paradigms and Applications, Int

  • S. G. Akl, I. Stojmenovi c
  • 1996
2 Excerpts

On parallel generation of combinations in associative processor architectures

  • Z. Kokosi nski
  • Tech. Rep. 96-1-007,
  • 1996

Unranking combinations in parallel

  • Z. Kokosi nski
  • Proc. of the Int. Conference \Parallel and…
  • 1996
2 Excerpts

Similar Papers

Loading similar papers…