Proper noun
the Boyer-Moore-Horspool algorithm (computing theory) An algorithm for finding substrings that trades space for time in order to obtain an average-case time complexity of O(n) on random text. Synonym: Horspool's algorithm