Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

14

RSA
2006

favoriteEmaildiscussreport

91views more RSA 2006»

Average case analysis of the Boyer-Moore algorithm

13 years 4 months ago

Average case analysis of the Boyer-Moore algorithm

Download www.stat.sinica.edu.tw

Limit theorems (including a Berry-Esseen bound) are derived for the number of comparisons taken by the Boyer-Moore algorithm for finding the occurrences of a given pattern in a random text. Previously, only special variants of this algorithm have been analyzed. We also propose means of computing the limiting constants for the mean and the variance.

Tsung-Hsi Tsai

Real-time Traffic

Boyer-Moore Algorithm | Random Text | RSA 2006 | Special Variants |

claim paper

Related Content

» Speeding Up Two StringMatching Algorithms

» The relevant prefixes of coloured Motzkin walks An average case analysis

» Average case analysis of multichannel sparse recovery using convex relaxation

» Average case analysis of sparse recovery with thresholding New bounds based on average di...

» Analysis of an Efficient Distributed Algorithm for Mutual Exclusion AverageCase Analysis o...

» Average Case Analysis of Conjunctive Learning Algorithms

» The Lattice Reduction Algorithm of Gauss An Average Case Analysis

» AverageCase Analysis of a Nearest Neighbor Algorithm

» Average Case Analysis of Bounded Space Bin Packing Algorithms

Post Info
More Details (n/a)

Added	15 Dec 2010
Updated	15 Dec 2010
Type	Journal
Year	2006
Where	RSA
Authors	Tsung-Hsi Tsai

Comments (0)