✦ LIBER ✦

On the Worst-Case Behavior of String-Searching Algorithms

✍ Scribed by Rivest, Ronald L.

Book ID: 118178085
Publisher: Society for Industrial and Applied Mathematics
Year: 1977
Tongue: English
Weight: 589 KB
Volume: 6
Category: Article
ISSN: 0097-5397
DOI: 10.1137/0206048

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Worst-case behavior of string-searching

Worst-case behavior of string-searching algorithms

✍ Zsolt Tuza 📂 Article 📅 1982 🏛 Elsevier Science 🌐 English ⚖ 649 KB

Worst case behavior of the Dinic algorit

Worst case behavior of the Dinic algorithm

✍ Gary R. Waissi 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 292 KB

On improving the worst case running time

On improving the worst case running time of the Boyer-Moore string matching algorithm

✍ Galil, Zvi 📂 Article 📅 1979 🏛 Association for Computing Machinery 🌐 English ⚖ 372 KB

On the Asymptotic Worst Case Behavior of

On the Asymptotic Worst Case Behavior of Harmonic Fit

✍ André van Vliet 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 219 KB

In the parametric bin packing problem we must pack a list of items with size smaller than or equal to 1rr in a minimal number of unit-capacity bins. Among the Ž . approximation algorithms, the class of Harmonic Fit algorithms HF plays an M

On tuning the boyer-moore-horspool strin

On tuning the boyer-moore-horspool string searching algorithm

✍ P. D. Smith 📂 Article 📅 1994 🏛 John Wiley and Sons 🌐 English ⚖ 100 KB

On the worst-case divergence of the leas

On the worst-case divergence of the least-squares algorithm

✍ Hüseyin Akçay; Brett Ninness 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 371 KB

In this paper, we provide a ~-norm lower bound on the worst-case identification error of least-squares estimation when using FIR model structures. This bound increases as a logarithmic function of model complexity and is valid for a wide class of inputs characterized as being quasi-stationary with c