Results 261 to 270 of about 141,402 (295)
Ballot permutations and odd order permutations [PDF]
Discrete Mathematics, 2020 There was an error with an alternative formula for b(n,3) that was on page ...
Sam Spiro
exaly +4 more sources
Some of the next articles are maybe not open access.
Related searches:
Related searches:
SIAM Journal on Computing, 1995
This paper addresses the fundamental problem of permuting the elements of an array of $n$ elements according to some given permutation. Our goal is to perform the permutation quickly using only a polylogarithmic number of bits of extra storage. The main result is an algorithm whose worst case running time is $O(n \log n)$ and that uses $O(\log n ...
Faith E. Fich +2 more
openaire +1 more source
This paper addresses the fundamental problem of permuting the elements of an array of $n$ elements according to some given permutation. Our goal is to perform the permutation quickly using only a polylogarithmic number of bits of extra storage. The main result is an algorithm whose worst case running time is $O(n \log n)$ and that uses $O(\log n ...
Faith E. Fich +2 more
openaire +1 more source
Games and Economic Behavior, 2005 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +1 more source
Array Permutation by Index-Digit Permutation
Journal of the ACM, 1976An array may be reordered according to a common permutation of the digits of each of its element indices. The digit-reversed reordering which results from common fast Fourier transform (FFT) algorithms is an example. By examination of this class of permutation in detail, very efficient algorithms for transforming very long arrays are developed.
openaire +1 more source
Journal of the ACM, 1968
In this paper the construction of a switching network capable of n !-permutation of its n input terminals to its n output terminals is described. The building blocks for this network are binary cells capable of permuting their two input terminals to their two output ...
openaire +1 more source
In this paper the construction of a switching network capable of n !-permutation of its n input terminals to its n output terminals is described. The building blocks for this network are binary cells capable of permuting their two input terminals to their two output ...
openaire +1 more source
Communications of the ACM, 1976
Classical permutation enumeration algorithms encounter special cases requiring additional computation every nth permutation when generating the n! permutations on n marks. Four new algorithms have the attribute that special cases occur every n(n—1) permutations. Two of the algorithms produce the next permutation with a single exchange of two marks. The
openaire +2 more sources
Classical permutation enumeration algorithms encounter special cases requiring additional computation every nth permutation when generating the n! permutations on n marks. Four new algorithms have the attribute that special cases occur every n(n—1) permutations. Two of the algorithms produce the next permutation with a single exchange of two marks. The
openaire +2 more sources
ACS Synthetic Biology, 2016
We define a new inversion-based machine called a permuton of n genetic elements, which allows the n elements to be rearranged in any of the n·(n - 1)·(n - 2)···2 = n! distinct orderings. We present two design algorithms for architecting such a machine.
Swapnil, Bhatia +4 more
openaire +2 more sources
We define a new inversion-based machine called a permuton of n genetic elements, which allows the n elements to be rearranged in any of the n·(n - 1)·(n - 2)···2 = n! distinct orderings. We present two design algorithms for architecting such a machine.
Swapnil, Bhatia +4 more
openaire +2 more sources
Sets of permutations and their realization by permutation networks
J. Inf. Process. Cybern., 1985The realization of sets of permutations by permutation networks which are serial connections of some layers with only one binary control input for each layer are systematically investigated.
Ferdinand Börner +2 more
openaire +2 more sources
Mathematical Systems Theory, 1968
A permutation (p-)automaton is a Rabin-Scott one-way, one-tape automaton in which the mapping of the state set into itself induced by each input is a permutation. In Section 2 the author obtains several theorems giving various conditions on the congruence relation induced on the set of input strings which are necessary and sufficient for an automaton ...
openaire +2 more sources
A permutation (p-)automaton is a Rabin-Scott one-way, one-tape automaton in which the mapping of the state set into itself induced by each input is a permutation. In Section 2 the author obtains several theorems giving various conditions on the congruence relation induced on the set of input strings which are necessary and sufficient for an automaton ...
openaire +2 more sources