Hagerup, Torben Algorithms and Complexity, MPI for Informatics, Max Planck Society;
Andersson, A., Hagerup, T., Hastad, J., & Petersson, O. (2000). Tight bounds for searching a sorted array of strings. SIAM Journal on Computing, 30(5), 1552-1578.