Results 261 to 270 of about 206,672 (309)
Some of the next articles are maybe not open access.
ACM SIGACT News, 2008
In One Line and Close. Permutations as Linear Orders. Descents Alternating Runs Alternating Subsequences In One Line and Anywhere. Permutations as Linear Orders. Inversions. Inversions Inversion in Permutations of Multisets In Many Circles.
M. Bóna
openaire +2 more sources
In One Line and Close. Permutations as Linear Orders. Descents Alternating Runs Alternating Subsequences In One Line and Anywhere. Permutations as Linear Orders. Inversions. Inversions Inversion in Permutations of Multisets In Many Circles.
M. Bóna
openaire +2 more sources
Games and Economic Behavior, 2005 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +1 more source
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
A survey of consecutive patterns in permutations
, 2015A consecutive pattern in a permutation π is another permutation \(\sigma\) determined by the relative order of a subsequence of contiguous entries of π.
S. Elizalde
semanticscholar +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
On the boomerang uniformity of quadratic permutations
Designs, Codes and Cryptography, 2020Sihem Mesnager +2 more
semanticscholar +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
Journal of the London Mathematical Society, 1991
The group \(\hbox{Sym }\mathbb{R}\) of permutations of the set \(\mathbb{R}\) of real numbers is considered in the paper. Let \(P_ 0\) be its subgroup of power functions \(x\mapsto x^{m/n}\) where \(m\), \(n\) are positive odd integers, \(T\) be the subgroup of translations \(x\mapsto x+a\) where \(a\) is a real algebraic number, and \(M\) be the ...
Adeleke, S. A. +2 more
openaire +2 more sources
The group \(\hbox{Sym }\mathbb{R}\) of permutations of the set \(\mathbb{R}\) of real numbers is considered in the paper. Let \(P_ 0\) be its subgroup of power functions \(x\mapsto x^{m/n}\) where \(m\), \(n\) are positive odd integers, \(T\) be the subgroup of translations \(x\mapsto x+a\) where \(a\) is a real algebraic number, and \(M\) be the ...
Adeleke, S. A. +2 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 +1 more source