Skip to search formSkip to main contentSkip to account menu

Random permutation

Known as: Statistical properties of symmetric groups 
A random permutation is a random ordering of a set of objects, that is, a permutation-valued random variable. The use of random permutations is often… 
Wikipedia (opens in a new tab)

Related topics

Related topics

21 relations
AlgorithmBellman–Ford algorithmCircular layoutCoding theory

Broader (1)

Randomness

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2010
2010
A Robust Image Hashing Method Based on Zernike Moments
Image hashing maps an image to a short binary sequence representing the image’s characteristics. This paper proposes a new image… 
2010
2010
Pseudo-Random Functions and Parallelizable Modes of Operations of a Block Cipher
A general result is proved for constructions which use a pseudo-random function (PRF) with a “small” domain to build a PRF with a… 
2010
2010
Minimizing End-to-End Delay in Wireless Networks Using a Coordinated EDF Schedule
We study the end-to-end delay bounds that can be achieved in wireless networks using packet deadlines. We assume a set of flows… 
2008
2008
Optimal and Practical Algorithms for Sorting on the PDM
The parallel disks model (PDM) has been proposed to alleviate the I/O bottleneck that arises in the processing of massive data… 
2007
2007
An Experimental Study of New and Known Online Packet Buffering Algorithms
We present the first experimental study of online packet buffering algorithms for network switches. We consider a basic scenario… 
2006
2006
Fast Software Encryption, 13th International Workshop, FSE 2006, Graz, Austria, March 15-17, 2006, Revised Selected Papers
We present several attacks against the Achterbahn stream cipher, which was proposed to the eSTREAM competition. We can break the… 
2004
2004
A unified approach to estimation and prediction under simple random sampling
2003
2003
On the Use of GF-Inversion as a Cryptographic Primitive
Inversion in Galois Fields is a famous primitive permutation for designing cryptographic algorithms e.g. for Rijndael because it… 
1998
1998
The Communication Capabilities of Partitioned Optical Passive Stars Networks
This chapter analyzes the communication capabilities of Partitioned Optical Passive Stars (POPS) networks. POPS is a topological… 
1996
1996
Minimax regression designs for approximately linear models with autocorrelated errors
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)