Results 231 to 240 of about 115,299 (267)
Permutation tableaux and permutation patterns
Journal of Combinatorial Theory - Series A, 2007 Clarification of proofs (thanks to referees); report on progress on our open problems by Burstein, Corteel, Eriksen, Reifegerste, and Viennot. 25 pages, 7 figures.
Einar Steingrı́Msson
exaly +4 more sources
Simple permutations and pattern restricted permutations
Discrete Mathematics, 2005 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
M D Atkinson
exaly +3 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