Find link

language:

Find link is a tool written by Edward Betts.

Longer titles found: Random permutation statistics (view), Pseudorandom permutation (view)

searching for Random permutation 47 found (91 total)

Charles Rackoff (301 words) [view diff] exact match in snippet view article find links to article

important result shown there is the construction of a strongly pseudo random permutation generator from a pseudo random function generator). Rackoff was awarded

DRYAD (646 words) [view diff] exact match in snippet view article find links to article

letters A to Y in a column on the left of the page. Each row contains a random permutation of the letters A through Y. The letters in each row are grouped into

Rendezvous problem (588 words) [view diff] exact match in snippet view article find links to article

optimal solution: one player stays put and the other player visits a random permutation of the locations. As well as being problems of theoretical interest

Cayley's mousetrap (385 words) [view diff] exact match in snippet view article find links to article

in Cayley's original article) are shuffled to place them in some random permutation and are arranged in a circle with their faces up. Then, starting with

Quicksort (9,929 words) [view diff] exact match in snippet view article find links to article

x_{n})} is a random permutation, ( x 1 , x 2 , … , x j , x i ) {\displaystyle (x_{1},x_{2},\ldots ,x_{j},x_{i})} is also a random permutation, so the probability

Blinding (cryptography) (662 words) [view diff] exact match in snippet view article

encoding E must be a bijection on the input space of f, ideally a random permutation. Oscar gives her f(E(x)), to which she applies a decoding D to obtain

Superpattern (778 words) [view diff] exact match in snippet view article find links to article

increasing subsequence of a random permutation has length (with high probability) approximately 2√n, it follows that a random permutation must have length at

Maximal independent set (5,451 words) [view diff] no match in snippet view article find links to article

In graph theory, a maximal independent set (MIS) or maximal stable set is an independent set that is not a subset of any other independent set. In other

Plancherel measure (1,168 words) [view diff] exact match in snippet view article find links to article

problems, especially in the study of longest increasing subsequence of a random permutation σ {\displaystyle \sigma } . As a result of its importance in that

Random number (386 words) [view diff] exact match in snippet view article find links to article

variate Random real Richard Durstenfeld (July 1964). "Algorithm 235: Random permutation". Communications of the ACM. 7 (7): 420. doi:10.1145/364520.364540

Time/memory/data tradeoff attack (2,388 words) [view diff] exact match in snippet view article find links to article

key x {\displaystyle x} to the ciphertext y {\displaystyle y} as a random permutation function f {\displaystyle f} over an N {\displaystyle N} point space

Format-preserving encryption (2,991 words) [view diff] exact match in snippet view article find links to article

a truly random permutation is the ideal FPE cipher, for large domains it is infeasible to pre-generate and remember a truly random permutation. So the

Comparison sort (2,640 words) [view diff] exact match in snippet view article find links to article

every comparison will give either a>b or a<b, and the input is a random permutation, chosen uniformly from the set of all possible permutations of n elements

Computationally bounded adversary (1,131 words) [view diff] exact match in snippet view article find links to article

