✦ LIBER ✦

Moderate Deviations for Longest Increasing Subsequences: The Lower Tail

✍ Scribed by Matthias Löwe; Franz Merkl; Silke Rolles

Book ID: 110397958
Publisher: Springer US
Year: 2002
Tongue: English
Weight: 144 KB
Volume: 15
Category: Article
ISSN: 0894-9840
DOI: 10.1023/a:1020649006254

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Moderate deviations for longest increasi

Moderate deviations for longest increasing subsequences: The upper tail

✍ Matthias Löwe; Franz Merkl 📂 Article 📅 2001 🏛 John Wiley and Sons 🌐 English ⚖ 212 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

An information-theoretic lower bound for

An information-theoretic lower bound for the longest common subsequence problem

✍ D.S. Hirschberg 📂 Article 📅 1978 🏛 Elsevier Science 🌐 English ⚖ 266 KB

A note on randomized streaming space bou

A note on randomized streaming space bounds for the longest increasing subsequence problem

✍ Amit Chakrabarti 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 114 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

Sample path moderate deviations for the

Sample path moderate deviations for the cumulative fluid produced by an increasing number of exponential on-off sources

✍ Kurt Majewski 📂 Article 📅 2007 🏛 Springer US 🌐 English ⚖ 765 KB