✦ LIBER ✦

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

✍ Scribed by Galil, Zvi

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Average running time of the Boyer-Moore-

✍ Ricardo A. Baeza-Yates; Mireille Régnier 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 671 KB

On the Worst-Case Behavior of String-Sea

✍ Rivest, Ronald L. 📂 Article 📅 1977 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 589 KB

The worst-case running time of the rando

✍ Andrei Z. Broder; Martin E. Dyer; Alan M. Frieze; Prabhakar Raghavan; Eli Upfal 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 250 KB