✦ LIBER ✦

Exact and asymptotic results for pattern waiting times

✍ Scribed by M.V. Koutras; F.S. Milienos

Book ID: 113757639
Publisher: Elsevier Science
Year: 2012
Tongue: English
Weight: 333 KB
Volume: 142
Category: Article
ISSN: 0378-3758
DOI: 10.1016/j.jspi.2011.12.028

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Asymptotic Recurrence and Waiting Times

Asymptotic Recurrence and Waiting Times for Stationary Processes

✍ Ioannis Kontoyiannis 📂 Article 📅 1998 🏛 Springer US 🌐 English ⚖ 641 KB

Asymptotic independence of maximum waiti

Asymptotic independence of maximum waiting times for increasing alphabet

✍ T. F. Móri 📂 Article 📅 1992 🏛 Springer Netherlands 🌐 English ⚖ 341 KB

Large deviation results for waiting time

Large deviation results for waiting times in repeated experiments

✍ T. F. Móri 📂 Article 📅 1985 🏛 Akadmiai Kiad 🌐 English ⚖ 405 KB

Exact results for integrable asymptotica

Exact results for integrable asymptotically-free field theories

✍ Jonathan M. Evans; Timothy J. Hollowood 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 741 KB

Processor-Ring Communication: A Tight As

Processor-Ring Communication: A Tight Asymptotic Bound on Packet Waiting Times

✍ Coffman, E. G.; Kahale, Nabil; Leighton, F. T. 📂 Article 📅 1998 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 293 KB

Waiting time and complexity for matching

Waiting time and complexity for matching patterns with automata

✍ M. Crochemore; V.T. Stefanov 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 105 KB

The paper shows how to compute exactly expectations, standard deviations, and cumulative probabilities of the searching times of string-matching algorithms based on the use of automata. This is derived from a methodology based on viewing the underlying Markov chains as exponential families and apply