Svoboda | Graniru | BBC Russia | Golosameriki | Facebook

To install click the Add extension button. That's it.

The source code for the WIKI 2 extension is being checked by specialists of the Mozilla Foundation, Google, and Apple. You could also do it yourself at any point in time.

4,5
Kelly Slayton
Congratulations on this excellent venture… what a great idea!
Alexander Grigorievskiy
I use WIKI 2 every day and almost forgot how the original Wikipedia looks like.
Live Statistics
English Articles
Improved in 24 Hours
Added in 24 Hours
Languages
Recent
Show all languages
What we do. Every page goes through several hundred of perfecting techniques; in live mode. Quite the same Wikipedia. Just better.
.
Leo
Newton
Brights
Milds

From Wikipedia, the free encyclopedia

Esko Ukkonen
Born (1950-01-26) January 26, 1950 (age 74)
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 (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

  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. Vol. 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. ^ "Department of Economics | Aalto University". 13 December 2023.

External links

This page was last edited on 14 January 2024, at 22:26
Basis of this page is in Wikipedia. Text is available under the CC BY-SA 3.0 Unported License. Non-text media are available under their specified licenses. Wikipedia® is a registered trademark of the Wikimedia Foundation, Inc. WIKI 2 is an independent company and has no affiliation with Wikimedia Foundation.