The correctness of an in-place permutation algorithm is proved. The algorithm exchanges elements belonging to a permutation cycle. A suitable assertion is constructed from which the correctness can be deduced after completion of the algorithm. An in-place rectangular matrix transposition algorithm is given as an example
Sequence rotation consists of a circular shift of the sequence’s elements by a given number of posit...
A correctness proof is a formal mathematical argument that an algorithm meets its specification, whi...
Our research is focused on mapping binary sequences to permutation sequences. It is established that...
The correctness of an in-place permutation algorithm is proved. The algorithm exchanges elements bel...
This paper presents implementations of in‐place algorithms for transposing rectangular matrices. One...
This thesis presents a novel algorithm for Transposing Rectangular matrices In-place and in Parallel...
An algorithm is developed for the in-situ inversion of a cyclic permutation represented in an array....
Every permutation of {1, 2, ... , N} can be written as the product of two involutions. As a conseque...
This paper discusses a bit-vector implementation of an algorithm that computes an optimal sequence ...
Theory of permutation group algorithms for graduates and above. Exercises and hints for implementati...
We describe a decomposition for in-place matrix transposi-tion, with applications to Array of Struct...
Abstract. A linear algorithm is developed for cubing a cyclic permutation stored as a function in an...
We describe the integration of permutation group algorithms with proof planning. We consider eight b...
Abstract. We consider the problem of factorization of permutations. We begin with a discussion of so...
New automatic methods for enumerating permutation classes are introduced. The first is Struct, which...
Sequence rotation consists of a circular shift of the sequence’s elements by a given number of posit...
A correctness proof is a formal mathematical argument that an algorithm meets its specification, whi...
Our research is focused on mapping binary sequences to permutation sequences. It is established that...
The correctness of an in-place permutation algorithm is proved. The algorithm exchanges elements bel...
This paper presents implementations of in‐place algorithms for transposing rectangular matrices. One...
This thesis presents a novel algorithm for Transposing Rectangular matrices In-place and in Parallel...
An algorithm is developed for the in-situ inversion of a cyclic permutation represented in an array....
Every permutation of {1, 2, ... , N} can be written as the product of two involutions. As a conseque...
This paper discusses a bit-vector implementation of an algorithm that computes an optimal sequence ...
Theory of permutation group algorithms for graduates and above. Exercises and hints for implementati...
We describe a decomposition for in-place matrix transposi-tion, with applications to Array of Struct...
Abstract. A linear algorithm is developed for cubing a cyclic permutation stored as a function in an...
We describe the integration of permutation group algorithms with proof planning. We consider eight b...
Abstract. We consider the problem of factorization of permutations. We begin with a discussion of so...
New automatic methods for enumerating permutation classes are introduced. The first is Struct, which...
Sequence rotation consists of a circular shift of the sequence’s elements by a given number of posit...
A correctness proof is a formal mathematical argument that an algorithm meets its specification, whi...
Our research is focused on mapping binary sequences to permutation sequences. It is established that...
DOI
Add to ORKG