National Library of Finland
Open Data and Linked Data Service
Search works, persons, organizations and subjects:
Ukkonen, Esko
URI:
http://urn.fi/URN:NBN:fi:au:pn:000061706
name
Ukkonen, Esko
Authored works
A linear time algorithm for finding approximate shortest common superstrings
Algorithms for approximate string matching
Approximate string matching with suffix automata
Finding approximate patterns in strings
Notes on grammatical covering by context-free grammars in normal forms
On the calculation of the effects of roundoff errors
On the effect of rounding errors on the flow of control in numerical processes
On-line construction of suffix-trees
The equivalence problem for some non-real-time deterministic pushdown automata
Upper bounds on the size of LR(k) parsers
Works contributed to
A comparison of approximate string matching algorithms
A greedy approximation algorithm for constructing shortest common superstrings
A simple linear-time algorithm for in situ merging
Algoritmien suunnittelu ja analyysi : luentomuistiinpanoja
Approximate Boyer-Moore string matching
Balancing syntactic and semantic power in compiler specification
Helsinki Institute for Information Technology HIIT : annual report 2007
Minimizing the number of evaluation passes for attribute grammars
Ohjelmointikielten määrittelyn ja toteutuksen englantilais-suomalainen sanasto : English-Finnish vocabulary of the definition and implementation of programming languages
On the preprocessing algorithm for Boyer-Moore string matching
Probabilistic modeling and machine learning in structural and systems biology : workshop proceedings, Tuusula, Finland June 17-18, 2006
STeP-88 : Finnish Artificial Intelligence Symposium = Suomen tekoälytutkimuksen päivät : University of Helsinki, August 15-18 1988 : Vol. 1, Invited papers. Contributed papers : applications
The set union problem with backtracking
The shortest common supersequence problem over binary alphabet is NP-complete
Time parameter and arbitrary deunions in the set union problem
Unifications, deunifications, and their complexity
Works about Ukkonen, Esko
Kutsu kuulemaan sitä julkista esitelmää, jonka Helsingin yliopiston tietojenkäsittelyopin professori Esko Juhani Ukkonen pitää astuessaan virkaansa maaliskuun 19. päivänä 1986
Download this resource as RDF:
Turtle
RDF/XML
N-Triples
JSON-LD