Esko Ukkonen

Bing Citeseer DBLP Google Google Scholar Kosmix Wikipedia Yahoo!
Loading Google Thumbnails...
2012
142How to Reconstruct a Genome. Esko Ukkonen. MFCS 2012, 48. Web SearchBibTeXDownload
2011
141Efficient algorithms for the discovery of gapped factors. Alberto Apostolico, Cinzia Pizzi, Esko Ukkonen. Algorithms for Molecular Biology (6): 5 (2011). Web SearchBibTeXDownload
140Editors' Introduction. Marcus Hutter, Frank Stephan, Vladimir Vovk, Thomas Zeugmann. ALT 2011, 1-13. Web SearchBibTeXDownload
139Fast scaffolding with small independent mixed integer programs. Leena Salmela, Veli Mäkinen, Niko Välimäki, Johannes Ylinen, Esko Ukkonen. Bioinformatics (27): 3259-3265 (2011). Web SearchBibTeXDownload
138Finding Significant Matches of Position Weight Matrices in Linear Time. Cinzia Pizzi, Pasi Rastas, Esko Ukkonen. IEEE/ACM Trans. Comput. Biology Bioinform. (8): 69-79 (2011). Web SearchBibTeXDownload
2010
137On the complexity of finding gapped motifs. Morris Michael, François Nicolas, Esko Ukkonen. J. Discrete Algorithms (8): 131-142 (2010). Web SearchBibTeXDownload
136Geometric Point Pattern Matching in the Knuth-Morris-Pratt Way. Esko Ukkonen. J. UCS (16): 1902-1911 (2010). Web SearchBibTeXDownload
2009
135MOODS: fast search for position weight matrix matches in DNA sequences. Janne Korhonen, Petri Martinmäki, Cinzia Pizzi, Pasi Rastas, Esko Ukkonen. Bioinformatics (25): 3181-3182 (2009). Web SearchBibTeXDownload
134Motif Construction from High-Throughput SELEX Data. Esko Ukkonen. ISBRA 2009, 159. Web SearchBibTeXDownload
133Efficient construction of maximal and minimal representations of motifs of a string. François Nicolas, Veli Mäkinen, Esko Ukkonen. Theor. Comput. Sci. (410): 2999-3005 (2009). Web SearchBibTeXDownload
132Maximal and minimal representations of gapped and non-gapped motifs of a string. Esko Ukkonen. Theor. Comput. Sci. (410): 4341-4349 (2009). Web SearchBibTeXDownload
2008
131A Computational Method for Reconstructing Gapless Metabolic Networks. Esa Pitkänen, Ari Rantanen, Juho Rousu, Esko Ukkonen. BIRD 2008, 288-302. Web SearchBibTeXDownload
130An analytic and systematic framework for estimating metabolic flux ratios from 13C tracer experiments. Ari Rantanen, Juho Rousu, Paula Jouhten, Nicola Zamboni, Hannu Maaheimo, Esko Ukkonen. BMC Bioinformatics (9) (2008). Web SearchBibTeXDownload
129The BREW workshop series: a stimulating experience in PhD education. Robert Giegerich, Alvis Brazma, Inge Jonassen, Esko Ukkonen, Martin Vingron. Briefings in Bioinformatics (9): 250-253 (2008). Web SearchBibTeXDownload
128On the complexity of finding gapped motifs. Morris Michael, François Nicolas, Esko Ukkonen. CoRR (abs/0802.0314) (2008). Web SearchBibTeXDownload
127Point Pattern Matching. Veli Mäkinen, Esko Ukkonen. Encyclopedia of Algorithms 2008. Web SearchBibTeXDownload
126Multidimensional String Matching. Juha Kärkkäinen, Esko Ukkonen. Encyclopedia of Algorithms 2008. Web SearchBibTeXDownload
125ReMatch: a web-based tool to construct, store and share stoichiometric metabolic models with carbon maps for metabolic flux analysis. Esa Pitkänen, Arto Åkerlund, Ari Rantanen, Paula Jouhten, Esko Ukkonen. J. Integrative Bioinformatics (5) (2008). Web SearchBibTeXDownload
124Fast profile matching algorithms - A survey. Cinzia Pizzi, Esko Ukkonen. Theor. Comput. Sci. (395): 137-157 (2008). Web SearchBibTeXDownload
2007
123Fast Search Algorithms for Position Specific Scoring Matrices. Cinzia Pizzi, Pasi Rastas, Esko Ukkonen. BIRD 2007, 239-250. Web SearchBibTeXDownload
122Probabilistic modeling and machine learning in structural and systems biology. Samuel Kaski, Juho Rousu, Esko Ukkonen. BMC Bioinformatics (8) (2007). Web SearchBibTeXDownload
121Structural Analysis of Gapped Motifs of a String. Esko Ukkonen. MFCS 2007, 681-690. Web SearchBibTeXDownload
120Haplotype Inference Via Hierarchical Genotype Parsing. Pasi Rastas, Esko Ukkonen. WABI 2007, 85-97. Web SearchBibTeXDownload
2006
119Planning optimal measurements of isotopomer distributions for estimation of metabolic fluxes. Ari Rantanen, Taneli Mielikäinen, Juho Rousu, Hannu Maaheimo, Esko Ukkonen. Bioinformatics (22): 1198-1206 (2006). Web SearchBibTeXDownload
118The complexity of maximum matroid-greedoid intersection and weighted greedoid maximization, . Taneli Mielikäinen, Esko Ukkonen. Discrete Applied Mathematics (154): 684-691 (2006). Web SearchBibTeXDownload
117Equivalence of Metabolite Fragments and Flow Analysis of Isotopomer Distributions for Flux Estimation. Ari Rantanen, Hannu Maaheimo, Esa Pitkänen, Juho Rousu, Esko Ukkonen. T. Comp. Sys. Biology 2006, 198-220. Web SearchBibTeXDownload
116On size reduction techniques for multitape automata. Hellis Tamm, Matti Nykänen, Esko Ukkonen. Theor. Comput. Sci. (363): 234-246 (2006). Web SearchBibTeXDownload
2005
115Optimization of cDNA-AFLP experiments using genomic sequence data. Teemu Kivioja, Mikko Arvas, Markku Saloheimo, Merja Penttilä, Esko Ukkonen. Bioinformatics (21): 2573-2579 (2005). Web SearchBibTeXDownload
114Size Reduction of Multitape Automata. Hellis Tamm, Matti Nykänen, Esko Ukkonen. CIAA 2005, 307-318. Web SearchBibTeXDownload
113Planning isotopomer measurements for estimation of metabolic fluxes. Ari Rantanen, Taneli Mielikäinen, Juho Rousu, Esko Ukkonen. German Conference on Bioinformatics 2005, 177-191. Web SearchBibTeXDownload
112Transposition invariant string matching. Veli Mäkinen, Gonzalo Navarro, Esko Ukkonen. J. Algorithms (56): 124-153 (2005). Web SearchBibTeXDownload
111Finding Feasible Pathways in Metabolic Networks. Esa Pitkänen, Ari Rantanen, Juho Rousu, Esko Ukkonen. Panhellenic Conference on Informatics 2005, 123-133. Web SearchBibTeXDownload
110Sequential and indexed two-dimensional combinatorial template matching allowing rotations. Kimmo Fredriksson, Gonzalo Navarro, Esko Ukkonen. Theor. Comput. Sci. (347): 239-275 (2005). Web SearchBibTeXDownload
109A Hidden Markov Technique for Haplotype Reconstruction. Pasi Rastas, Mikko Koivisto, Heikki Mannila, Esko Ukkonen. WABI 2005, 140-151. Cited by 25Web SearchBibTeXDownload
2004
108Local Approximate 3D Matching of Proteins in Viral Cryo-EM Density Maps. Stefan Burkhardt, Kimmo Fredriksson, Tuomas Ojamies, Janne Ravantti, Esko Ukkonen. 3DPVT 2004, 979-986. Web SearchBibTeXDownload
107Hidden Markov Modelling Techniques for Haplotype Analysis. Mikko Koivisto, Teemu Kivioja, Heikki Mannila, Pasi Rastas, Esko Ukkonen. ALT 2004, 37-52. Cited by 3Web SearchBibTeXDownload
106Size Reduction of Multitape Automata. Hellis Tamm, Matti Nykänen, Esko Ukkonen. CIAA 2004, 329-330. Web SearchBibTeXDownload
105The Computational Complexity of Orientation Search Problems in Cryo-Electron Microscopy. Taneli Mielikäinen, Janne Ravantti, Esko Ukkonen. CoRR (cs.DS/0406043) (2004). Web SearchBibTeXDownload
104The Complexity of Maximum Matroid-Greedoid Intersection and Weighted Greedoid Maximization. Taneli Mielikäinen, Esko Ukkonen. CoRR (cs.DS/0405094) (2004). Web SearchBibTeXDownload
103The Computational Complexity of Orientation Search in Cryo-Electron Microscopy. Taneli Mielikäinen, Janne Ravantti, Esko Ukkonen. International Conference on Computational Science 2004, 231-238. Web SearchBibTeXDownload
102Bideterministic automata and minimal representations of regular languages. Hellis Tamm, Esko Ukkonen. Theor. Comput. Sci. (328): 135-149 (2004). Web SearchBibTeXDownload
101Recombination Systems. Mikko Koivisto, Pasi Rastas, Esko Ukkonen. Theory Is Forever 2004, 159-169. Web SearchBibTeXDownload
2003
100Approximate Matching of Run-Length Compressed Strings. Veli Mäkinen, Esko Ukkonen, Esko Ukkonen. Algorithmica (35): 347-369 (2003). Web SearchBibTeXDownload
99Bideterministic Automata and Minimal Representations of Regular Languages. Hellis Tamm, Esko Ukkonen. CIAA 2003, 61-71. Web SearchBibTeXDownload
98A Method for Estimating Metabolic Fluxes from Incomplete Isotopomer Information. Juho Rousu, Ari Rantanen, Hannu Maaheimo, Esa Pitkänen, Katja Saarela, Esko Ukkonen. CMSB 2003, 88-103. Web SearchBibTeXDownload
97Sweepline the Music!. Esko Ukkonen, Kjell Lemström, Veli Mäkinen. Computer Science in Perspective 2003, 330-342. Web SearchBibTeXDownload
96Design and implementation of a string database query language. Gösta Grahne, Raul Hakli, Matti Nykänen, Hellis Tamm, Esko Ukkonen. Inf. Syst. (28): 311-337 (2003). Web SearchBibTeXDownload
95The C-BRAHMS project. Kjell Lemström, Veli Mäkinen, Anna Pienimäki, M. Turkia, Esko Ukkonen. ISMIR 2003. Web SearchBibTeXDownload
94Geometric algorithms for transposition invariant content based music retrieval. Esko Ukkonen, Kjell Lemström, Veli Mäkinen. ISMIR 2003. Web SearchBibTeXDownload
93Approximate string matching on Ziv-Lempel compressed text. Juha Kärkkäinen, Gonzalo Navarro, Esko Ukkonen. J. Discrete Algorithms (1): 313-338 (2003). Web SearchBibTeXDownload
92An MDL Method for Finding Haplotype Blocks and for Estimating the Strength of Haplotype Block Boundaries. Mikko Koivisto, Markus Perola, T. Varilo, W. Hennah, J. Ekelund, Margus Lukk, L. Peltonen, Esko Ukkonen, Heikki Mannila. Pacific Symposium on Biocomputing 2003, 502-513. Cited by 61Web SearchBibTeXDownload
91Algorithms for Transposition Invariant String Matching. Veli Mäkinen, Gonzalo Navarro, Esko Ukkonen. STACS 2003, 191-202. Web SearchBibTeXDownload
90Matching Numeric Strings under Noise. Veli Mäkinen, Gonzalo Navarro, Esko Ukkonen. Stringology 2003, 99-110. Web SearchBibTeXDownload
2002
89Optimal Exact and Fast Approximate Two Dimensional Pattern Matching Allowing Rotations. Kimmo Fredriksson, Gonzalo Navarro, Esko Ukkonen. CPM 2002, 235-248. Web SearchBibTeXDownload
88Local Similarity Based Point-Pattern Matching. Veli Mäkinen, Esko Ukkonen. CPM 2002, 115-132. Web SearchBibTeXDownload
87Correlating gene promoters and expression in gene disruption experiments. Kimmo Palin, Esko Ukkonen, Alvis Brazma, Jaak Vilo. ECCB 2002, 172-180. Web SearchBibTeX
86Online timestamped text indexing. Amihood Amir, Gad M. Landau, Esko Ukkonen. Inf. Process. Lett. (82): 253-259 (2002). Web SearchBibTeXDownload
85Assigning probes into a small number of pools separable by electrophoresis. Teemu Kivioja, Mikko Arvas, Kari Kataja, Merja Penttilä, Hans Söderlund, Esko Ukkonen. ISMB 2002, 199-206. Web SearchBibTeX
84The Exact Path Length Problem. Matti Nykänen, Esko Ukkonen. J. Algorithms (42): 41-53 (2002). Web SearchBibTeXDownload
83Finding Founder Sequences from a Set of Recombinants. Esko Ukkonen. WABI 2002, 277-286. Web SearchBibTeXDownload
2001
82Approximate Matching of Run-Length Compressed Strings. Veli Mäkinen, Esko Ukkonen, Esko Ukkonen. CPM 2001, 31-49. Web SearchBibTeXDownload
81The Complexity of Maximum Matroid-Greedoid Intersection. Taneli Mielikäinen, Esko Ukkonen. FCT 2001, 535-540. Web SearchBibTeXDownload
80Faster template matching without FFT. Kimmo Fredriksson, Esko Ukkonen. ICIP (1) 2001, 678-681. Web SearchBibTeXDownload
2000
79Approximate String Matching over Ziv-Lempel Compressed Text. Juha Kärkkäinen, Gonzalo Navarro, Esko Ukkonen. CPM 2000, 195-209. Web SearchBibTeXDownload
78An Index for Two Dimensional String Matching Allowing Rotations. Kimmo Fredriksson, Gonzalo Navarro, Esko Ukkonen. IFIP TCS 2000, 59-75. Web SearchBibTeXDownload
77Mining for Putative Regulatory Elements in the Yeast Genome Using Gene Expression Data. Jaak Vilo, Alvis Brazma, Inge Jonassen, Alan J. Robinson, Esko Ukkonen. ISMB 2000, 384-394. Web SearchBibTeXDownload
76Combinatorial Methods for Approximate Pattern Matching under Rotations and Translations in 3D Arrays. Kimmo Fredriksson, Esko Ukkonen. SPIRE 2000, 96-104. Web SearchBibTeXDownload
75Toward Complete Genome Data Mining in Computational Biology. Esko Ukkonen. SWAT 2000, 20-21. Web SearchBibTeXDownload
1999
74Term Frequency-Based Identification of FAQ-Articles. Kai Korpimies, Esko Ukkonen. CoLIS 1999. Web SearchBibTeX
73Reasoning about Strings in Databases. Gösta Grahne, Matti Nykänen, Esko Ukkonen. J. Comput. Syst. Sci. (59): 116-162 (1999). Web SearchBibTeXDownload
72Implementing a Declarative String Query Language with String Restructuring. Raul Hakli, Matti Nykänen, Hellis Tamm, Esko Ukkonen. PADL 1999, 179-195. Web SearchBibTeXDownload
71Combinatorial methods for approximate image matching under translations and rotations. Kimmo Fredriksson, Esko Ukkonen. Pattern Recognition Letters (20): 1249-1258 (1999). Web SearchBibTeXDownload
70Two- and Higher-Dimensional Pattern Matching in Optimal Expected Time. Juha Kärkkäinen, Esko Ukkonen. SIAM J. Comput. (29): 571-589 (1999). Web SearchBibTeXDownload
69Finding Paths with the Right Cost. Matti Nykänen, Esko Ukkonen. STACS 1999, 345-355. Web SearchBibTeXDownload
1998
68Term Weighting in Query-Based Document Clustering (Extended Abstract). Kai Korpimies, Esko Ukkonen. ADBIS 1998, 151-153. Web SearchBibTeXDownload
67A Rotation Invariant Filter for Two-Dimensional String Matching. Kimmo Fredriksson, Esko Ukkonen. CPM 1998, 118-125. Web SearchBibTeXDownload
66Searching for General Documents. Kai Korpimies, Esko Ukkonen. FQAS 1998, 203-214. Web SearchBibTeXDownload
65Predicting gene regulatory elements from their expression data in the complete yeast genome. Alvis Brazma, Inge Jonassen, Jaak Vilo, Esko Ukkonen. German Conference on Bioinformatics 1998. Web SearchBibTeX
64Pattern Discovery in Biosequences. Alvis Brazma, Inge Jonassen, Jaak Vilo, Esko Ukkonen. ICGI 1998, 257-270. Web SearchBibTeXDownload
1997
63Finding transcription factor binding site combinations in the yeast genome. Alvis Brazma, Jaak Vilo, Esko Ukkonen. German Conference on Bioinformatics 1997, 57-59. Web SearchBibTeX
62Data Mining for Regulatory Elements in Yeast Genome. Alvis Brazma, Jaak Vilo, Esko Ukkonen, Kimmo Valtonen. ISMB 1997, 65-74. Web SearchBibTeXDownload
61On the Equivalence Problem for E-Pattern Languages. Enno Ohlebusch, Esko Ukkonen. Theor. Comput. Sci. (186): 231-248 (1997). Web SearchBibTeXDownload
1996
60Sparse Suffix Trees. Juha Kärkkäinen, Esko Ukkonen. COCOON 1996, 219-230. Web SearchBibTeXDownload
59Discovering Unbounded Unions of Regular Pattern Languages from Positive Examples (Extended Abstract). Alvis Brazma, Esko Ukkonen, Jaak Vilo. ISAAC 1996, 95-104. Web SearchBibTeXDownload
58Discovering Patterns and Subfamilies in Biosequences. Alvis Brazma, Inge Jonassen, Esko Ukkonen, Jaak Vilo. ISMB 1996, 34-43. Web SearchBibTeXDownload
57On the Equivalence Problem for E-Pattern Languages. Enno Ohlebusch, Esko Ukkonen. MFCS 1996, 457-468. Web SearchBibTeXDownload
56A Comparison of Approximate String Matching Algorithms. Petteri Jokinen, Jorma Tarhio, Esko Ukkonen. Softw., Pract. Exper. (26): 1439-1458 (1996). Web SearchBibTeXDownload
1995
55On-Line Construction of Suffix Trees. Esko Ukkonen. Algorithmica (14): 249-260 (1995). Web SearchBibTeXDownload
54MDL learning of unions of simple pattern languages from positive examples. Pekka Kilpeläinen, Heikki Mannila, Esko Ukkonen. EuroCOLT 1995, 252-260. Cited by 24Web SearchBibTeXDownload
53Editor's Foreword. Fan Chung Graham, Michael A. Palis, David S. L. Wei. Nord. J. Comput. (2): 1-2 (1995). Web SearchBibTeX
1994
52A Geometric Approach to Feature Selection. Tapio Elomaa, Esko Ukkonen. ECML 1994, 351-354. Web SearchBibTeXDownload
51An ALgorithm for Learning Hierarchical Classifiers. Jyrki Kivinen, Heikki Mannila, Esko Ukkonen, Jaak Vilo. ECML 1994, 375-378. Cited by 1Web SearchBibTeXDownload
50Finding Lowest Common Ancestors in Arbitrarily Directed Trees. Matti Nykänen, Esko Ukkonen. Inf. Process. Lett. (50): 307-310 (1994). Web SearchBibTeXDownload
49Reasoning about Strings in Databases. Gösta Grahne, Matti Nykänen, Esko Ukkonen. PODS 1994, 303-312. Web SearchBibTeXDownload
48Two and Higher Dimensional Pattern Matching in Optimal Expected Time. Juha Kärkkäinen, Esko Ukkonen. SODA 1994, 715-723. Web SearchBibTeXDownload
1993
47Approximate String Matching with Suffix Automata. Esko Ukkonen, Derick Wood. Algorithmica (10): 353-364 (1993). Web SearchBibTeXDownload
46Approximate String-Matching over Suffix Trees. Esko Ukkonen. CPM 1993, 228-242. Web SearchBibTeXDownload
45Approximate Boyer-Moore String Matching. Jorma Tarhio, Esko Ukkonen. SIAM J. Comput. (22): 243-260 (1993). Web SearchBibTeXDownload
1992
44Learning Hierarchical Rule Sets. Jyrki Kivinen, Heikki Mannila, Esko Ukkonen. COLT 1992, 37-44. Cited by 19Web SearchBibTeXDownload
43Constructing Suffix Trees On-Line in Linear Time. Esko Ukkonen. IFIP Congress (1) 1992, 484-492. Web SearchBibTeX
42Approximate String Matching with q-grams and Maximal Matches. Esko Ukkonen. Theor. Comput. Sci. (92): 191-211 (1992). Web SearchBibTeXDownload
1991
41Two Algorithms for Approximate String Matching in Static Texts. Petteri Jokinen, Esko Ukkonen. MFCS 1991, 240-248. Web SearchBibTeXDownload
1990
40A Linear-Time Algorithm for Finding Approximate Shortest Common Superstrings. Esko Ukkonen. Algorithmica (5): 313-323 (1990). Web SearchBibTeXDownload
39Unifications, Deunifications, and Their Complexity. Heikki Mannila, Esko Ukkonen. BIT (30): 599-619 (1990). Cited by 1Web SearchBibTeX
38Boyer-Moore Approach to Approximate String Matching (Extended Abstract). Jorma Tarhio, Esko Ukkonen. SWAT 1990, 348-359. Web SearchBibTeXDownload
1988
37Time Parameter and Arbitrary Deunions in the Set Union Problem. Heikki Mannila, Esko Ukkonen. SWAT 1988, 34-42. Cited by 6Web SearchBibTeXDownload
36A Greedy Approximation Algorithm for Constructing Shortest Common Superstrings. Jorma Tarhio, Esko Ukkonen. Theor. Comput. Sci. (57): 131-145 (1988). Web SearchBibTeXDownload
1987
35Flow Analysis of Prolog Programs. Heikki Mannila, Esko Ukkonen. SLP 1987, 205-214. Cited by 50Web SearchBibTeX
1986
34The Set Union Problem with Backtracking. Heikki Mannila, Esko Ukkonen. ICALP 1986, 236-243. Cited by 13Web SearchBibTeXDownload
33On the Complexity of Unification Sequences. Heikki Mannila, Esko Ukkonen. ICLP 1986, 122-133. Cited by 13Web SearchBibTeXDownload
32A Greedy Algorithm for Constructing Shortest Common Superstrings. Jorma Tarhio, Esko Ukkonen. MFCS 1986, 602-610. Web SearchBibTeXDownload
31A Greedy Algorithm for Constructing Shortest Common Substrings. Jorma Tarhio, Esko Ukkonen. MFCS 1986, 602-610. Web SearchBibTeXDownload
30Algorithms for the search of amino acid patterns in nucleic acid sequences. Hannu Peltola, Hans Söderlund, Esko Ukkonen. Nucleic Acids Research (14): 99-107 (1986). Web SearchBibTeXDownload
29Timestamped Term Representation for Implementing Prolog. Heikki Mannila, Esko Ukkonen. SLP 1986, 159-165. Cited by 7Web SearchBibTeX
1985
28Algorithms for Approximate String Matching. Esko Ukkonen. Information and Control (64): 100-118 (1985). Web SearchBibTeXDownload
27Upper Bounds on the Size of LR(k) Parsers. Esko Ukkonen. Inf. Process. Lett. (20): 99-103 (1985). Web SearchBibTeXDownload
26Finding Approximate Patterns in Strings. Esko Ukkonen. J. Algorithms (6): 132-137 (1985). Web SearchBibTeXDownload
1984
25Finding Temporary Terms in Prolog Programs. Pentti Vataja, Esko Ukkonen. FGCS 1984, 275-282. Web SearchBibTeX
24A Simple Linear-Time Algorithm for in Situ Merging. Heikki Mannila, Esko Ukkonen. Inf. Process. Lett. (18): 203-208 (1984). Cited by 35Web SearchBibTeXDownload
23SEQAID: a DNA sequence assembling program based on a mathematical model. Hannu Peltola, Hans Söderlund, Esko Ukkonen. Nucleic Acids Research (12): 307-321 (1984). Web SearchBibTeXDownload
1983
22Exponential Lower Bounds for Some NP-Complete Problems in a Restricted Linear Decision Tree Model. Esko Ukkonen. BIT (23): 181-192 (1983). Web SearchBibTeX
21On Approximate String Matching. I. Sadeh. FCT 1983, 487-495. Web SearchBibTeXDownload
20Algorithms for Some String Matching Problems Arising in Molecular Genetics. Hannu Peltola, Hans Söderlund, Jorma Tarhio, Esko Ukkonen. IFIP Congress 1983, 59-64. Web SearchBibTeX
19The Complexity of LALR(k) Testing. Seppo Sippu, Eljas Soisalon-Soininen, Esko Ukkonen. J. ACM (30): 259-270 (1983). Web SearchBibTeXDownload
18Lower Bounds on the Size of Deterministic Parsers. Esko Ukkonen. J. Comput. Syst. Sci. (26): 153-170 (1983). Web SearchBibTeXDownload
17Two Results on Polynomial Time Truth-Table Reductions to Sparse Sets. Esko Ukkonen. SIAM J. Comput. (12): 580-587 (1983). Web SearchBibTeXDownload
1982
16The equivalence problem for some non-real-time deterministic pushdown automata. Esko Ukkonen. J. ACM (29): 1166-1181 (1982). Web SearchBibTeXDownload
15Structure Preserving Elimination of Null Productions from Context-Free Grammars. Esko Ukkonen. Theor. Comput. Sci. (17): 43-54 (1982). Web SearchBibTeXDownload
1981
14On the calculation of the effects of roundoff errors. Esko Ukkonen. ACM Trans. Math. Softw. (7): 259-271 (1981). Web SearchBibTeXDownload
13On Size Bounds for Deterministic Parsers. Esko Ukkonen. ICALP 1981, 218-228. Web SearchBibTeXDownload
12Minimizing the Number of Evaluation Passes for Attribute Grammars. Kari-Jouko Räihä, Esko Ukkonen. SIAM J. Comput. (10): 772-786 (1981). Web SearchBibTeXDownload
11LALR(k) Testing is PSPACE-Complete. Esko Ukkonen, Eljas Soisalon-Soininen. STOC 1981, 202-206. Web SearchBibTeXDownload
10The Shortest Common Supersequence Problem over Binary Alphabet is NP-Complete. Kari-Jouko Räihä, Esko Ukkonen. Theor. Comput. Sci. (16): 187-198 (1981). Web SearchBibTeXDownload
1980
9On the Optimal Assignment of Attributes to Passes in Multi-Pass Attribute Evaluators. Kari-Jouko Räihä, Esko Ukkonen. ICALP 1980, 500-511. Web SearchBibTeXDownload
8Balancing Syntactic and Semantic Power in Compiler Specification. Kari-Jouko Räihä, Esko Ukkonen. IFIP Congress 1980, 65-70. Web SearchBibTeX
7A Decision Method for the Equivalence of some Non-Real-Time Deterministic Pushdown Automata. Esko Ukkonen. STOC 1980, 29-38. Web SearchBibTeXDownload
1979
6A Method for Transforming Grammars into LL(k) Form. Eljas Soisalon-Soininen, Esko Ukkonen. Acta Inf. (12): 339-369 (1979). Web SearchBibTeXDownload
5A Modification of the LR(k) Method for Constructing Compact Bottom-Up Parsers. Esko Ukkonen. ICALP 1979, 646-658. Web SearchBibTeXDownload
4The Nonexistence of Some Covering Context-Free Grammars. Esko Ukkonen. Inf. Process. Lett. (8): 187-192 (1979). Web SearchBibTeXDownload
3Remarks on the Nonexistence of some Covering Grammars. Esko Ukkonen. Theoretical Computer Science 1979, 298-309. Web SearchBibTeXDownload
1978
2Tranformations to Produce Certain Covering Grammars. Esko Ukkonen. MFCS 1978, 516-525. Web SearchBibTeXDownload
1976
1A Characterization of LL(k) Languages. Eljas Soisalon-Soininen, Esko Ukkonen. ICALP 1976, 20-30. Web SearchBibTeX
from DBLP and Google Scholar
Developed by the Database Group at the University of Wisconsin and Yahoo! Research