Esko Ukkonen

From Wikipedia, the free encyclopedia
Esko Ukkonen
Born (1950-01-26) January 26, 1950 (age 71)
Savonlinna, Finland
CitizenshipFinland
Alma materUniversity of Helsinki
Known forUkkonen's algorithm
Scientific career
FieldsString algorithms
InstitutionsUniversity of Helsinki
Doctoral advisorMartti Tienari
Doctoral studentsHeikki Mannila

Esko Juhani Ukkonen (b. 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 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[]

  1. ^ Ukkonen, E. (1995). "On-line construction of suffix trees". Algorithmica. 14 (3): 249–260. CiteSeerX 10.1.1.10.751. doi:10.1007/BF01206331. ISSN 0178-4617. S2CID 6027556.
  2. ^ Elomaa, Tapio; Mannila, Heikki; Orponen, Pekka (2010). Algorithms and Applications, Essays Dedicated to Esko Ukkonen on the Occasion of His 60th Birthday. Lecture Notes in Computer Science. 6060. CiteSeerX 10.1.1.697.529. doi:10.1007/978-3-642-12476-1. ISBN 978-3-642-12475-4. ISSN 0302-9743.
  3. ^ http://economics.aalto.fi/en/current/news_archive/2014-10-22-003/

External links[]

Retrieved from ""