Esko Juhani Ukkonen (born 1950) is a Finnish theoretical computer scientist known for his contributions to string algorithms, and particularly for Ukkonen's algorithm[1] for suffix tree construction.
Ukkonen earned his PhD from the University of Helsinki in 1978, where he has been a full professor since 1985.
Ukkonen is a First Class Knight of the Order of the White Rose of Finland (2000).
A festschrift in his honour was published by Springer in the Lecture Notes in Computer Science book series.
[2] He holds an honorary doctorate from Aalto University (2014).