✦ LIBER ✦

The Length of the Longest Increasing Subsequence of a Random Mallows Permutation

✍ Scribed by Carl Mueller, Shannon Starr

Book ID: 120739878
Publisher: Springer US
Year: 2011
Tongue: English
Weight: 793 KB
Volume: 26
Category: Article
ISSN: 0894-9840
DOI: 10.1007/s10959-011-0364-5

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On the Distribution of the Length of the

On the Distribution of the Length of the Longest Increasing Subsequence in a Random Permutation

✍ Fu, James C.; Hsieh, Yu-Fei 📂 Article 📅 2013 🏛 Springer US 🌐 English ⚖ 275 KB

On computing the length of longest incre

On computing the length of longest increasing subsequences

✍ Michael L. Fredman 📂 Article 📅 1975 🏛 Elsevier Science 🌐 English ⚖ 780 KB

On the longest increasing subsequence of

On the longest increasing subsequence of a circular list

✍ M.H. Albert; M.D. Atkinson; Doron Nussbaum; Jörg-Rüdiger Sack; Nicola Santoro 📂 Article 📅 2007 🏛 Elsevier Science 🌐 English ⚖ 125 KB

Lower Bounds on Streaming Algorithms for

Lower Bounds on Streaming Algorithms for Approximating the Length of the Longest Increasing Subsequence

✍ Gál, Anna; Gopalan, Parikshit 📂 Article 📅 2010 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 256 KB

The number of increasing subsequences of

The number of increasing subsequences of the random permutation

✍ V Lifschitz; B Pittel 📂 Article 📅 1981 🏛 Elsevier Science 🌐 English ⚖ 729 KB

An algorithm for the determination of a

An algorithm for the determination of a longest increasing subsequence in a sequence

✍ M. Orlowski; M. Pachter 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 171 KB

We present a simple, novel and efficient algorithm for the determination of a longest increasing subsequence in a given sequence of ,, numbers. Our algorithm performs in O(,~ log r) time in the worst case, where r is the size of the output, i.e. r is the length of the longest increasing subsequence