Find link

language:

Find link is a tool written by Edward Betts.

searching for Longest increasing subsequence 7 found (26 total)

alternate case: longest increasing subsequence

Baik–Deift–Johansson theorem (297 words) [view diff] exact match in snippet view article find links to article

makes a statement about the distribution of the length of the longest increasing subsequence in the limit. The theorem was influential in probability theory

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

& Johansson (1999) on the distribution of the length of the longest increasing subsequence of a random permutation. Together with the study of B above

Kurt Johansson (mathematician) (547 words) [view diff] exact match in snippet view article

Johansson, Kurt (1999). "On the distribution of the length of the longest increasing subsequence of random permutations". Journal of the American Mathematical

MUMmer (819 words) [view diff] exact match in snippet view article find links to article

creation of suffix trees (to get MUMs), the second part in the longest increasing subsequence or longest common subsequences (to order MUMs), lastly any alignment

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

extended these results to determine the distribution of the longest increasing subsequence of a random permutation in terms of the Tracy–Widom distribution

Streaming algorithm (3,608 words) [view diff] exact match in snippet view article find links to article

counting the number of inversions in a stream and finding the longest increasing subsequence.[citation needed] The performance of an algorithm that operates

Knizhnik–Zamolodchikov equations (3,059 words) [view diff] exact match in snippet view article find links to article

Kurt (June 1999), "On the distribution of the length of the longest increasing subsequence of random permutations" (PDF), J. Amer. Math. Soc., 12 (4):