Английская Википедия:Esko Ukkonen

Материал из Онлайн справочника
Версия от 15:01, 4 марта 2024; EducationBot (обсуждение | вклад) (Новая страница: «{{Английская Википедия/Панель перехода}} {{short description|Finnish theoretical computer scientist (born 1950)}} {{Infobox scientist |name = Esko Ukkonen |birth_date = {{Birth date and age|1950|1|26|mf=y}} |birth_place = Savonlinna, Finland |citizenship = Finland |residence = |death_date = |death_place = |field = String algorithms |work_institution = University of Helsinki |alma_mater = University...»)
(разн.) ← Предыдущая версия | Текущая версия (разн.) | Следующая версия → (разн.)
Перейти к навигацииПерейти к поиску

Шаблон:Short description Шаблон:Infobox scientist 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. He is a professor emeritus of the University of Helsinki.

Biography

Ukkonen earned his PhD from the University of Helsinki in 1978, where he has been a full professor since 1985. He was the head of the computer science department at the University of Helsinki in 1998--1999 and in 2010--2013, and an Academy professor of the Academy of Finland in 1999--2004. He is the Editor-in-Chief of the Nordic Journal of Computing since 1993.

Ukkonen is a First Class Knight of the Order of the White Rose of Finland (2000). He is a member of Finnish Academy of Science and Letters since 2000, and a foreign member of Estonian Academy of Sciences. 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).[3]

References

Шаблон:Reflist

External links

Шаблон:Authority control