(Mathematical expressions are simplified in this html-dokument. They should be readable enough to get the flavour.)
We present an algorithm for finding a given k-character string
in an array of n strings, arranged in alphabetical order,
using
O( k loglog n / loglog (4+k loglog n / log n)
character comparisons.
This improves significantly upon previous bounds.
+ k + log n)