✦ LIBER ✦

Moderate deviations for longest increasing subsequences: The upper tail

✍ Scribed by Matthias Löwe; Franz Merkl

Publisher: John Wiley and Sons
Year: 2001
Tongue: English
Weight: 212 KB
Volume: 54
Category: Article
ISSN: 0010-3640
DOI: 10.1002/cpa.10010

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Large and moderate deviations upper boun

Large and moderate deviations upper bounds for the Gaussian autoregressive process

✍ Julien Worms 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 108 KB

We study the least-squares estimator in the scalar autoregressive model of order 1 with Gaussian noise and arbitrary ÿxed initial state. Upper bounds of both large and moderate deviations principles are achieved in the unstable and explosive frameworks. The moderate deviations results are consistent

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