On generation of permutations through suffix/prefix reversing in a cellular network / Zbigniew Kokosiński // W: Parallel Processing and Applied Mathematics : 5th International Conference, PPAM 2003 Częstochowa, ... więcej

On generation of permutations through suffix/prefix reversing in a cellular network / Zbigniew Kokosiński // W: Parallel Processing and Applied Mathematics : 5th International Conference, PPAM 2003 Częstochowa, Poland, September 7-10, 2003 : revised papers [Dokument elektroniczny] / eds. Roman Wyrzykowski [et al.]. – Berlin ; Heidelberg : Springer, 2004. – (Lecture Notes in Computer Science, ISSN 1611-3349 ; 3019). – S. 249-254 : rys., tab. – Tryb dostępu: http://link.springer.com/chapter/10.1007%2F978-3-540-24669-5_32. – Bibliogr. 11 poz., Abstr. – doi: 10.1007/978-3-540-24669-5_32. – ISBN 978-3-540-24669-5 (online). – ISBN 978-3-540-21946-0 (print). – ISBN 3-540-21946-3

In this paper a new permutation generator is proposed. Each subsequent permutation is generated in a cellular permutation network by reversing a suffix/prefix of the preceding permutation. The sequence ... więcej

In this paper a new permutation generator is proposed. Each subsequent permutation is generated in a cellular permutation network by reversing a suffix/prefix of the preceding permutation. The sequence of suffix/prefix sizes is computed by a complex parallel counter in O(1) time per generated object. Suffix/prefix reversing operations are performed at the same time when the permutation is actually produced.