Results 231 to 240 of about 108,510 (269)
Tricortical transdiscal screws of the cervical spine: The technique and its biomechanical and conceptual significance. [PDF]
J Craniovertebr Junction SpineGoel A.
europepmc +1 more source
Ending states of a special variant of the chip-firing algorithm
Enumerative Combinatorics and ApplicationsTanya Khovanova, Rich Wang
doaj +1 more source
Chip firing on directed k-ary trees
Enumerative Combinatorics and ApplicationsRyota Inagaki +2 more
doaj +1 more source
Games and Economic Behavior, 2005 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +1 more source
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
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
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