@article{7594d92a-4a76-4b89-ba77-523392281e72,
author = {Zbigniew Kokosiński},
title = {A parallel dynamic programming algorithm for unranking set partitions},
journal = {Czasopismo Techniczne},
volume = {2013},
number = {Automatyka Zeszyt 3-AC (11) 2013},
year = {2014},
issn = {0011-4561},
pages = {29-38},keywords = {set partition; unranking algorithm; associative algorithm; parallel dynamic programming},
abstract = {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.},
doi = {10.4467/2353737XCT.14.055.3963},
url = {https://ejournals.eu/czasopismo/czasopismo-techniczne/artykul/a-parallel-dynamic-programming-algorithm-for-unranking-set-partitions}
}