An algorithm is developed for the in-situ inversion of a cyclic permutation represented in an array. The emphasis is on the quo modo rather than the quod**; we are interested in finding concepts and notations for dealing more effectively with formal developments and proofs of such algorithms, rather than in this particular algorithm itself
In this paper, we describe a reliable symbolic computational algorithm for inverting general cyclic ...
We study the Smarandache inversion sequence which is a new concept, related sequences, conjectures, ...
AbstractIn this paper we study some properties of the inversion statistic. Some enumerative results ...
An algorithm is developed for the in-situ inversion of a cyclic permutation represented in an array....
The correctness of an in-place permutation algorithm is proved. The algorithm exchanges elements bel...
The correctness of an in-place permutation algorithm is proved. The algorithm exchanges elements bel...
We present some enumerative results concerning the permutations of the multiset {x_1^{m_1},...,x_r^{...
Abstract. A linear algorithm is developed for cubing a cyclic permutation stored as a function in an...
AbstractWe introduce proof rules for inverting a program. We derive an algorithm to compute the preo...
Permutations that avoid given patterns have been studied in great depth for their connections to oth...
Ordinary representations of permutations in Genetic Algorithms (GA) is handicapped with producing of...
Ordinary representations of permutations in Genetic Algorithms (GA) is handicapped with producing os...
In this paper we study some properties of the inversion statistic. Some enumerative results concerni...
AbstractA number-theoretical approach to the permutation of a sequence of objects performed by means...
Hannenhalli and Pevzner gave the first polynomial-time algorithm for computing the inversion distanc...
In this paper, we describe a reliable symbolic computational algorithm for inverting general cyclic ...
We study the Smarandache inversion sequence which is a new concept, related sequences, conjectures, ...
AbstractIn this paper we study some properties of the inversion statistic. Some enumerative results ...
An algorithm is developed for the in-situ inversion of a cyclic permutation represented in an array....
The correctness of an in-place permutation algorithm is proved. The algorithm exchanges elements bel...
The correctness of an in-place permutation algorithm is proved. The algorithm exchanges elements bel...
We present some enumerative results concerning the permutations of the multiset {x_1^{m_1},...,x_r^{...
Abstract. A linear algorithm is developed for cubing a cyclic permutation stored as a function in an...
AbstractWe introduce proof rules for inverting a program. We derive an algorithm to compute the preo...
Permutations that avoid given patterns have been studied in great depth for their connections to oth...
Ordinary representations of permutations in Genetic Algorithms (GA) is handicapped with producing of...
Ordinary representations of permutations in Genetic Algorithms (GA) is handicapped with producing os...
In this paper we study some properties of the inversion statistic. Some enumerative results concerni...
AbstractA number-theoretical approach to the permutation of a sequence of objects performed by means...
Hannenhalli and Pevzner gave the first polynomial-time algorithm for computing the inversion distanc...
In this paper, we describe a reliable symbolic computational algorithm for inverting general cyclic ...
We study the Smarandache inversion sequence which is a new concept, related sequences, conjectures, ...
AbstractIn this paper we study some properties of the inversion statistic. Some enumerative results ...
DOI
Add to ORKG