TY - JOUR
TI - A parallel dynamic programming algorithm for unranking set partitions
AU - Kokosiński, Zbigniew
TI - A parallel dynamic programming algorithm for unranking set partitions
AB - 
	In this paper, an O(n) parallel algorithm is presented for unranking set partitions in Hutchinson’s representation. A simple sequential algorithm is derived on the basis of a dynamic programming paradigm. In the parallel algorithm, processing is performed in a dedicated parallel architecture combining certain systolic and associative features. The algorithm consists of two phases. In the first phase, a coefficient table is created by systolic computations. Then, n subsequent elements of a partition codeword are computed, in O(1) time each, through associative search operations.
VL - 2013
IS - Automatyka Zeszyt 3-AC (11) 2013
PY - 2014
SN - 0011-4561
C1 - 2353-737X
SP - 29
EP - 38
DO - 10.4467/2353737XCT.14.055.3963
UR - https://ejournals.eu/czasopismo/czasopismo-techniczne/artykul/a-parallel-dynamic-programming-algorithm-for-unranking-set-partitions
KW - set partition
KW - unranking algorithm
KW - associative algorithm
KW - parallel dynamic programming