✦ LIBER ✦

Perturbed Recurrence Relations

✍ Scribed by Elie Leopold

Book ID: 111551840
Publisher: Springer US
Year: 2003
Tongue: English
Weight: 91 KB
Volume: 33
Category: Article
ISSN: 1017-1398
DOI: 10.1023/a:1025592811765

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Perturbed recurrence relations II the ge

Perturbed recurrence relations II the general case

✍ Elie Leopold 📂 Article 📅 2007 🏛 Springer US 🌐 English ⚖ 417 KB

On orthogonal polynomials with perturbed

On orthogonal polynomials with perturbed recurrence relations

✍ F. Marcellan; J.S. Dehesa; A. Ronveaux 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 678 KB

Perturbed recurrence relations III the g

Perturbed recurrence relations III the general case—some new applications

✍ Elie Leopold 📂 Article 📅 2008 🏛 Springer US 🌐 English ⚖ 385 KB

Linear Recurrence Relations

✍ J. L. Brenner 📂 Article 📅 1954 🏛 Mathematical Association of America 🌐 English ⚖ 340 KB

Generating function, recurrence relation

Generating function, recurrence relations, differential relations

✍ Jeannette Van Iseghem 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 368 KB

Probabilistic recurrence relations revis

Probabilistic recurrence relations revisited

✍ Shiva Chaudhuri; Devdatt Dubhashi 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 669 KB

The performance attributes of a broad class of randomised algorithms can be described by a recurrence relation of the form where a is a function and H(x) is a random variable. For instance, T(x) may describe the running time of such an algorithm on a problem of size X. Then T(x) is a random variabl