%0 Journal Article
%T A parallel dynamic programming algorithm for unranking set partitions
%A Kokosiński, Zbigniew
%J Czasopismo Techniczne
%V 2013
%R 10.4467/2353737XCT.14.055.3963
%N Automatyka Zeszyt 3-AC (11) 2013
%P 29-38
%K set partition, unranking algorithm, associative algorithm, parallel dynamic programming
%@ 0011-4561
%D 2014
%U https://ejournals.eu/czasopismo/czasopismo-techniczne/artykul/a-parallel-dynamic-programming-algorithm-for-unranking-set-partitions
%X 
	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.