polynomial time. Furthermore, let both the sender and receiver share some random permutation function π {\displaystyle \pi } and a random pattern R {\displaystyle

Longest alternating subsequence (991 words) [view diff] exact match in snippet view article find links to article

element.[citation needed] If x {\displaystyle \mathbf {x} } is a random permutation of the integers 1 , 2 , … , n {\displaystyle 1,2,\ldots ,n} and A

Tiny Encryption Algorithm (1,189 words) [view diff] case mismatch in snippet view article find links to article

Ramos, Benjamín; Mex-Perera, J. C. (2001). "Distinguishing TEA from a Random Permutation: Reduced Round Versions of TEA do Not Have the SAC or do Not Generate

Error correction code (4,684 words) [view diff] exact match in snippet view article find links to article

the interleaver is a known random permutation) S-random interleaver (where the interleaver is a known random permutation with the constraint that no

Wassily Hoeffding (696 words) [view diff] exact match in snippet view article find links to article

proved a combinatorial central limit theorem: If (R1, … , Rn) is a random permutation of the numbers 1, 2, … , n that assumes every permutation with the

American flag sort (983 words) [view diff] exact match in snippet view article find links to article

share very long prefixes. Most critically, this algorithm follows a random permutation, and is thus particularly cache-unfriendly for large datasets.[user-generated

Random indexing (585 words) [view diff] exact match in snippet view article find links to article

models of semantics: Comparing holographic reduced representation and random permutation." (2010): 865-870. Qasemi Zadeh, Behrang & Handschuh, Siegrfied. (2014)

Bogosort (1,891 words) [view diff] exact match in snippet view article find links to article

as an in-joke among computer scientists. The algorithm generates a random permutation of its input using a quantum source of entropy, checks if the list

Determinantal point process (1,537 words) [view diff] exact match in snippet view article find links to article

important role in the study of the longest increasing subsequence of a random permutation. The point process corresponding to a random Young diagram, expressed

Arthur–Merlin protocol (1,831 words) [view diff] exact match in snippet view article find links to article

graphs G and H, Arthur randomly chooses one of them, and chooses a random permutation of its vertices, presenting the permuted graph I to Merlin. Merlin

Advantage (cryptography) (875 words) [view diff] exact match in snippet view article

certain to find the key, so Pr[A1(F)=1] = 1. If the input oracle is a random permutation, there are 264 possible values of E0, and at most 256 of them will

Gilbert–Shannon–Reeds model (1,290 words) [view diff] exact match in snippet view article find links to article

likely to have come from the first or the second packet. To generate a random permutation according to this model, begin by flipping a fair coin n {\displaystyle

Kingman's subadditive ergodic theorem (2,614 words) [view diff] exact match in snippet view article find links to article

increasing subsequence of a random permutation π {\displaystyle \pi } , we generate it in an equivalent way. A random permutation on 1 : n {\displaystyle

Permutation test (2,922 words) [view diff] exact match in snippet view article find links to article

names: approximate permutation test, Monte Carlo permutation tests or random permutation tests. After N {\displaystyle N} random permutations, it is possible

Integer partition (3,405 words) [view diff] exact match in snippet view article find links to article

determine the distribution of the longest increasing subsequence of a random permutation in terms of the Tracy–Widom distribution. Okounkov related these results

Cryptanalysis (5,235 words) [view diff] exact match in snippet view article find links to article

Distinguishing algorithm – the attacker can distinguish the cipher from a random permutation. Academic attacks are often against weakened versions of a cryptosystem

Galois/Counter Mode (3,051 words) [view diff] exact match in snippet view article find links to article

when it is used with a block cipher that is indistinguishable from a random permutation; however, security depends on choosing a unique initialization vector

Lehmer code (2,102 words) [view diff] exact match in snippet view article find links to article

in decision theory, statistics and applied probabilities, where a random permutation is gradually revealed through the first elements of its Lehmer code

Bell number (4,511 words) [view diff] exact match in snippet view article find links to article

larger than the 1/n! probability that would describe a uniformly random permutation of the deck. Related to card shuffling are several other problems

Karger's algorithm (2,303 words) [view diff] exact match in snippet view article find links to article

( e i ) = π ( i ) {\displaystyle w(e_{i})=\pi (i)} according to a random permutation π {\displaystyle \pi } . Removing the heaviest edge of this tree results

Secretary problem (6,867 words) [view diff] exact match in snippet view article find links to article

exchangeable random permutation on { 1 , 2 , . . . , n } {\displaystyle \{1,2,...,n\}} . Now, since the only exchangeable random permutation on { 1 , 2

Shabal (1,139 words) [view diff] exact match in snippet view article find links to article

the authors also presented a method that distinguishes P from a random permutation using a single query. The method can be generalized to any security

Riemann–Hilbert problem (3,712 words) [view diff] exact match in snippet view article find links to article

distribution of the length of the longest increasing subsequence of a random permutation. Together with the study of B above, it is one of the original rigorous

Tracy–Widom distribution (4,821 words) [view diff] exact match in snippet view article find links to article

{\displaystyle l_{n}} be the length of the longest increasing subsequence in a random permutation sampled uniformly from S n {\displaystyle S_{n}} , the permutation

Load balancing (computing) (6,559 words) [view diff] exact match in snippet view article

tasks is known in advance, it is even more efficient to calculate a random permutation in advance. This avoids communication costs for each assignment. There

Uniform convergence in probability (2,995 words) [view diff] exact match in snippet view article find links to article

since there is only a finite set of values that probability under a random permutation can take. Lemma: Basing on the previous lemma, max x ∈ X 2 m ( Pr

Transformer (deep learning architecture) (13,111 words) [view diff] exact match in snippet view article

{\displaystyle PM_{\text{causal}}P^{-1}} , where P {\displaystyle P} is a random permutation matrix. An encoder consists of an embedding layer, followed by multiple

Garbled circuit (2,917 words) [view diff] exact match in snippet view article find links to article

from the row. The protocol's name, garbled, is derived from this random permutation. Alice sends the computed garbled tables for all gates in the circuit

Mental poker (2,399 words) [view diff] exact match in snippet view article find links to article

51}, as in [GOL05] The random number is used as an index into the random permutation, the appropriate player gains "ownership" of the specified card, and

LP-type problem (4,687 words) [view diff] exact match in snippet view article find links to article

pseudocode: function seidel(S, f, X) is R := empty set B := X for x in a random permutation of S: if f(B) ≠ f(B ∪ {x}): B := seidel(R, f, X ∪ {x}) R := R ∪ {x}

Hook length formula (5,141 words) [view diff] exact match in snippet view article find links to article

permutations. If σ n {\displaystyle \sigma _{n}} denotes a uniformly random permutation of order n {\displaystyle n} , L ( σ n ) {\displaystyle L(\sigma _{n})}

Consensus splitting (5,997 words) [view diff] exact match in snippet view article find links to article

according to the value functions reported by the partners. Perform a random permutation on the consensus partition and give each partner one of the pieces

Fuzzy extractor (4,919 words) [view diff] exact match in snippet view article find links to article

processes, meaning that Shannon's bound can be reached; to do this a random permutation is prepended to the secure sketch that will reduce entropy loss. This

XLNet (836 words) [view diff] exact match in snippet view article find links to article

&\vdots &\ddots &\vdots \\0&0&0&\dots &0\end{bmatrix}}} permuted by a random permutation matrix to P M causal P − 1 {\displaystyle PM_{\text{causal}}P^{-1}}