Results 331 to 340 of about 476,988 (354)
Some of the next articles are maybe not open access.
SIGA, 2022
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
semanticscholar +1 more source
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
semanticscholar +1 more source
Continual Permutations Of Action
, 2016Thank you very much for downloading continual permutations of action. As you may know, people have search numerous times for their chosen books like this continual permutations of action, but end up in infectious downloads.
A. Schmid
semanticscholar +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
Solomon Golomb’s Course on Undergraduate Combinatorics, 2021
S. Golomb, Andy Liu
semanticscholar +1 more source
S. Golomb, Andy Liu
semanticscholar +1 more source
, 1975
SUMMARY A probability distribution is defined over the r! permutations of r objects in such a way as to incorporate up to r! -1 parameters. Problems of estimation and testing are considered.
R. Plackett
semanticscholar +1 more source
SUMMARY A probability distribution is defined over the r! permutations of r objects in such a way as to incorporate up to r! -1 parameters. Problems of estimation and testing are considered.
R. Plackett
semanticscholar +1 more source
Random Permutations of a Regular Lattice
, 2013Spatial random permutations were originally studied due to their connections to Bose–Einstein condensation, but they possess many interesting properties of their own.
V. Betz
semanticscholar +1 more source
Abstract We construct “simple” games implementing in Nash equilibria several solutions to the problem of fair division. These solutions are the no-envy solution, which selects the allocations such that no agent would prefer someone else's bundle to his own, and several variants of this solution.
openaire +1 more source
On the boomerang uniformity of quadratic permutations
Designs, Codes and Cryptography, 2020Sihem Mesnager+2 more
semanticscholar +1 more source
How to Build Pseudorandom Functions From Public Random Permutations
IACR Cryptology ePrint Archive, 2019Y. Chen, Eran Lambooij, Bart Mennink
semanticscholar +1 more source