Esko Ukkonen - RankMe

160 papers A* 10A 6B 21C 14Misc 5Journal 68Unranked 32

Year	Rank	Type	Title / Venue / Authors
2020	J	`jnl`	MODER2: first-order Markov modeling and discovery of monomeric and dimeric binding motifs. Bioinform. Jarkko Toivonen, Pratyush K. Das, Jussi Taipale, Esko Ukkonen
2018	C	`ed.`	18th International Workshop on Algorithms in Bioinformatics, WABI 2018, Helsinki, Finland, August 20-22, 2018 WABI Laxmi Parida, Esko Ukkonen
2018	Misc	`conf`	Discovery of Regulatory Motifs in DNA. PSC Esko Ukkonen
2017	J	`jnl`	Accurate self-correction of errors in long reads using de Bruijn graphs. Bioinform. Leena Salmela, Riku Walve, Eric Rivals, Esko Ukkonen
2017	J	`jnl`	Fast motif matching revisited: high-order PWMs, SNPs and indels. Bioinform. Janne H. Korhonen, Kimmo Palin, Jussi Taipale, Esko Ukkonen
2017	C	`conf`	Seed-driven Learning of Position Probability Matrices from Large Sequence Sets. WABI Jarkko Toivonen, Jussi Taipale, Esko Ukkonen
2016	—	`ch.`	Point Pattern Matching. Encyclopedia of Algorithms Veli Mäkinen, Esko Ukkonen
2015	J	`jnl`	Longest common substrings with k mismatches. Inf. Process. Lett. Tomás Flouri, Emanuele Giaquinta, Kassian Kobert, Esko Ukkonen
2014	J	`jnl`	Longest common substrings with k mismatches. CoRR Tomás Flouri, Emanuele Giaquinta, Kassian Kobert, Esko Ukkonen
2014	J	`jnl`	Motif matching using gapped patterns. Theor. Comput. Sci. Emanuele Giaquinta, Kimmo Fredriksson, Szymon Grabowski, Alexandru I. Tomescu, Esko Ukkonen
2013	J	`jnl`	Fast Matching of Transcription Factor Motifs Using Generalized Position Weight Matrix Models. J. Comput. Biol. Emanuele Giaquinta, Szymon Grabowski, Esko Ukkonen
2013	C	`conf`	Motif Matching Using Gapped Patterns. IWOCA Emanuele Giaquinta, Kimmo Fredriksson, Szymon Grabowski, Esko Ukkonen
2013	J	`jnl`	Motif matching using gapped patterns. CoRR Emanuele Giaquinta, Kimmo Fredriksson, Szymon Grabowski, Alexandru I. Tomescu, Esko Ukkonen
2012	B	`conf`	How to Reconstruct a Genome. MFCS Esko Ukkonen
2011	B	`ed.`	Algorithmic Learning Theory - 22nd International Conference, ALT 2011, Espoo, Finland, October 5-7, 2011. Proceedings ALT Jyrki Kivinen, Csaba Szepesvári, Esko Ukkonen, Thomas Zeugmann
2011	J	`jnl`	Editorial. J. Discrete Algorithms Gregory Kucherov, Esko Ukkonen
2011	B	`conf`	Editors' Introduction. ALT Jyrki Kivinen, Csaba Szepesvári, Esko Ukkonen, Thomas Zeugmann
2011	J	`jnl`	Efficient algorithms for the discovery of gapped factors. Algorithms Mol. Biol. Alberto Apostolico, Cinzia Pizzi, Esko Ukkonen
2011	J	`jnl`	Fast scaffolding with small independent mixed integer programs. Bioinform. Leena Salmela, Veli Mäkinen, Niko Välimäki, Johannes Ylinen, Esko Ukkonen
2011	J	`jnl`	Finding Significant Matches of Position Weight Matrices in Linear Time. IEEE ACM Trans. Comput. Biol. Bioinform. Cinzia Pizzi, Pasi Rastas, Esko Ukkonen
2010	J	`jnl`	Geometric Point Pattern Matching in the Knuth-Morris-Pratt Way. J. Univers. Comput. Sci. Esko Ukkonen
2010	J	`jnl`	On the complexity of finding gapped motifs. J. Discrete Algorithms Morris Michael, François Nicolas, Esko Ukkonen
2009	B	`ed.`	Combinatorial Pattern Matching, 20th Annual Symposium, CPM 2009, Lille, France, June 22-24, 2009, Proceedings CPM Gregory Kucherov, Esko Ukkonen
2009	J	`jnl`	Efficient construction of maximal and minimal representations of motifs of a string. Theor. Comput. Sci. François Nicolas, Veli Mäkinen, Esko Ukkonen
2009	J	`jnl`	MOODS: fast search for position weight matrix matches in DNA sequences. Bioinform. Janne H. Korhonen, Petri Martinmäki, Cinzia Pizzi, Pasi Rastas, Esko Ukkonen
2009	J	`jnl`	Maximal and minimal representations of gapped and non-gapped motifs of a string. Theor. Comput. Sci. Esko Ukkonen
2009	—	`conf`	Motif Construction from High-Throughput SELEX Data. ISBRA Esko Ukkonen
2008	—	`conf`	A Computational Method for Reconstructing Gapless Metabolic Networks. BIRD Esa Pitkänen, Ari Rantanen, Juho Rousu, Esko Ukkonen
2008	J	`jnl`	An analytic and systematic framework for estimating metabolic flux ratios from BMC Bioinform. Ari Rantanen, Juho Rousu, Paula Jouhten, Nicola Zamboni, Hannu Maaheimo, Esko Ukkonen
2008	J	`jnl`	Fast profile matching algorithms - A survey. Theor. Comput. Sci. Cinzia Pizzi, Esko Ukkonen
2008	—	`ch.`	Multidimensional String Matching. Encyclopedia of Algorithms Juha Kärkkäinen, Esko Ukkonen
2008	—	`ch.`	Point Pattern Matching. Encyclopedia of Algorithms Veli Mäkinen, Esko Ukkonen
2008	J	`jnl`	ReMatch: a web-based tool to construct, store and share stoichiometric metabolic models with carbon maps for metabolic flux analysis. J. Integr. Bioinform. Esa Pitkänen, Arto Åkerlund, Ari Rantanen, Paula Jouhten, Esko Ukkonen
2008	J	`jnl`	The BREW workshop series: a stimulating experience in PhD education. Briefings Bioinform. Robert Giegerich, Alvis Brazma, Inge Jonassen, Esko Ukkonen, Martin Vingron
2007	—	`conf`	Fast Search Algorithms for Position Specific Scoring Matrices. BIRD Cinzia Pizzi, Pasi Rastas, Esko Ukkonen
2007	C	`conf`	Haplotype Inference Via Hierarchical Genotype Parsing. WABI Pasi Rastas, Esko Ukkonen
2007	J	`jnl`	Probabilistic modeling and machine learning in structural and systems biology. BMC Bioinform. Samuel Kaski, Juho Rousu, Esko Ukkonen
2007	B	`conf`	Structural Analysis of Gapped Motifs of a String. MFCS Esko Ukkonen
2006	J	`jnl`	Equivalence of Metabolite Fragments and Flow Analysis of Isotopomer Distributions for Flux Estimation. Trans. Comp. Sys. Biology Ari Rantanen, Hannu Maaheimo, Esa Pitkänen, Juho Rousu, Esko Ukkonen
2006	J	`jnl`	On size reduction techniques for multitape automata. Theor. Comput. Sci. Hellis Tamm, Matti Nykänen, Esko Ukkonen
2006	J	`jnl`	Planning optimal measurements of isotopomer distributions for estimation of metabolic fluxes. Bioinform. Ari Rantanen, Taneli Mielikäinen, Juho Rousu, Hannu Maaheimo, Esko Ukkonen
2006	J	`jnl`	The complexity of maximum matroid-greedoid intersection and weighted greedoid maximization Discret. Appl. Math. Taneli Mielikäinen, Esko Ukkonen
2005	C	`conf`	A Hidden Markov Technique for Haplotype Reconstruction. WABI Pasi Rastas, Mikko Koivisto, Heikki Mannila, Esko Ukkonen
2005	—	`conf`	Finding Feasible Pathways in Metabolic Networks. Panhellenic Conference on Informatics Esa Pitkänen, Ari Rantanen, Juho Rousu, Esko Ukkonen
2005	J	`jnl`	Optimization of cDNA-AFLP experiments using genomic sequence data. Bioinform. Teemu Kivioja, Mikko Arvas, Markku Saloheimo, Merja Penttilä, Esko Ukkonen
2005	—	`conf`	Planning isotopomer measurements for estimation of metabolic fluxes. German Conference on Bioinformatics Ari Rantanen, Taneli Mielikäinen, Juho Rousu, Esko Ukkonen
2005	J	`jnl`	Sequential and indexed two-dimensional combinatorial template matching allowing rotations. Theor. Comput. Sci. Kimmo Fredriksson, Gonzalo Navarro, Esko Ukkonen
2005	C	`conf`	Size Reduction of Multitape Automata. CIAA Hellis Tamm, Matti Nykänen, Esko Ukkonen
2005	J	`jnl`	Transposition invariant string matching. J. Algorithms Veli Mäkinen, Gonzalo Navarro, Esko Ukkonen
2004	J	`jnl`	Bideterministic automata and minimal representations of regular languages. Theor. Comput. Sci. Hellis Tamm, Esko Ukkonen
2004	B	`conf`	Hidden Markov Modelling Techniques for Haplotype Analysis. ALT Mikko Koivisto, Teemu Kivioja, Heikki Mannila, Pasi Rastas, Esko Ukkonen
2004	—	`conf`	Local Approximate 3D Matching of Proteins in Viral Cryo-EM Density Maps. 3DPVT Stefan Burkhardt, Kimmo Fredriksson, Tuomas Ojamies, Janne Ravantti, Esko Ukkonen
2004	—	`conf`	Recombination Systems. Theory Is Forever Mikko Koivisto, Pasi Rastas, Esko Ukkonen
2004	C	`conf`	Size Reduction of Multitape Automata. CIAA Hellis Tamm, Matti Nykänen, Esko Ukkonen
2004	J	`jnl`	The Complexity of Maximum Matroid-Greedoid Intersection and Weighted Greedoid Maximization CoRR Taneli Mielikäinen, Esko Ukkonen
2004	J	`jnl`	The Computational Complexity of Orientation Search Problems in Cryo-Electron Microscopy CoRR Taneli Mielikäinen, Janne Ravantti, Esko Ukkonen
2004	Misc	`conf`	The Computational Complexity of Orientation Search in Cryo-Electron Microscopy. International Conference on Computational Science Taneli Mielikäinen, Janne Ravantti, Esko Ukkonen
2003	—	`conf`	A Method for Estimating Metabolic Fluxes from Incomplete Isotopomer Information. CMSB Juho Rousu, Ari Rantanen, Hannu Maaheimo, Esa Pitkänen, Katja Saarela, Esko Ukkonen
2003	A	`conf`	Algorithms for Transposition Invariant String Matching. STACS Veli Mäkinen, Gonzalo Navarro, Esko Ukkonen
2003	Misc	`conf`	An MDL Method for Finding Haplotype Blocks and for Estimating the Strength of Haplotype Block Boundaries. Pacific Symposium on Biocomputing Mikko Koivisto, Markus Perola, T. Varilo, W. Hennah, J. Ekelund, Margus Lukk, L. Peltonen, Esko Ukkonen, Heikki Mannila
2003	J	`jnl`	Approximate Matching of Run-Length Compressed Strings. Algorithmica Veli Mäkinen, Esko Ukkonen, Gonzalo Navarro
2003	J	`jnl`	Approximate string matching on Ziv-Lempel compressed text. J. Discrete Algorithms Juha Kärkkäinen, Gonzalo Navarro, Esko Ukkonen
2003	C	`conf`	Bideterministic Automata and Minimal Representations of Regular Languages. CIAA Hellis Tamm, Esko Ukkonen
2003	J	`jnl`	Design and implementation of a string database query language. Inf. Syst. Gösta Grahne, Raul Hakli, Matti Nykänen, Hellis Tamm, Esko Ukkonen
2003	—	`conf`	Geometric algorithms for transposition invariant content based music retrieval. ISMIR Esko Ukkonen, Kjell Lemström, Veli Mäkinen
2003	Misc	`conf`	Matching Numeric Strings under Noise. PSC Veli Mäkinen, Gonzalo Navarro, Esko Ukkonen
2003	—	`conf`	Sweepline the Music! Computer Science in Perspective Esko Ukkonen, Kjell Lemström, Veli Mäkinen
2003	—	`conf`	The C-BRAHMS project. ISMIR Kjell Lemström, Veli Mäkinen, Anna Pienimäki, Mika Turkia, Esko Ukkonen
2002	A	`conf`	Assigning probes into a small number of pools separable by electrophoresis. ISMB Teemu Kivioja, Mikko Arvas, Kari Kataja, Merja Penttilä, Hans Söderlund, Esko Ukkonen
2002	C	`conf`	Correlating gene promoters and expression in gene disruption experiments. ECCB Kimmo Palin, Esko Ukkonen, Alvis Brazma, Jaak Vilo
2002	C	`conf`	Finding Founder Sequences from a Set of Recombinants. WABI Esko Ukkonen
2002	B	`conf`	Local Similarity Based Point-Pattern Matching. CPM Veli Mäkinen, Esko Ukkonen
2002	J	`jnl`	Online timestamped text indexing. Inf. Process. Lett. Amihood Amir, Gad M. Landau, Esko Ukkonen
2002	B	`conf`	Optimal Exact and Fast Approximate Two Dimensional Pattern Matching Allowing Rotations. CPM Kimmo Fredriksson, Gonzalo Navarro, Esko Ukkonen
2002	J	`jnl`	The Exact Path Length Problem. J. Algorithms Matti Nykänen, Esko Ukkonen
2001	B	`conf`	Approximate Matching of Run-Length Compressed Strings. CPM Veli Mäkinen, Gonzalo Navarro, Esko Ukkonen
2001	—	`conf`	Faster template matching without FFT. ICIP (1) Kimmo Fredriksson, Esko Ukkonen
2001	B	`conf`	The Complexity of Maximum Matroid-Greedoid Intersection. FCT Taneli Mielikäinen, Esko Ukkonen
2000	—	`conf`	An Index for Two Dimensional String Matching Allowing Rotations. IFIP TCS Kimmo Fredriksson, Gonzalo Navarro, Esko Ukkonen
2000	B	`conf`	Approximate String Matching over Ziv-Lempel Compressed Text. CPM Juha Kärkkäinen, Gonzalo Navarro, Esko Ukkonen
2000	C	`conf`	Combinatorial Methods for Approximate Pattern Matching under Rotations and Translations in 3D Arrays. SPIRE Kimmo Fredriksson, Esko Ukkonen
2000	A	`conf`	Mining for Putative Regulatory Elements in the Yeast Genome Using Gene Expression Data. ISMB Jaak Vilo, Alvis Brazma, Inge Jonassen, Alan J. Robinson, Esko Ukkonen
2000	—	`conf`	Toward Complete Genome Data Mining in Computational Biology. SWAT Esko Ukkonen
1999	J	`jnl`	Combinatorial methods for approximate image matching under translations and rotations. Pattern Recognit. Lett. Kimmo Fredriksson, Esko Ukkonen
1999	A	`conf`	Finding Paths with the Right Cost. STACS Matti Nykänen, Esko Ukkonen
1999	C	`conf`	Implementing a Declarative String Query Language with String Restructuring. PADL Raul Hakli, Matti Nykänen, Hellis Tamm, Esko Ukkonen
1999	J	`jnl`	Reasoning about Strings in Databases. J. Comput. Syst. Sci. Gösta Grahne, Matti Nykänen, Esko Ukkonen
1999	—	`conf`	Term Frequency-Based Identification of FAQ-Articles. CoLIS Kai Korpimies, Esko Ukkonen
1999	J	`jnl`	Two- and Higher-Dimensional Pattern Matching in Optimal Expected Time. SIAM J. Comput. Juha Kärkkäinen, Esko Ukkonen
1998	B	`conf`	A Rotation Invariant Filter for Two-Dimensional String Matching. CPM Kimmo Fredriksson, Esko Ukkonen
1998	—	`conf`	Pattern Discovery in Biosequences. ICGI Alvis Brazma, Inge Jonassen, Jaak Vilo, Esko Ukkonen
1998	—	`conf`	Predicting gene regulatory elements from their expression data in the complete yeast genome. German Conference on Bioinformatics Alvis Brazma, Inge Jonassen, Jaak Vilo, Esko Ukkonen
1998	C	`conf`	Searching for General Documents. FQAS Kai Korpimies, Esko Ukkonen
1998	C	`conf`	Term Weighting in Query-Based Document Clustering (Extended Abstract). ADBIS Kai Korpimies, Esko Ukkonen
1997	A	`conf`	Data Mining for Regulatory Elements in Yeast Genome. ISMB Alvis Brazma, Jaak Vilo, Esko Ukkonen, Kimmo Valtonen
1997	—	`conf`	Finding transcription factor binding site combinations in the yeast genome. German Conference on Bioinformatics Alvis Brazma, Jaak Vilo, Esko Ukkonen
1997	J	`jnl`	On the Equivalence Problem for E-Pattern Languages. Theor. Comput. Sci. Enno Ohlebusch, Esko Ukkonen
1997	—	`conf`	Using Trainable Computing Networks in the Optimization of Lake Regulation. ICONIP (2) Markus Huttunen, Esko Ukkonen, Bertel Vehviläinen
1996	J	`jnl`	A Comparison of Approximate String Matching Algorithms. Softw. Pract. Exp. Petteri Jokinen, Jorma Tarhio, Esko Ukkonen
1996	A	`conf`	Discovering Patterns and Subfamilies in Biosequences. ISMB Alvis Brazma, Inge Jonassen, Esko Ukkonen, Jaak Vilo
1996	B	`conf`	Discovering Unbounded Unions of Regular Pattern Languages from Positive Examples (Extended Abstract). ISAAC Alvis Brazma, Esko Ukkonen, Jaak Vilo
1996	B	`conf`	On the Equivalence Problem for E-Pattern Languages. MFCS Enno Ohlebusch, Esko Ukkonen
1996	Misc	`conf`	Sparse Suffix Trees. COCOON Juha Kärkkäinen, Esko Ukkonen
1995	B	`ed.`	Combinatorial Pattern Matching, 6th Annual Symposium, CPM 95, Espoo, Finland, July 5-7, 1995, Proceedings CPM Zvi Galil, Esko Ukkonen
1995	J	`jnl`	Editor's Foreword. Nord. J. Comput. Esko Ukkonen
1995	—	`conf`	MDL learning of unions of simple pattern languages from positive examples. EuroCOLT Pekka Kilpeläinen, Heikki Mannila, Esko Ukkonen
1995	J	`jnl`	On-Line Construction of Suffix Trees. Algorithmica Esko Ukkonen
1994	—	`conf`	A Geometric Approach to Feature Selection. ECML Tapio Elomaa, Esko Ukkonen
1994	—	`conf`	An ALgorithm for Learning Hierarchical Classifiers. ECML Jyrki Kivinen, Heikki Mannila, Esko Ukkonen, Jaak Vilo
1994	J	`jnl`	Finding Lowest Common Ancestors in Arbitrarily Directed Trees. Inf. Process. Lett. Matti Nykänen, Esko Ukkonen
1994	A*	`conf`	Reasoning about Strings in Databases. PODS Gösta Grahne, Matti Nykänen, Esko Ukkonen
1994	A*	`conf`	Two and Higher Dimensional Pattern Matching in Optimal Expected Time. SODA Juha Kärkkäinen, Esko Ukkonen
1993	J	`jnl`	Approximate Boyer-Moore String Matching. SIAM J. Comput. Jorma Tarhio, Esko Ukkonen
1993	J	`jnl`	Approximate String Matching with Suffix Automata. Algorithmica Esko Ukkonen, Derick Wood
1993	B	`conf`	Approximate String-Matching over Suffix Trees. CPM Esko Ukkonen
1993	—	`conf`	Learning rules with local exceptions. EuroCOLT Jyrki Kivinen, Heikki Mannila, Esko Ukkonen
1992	—	`ed.`	Algorithm Theory - SWAT '92, Third Scandinavian Workshop on Algorithm Theory, Helsinki, Finland, July 8-10, 1992, Proceedings SWAT Otto Nurmi, Esko Ukkonen
1992	J	`jnl`	Approximate String Matching with q-grams and Maximal Matches. Theor. Comput. Sci. Esko Ukkonen
1992	—	`conf`	Constructing Suffix Trees On-Line in Linear Time. IFIP Congress (1) Esko Ukkonen
1992	A*	`conf`	Learning Hierarchical Rule Sets. COLT Jyrki Kivinen, Heikki Mannila, Esko Ukkonen
1991	B	`conf`	Two Algorithms for Approximate String Matching in Static Texts. MFCS Petteri Jokinen, Esko Ukkonen
1990	J	`jnl`	A Linear-Time Algorithm for Finding Approximate Shortest Common Superstrings. Algorithmica Esko Ukkonen
1990	—	`conf`	Boyer-Moore Approach to Approximate String Matching (Extended Abstract). SWAT Jorma Tarhio, Esko Ukkonen
1990	J	`jnl`	Unifications, Deunifications, and Their Complexity. BIT Heikki Mannila, Esko Ukkonen
1988	J	`jnl`	A Greedy Approximation Algorithm for Constructing Shortest Common Superstrings. Theor. Comput. Sci. Jorma Tarhio, Esko Ukkonen
1988	—	`conf`	Time Parameter and Arbitrary Deunions in the Set Union Problem. SWAT Heikki Mannila, Esko Ukkonen
1987	—	`conf`	Flow Analysis of Prolog Programs. SLP Heikki Mannila, Esko Ukkonen
1986	B	`conf`	A Greedy Algorithm for Constructing Shortest Common Superstrings. MFCS Jorma Tarhio, Esko Ukkonen
1986	J	`jnl`	Algorithms for the search of amino acid patterns in nucleic acid sequences. Nucleic Acids Res. Hannu Peltola, Hans Söderlund, Esko Ukkonen
1986	B	`conf`	On the Complexity of Unification Sequences. ICLP Heikki Mannila, Esko Ukkonen
1986	A*	`conf`	The Set Union Problem with Backtracking. ICALP Heikki Mannila, Esko Ukkonen
1986	—	`conf`	Timestamped Term Representation for Implementing Prolog. SLP Heikki Mannila, Esko Ukkonen
1985	J	`jnl`	Algorithms for Approximate String Matching Inf. Control. Esko Ukkonen
1985	J	`jnl`	Finding Approximate Patterns in Strings. J. Algorithms Esko Ukkonen
1985	J	`jnl`	Upper Bounds on the Size of LR(k) Parsers. Inf. Process. Lett. Esko Ukkonen
1984	J	`jnl`	A Simple Linear-Time Algorithm for in Situ Merging. Inf. Process. Lett. Heikki Mannila, Esko Ukkonen
1984	—	`conf`	Finding Temporary Terms in Prolog Programs. FGCS Pentti Vataja, Esko Ukkonen
1984	J	`jnl`	SEQAID: a DNA sequence assembling program based on a mathematical model. Nucleic Acids Res. Hannu Peltola, Hans Söderlund, Esko Ukkonen
1983	—	`conf`	Algorithms for Some String Matching Problems Arising in Molecular Genetics. IFIP Congress Hannu Peltola, Hans Söderlund, Jorma Tarhio, Esko Ukkonen
1983	J	`jnl`	Exponential Lower Bounds for Some NP-Complete Problems in a Restricted Linear Decision Tree Model. BIT Esko Ukkonen
1983	J	`jnl`	Lower Bounds on the Size of Deterministic Parsers. J. Comput. Syst. Sci. Esko Ukkonen
1983	B	`conf`	On Approximate String Matching. FCT Esko Ukkonen
1983	J	`jnl`	The Complexity of LALR(k) Testing J. ACM Seppo Sippu, Eljas Soisalon-Soininen, Esko Ukkonen
1983	J	`jnl`	Two Results on Polynomial Time Truth-Table Reductions to Sparse Sets. SIAM J. Comput. Esko Ukkonen
1982	J	`jnl`	Structure Preserving Elimination of Null Productions from Context-Free Grammars. Theor. Comput. Sci. Esko Ukkonen
1982	J	`jnl`	The equivalence problem for some non-real-time deterministic pushdown automata. J. ACM Esko Ukkonen
1981	A*	`conf`	LALR(k) Testing is PSPACE-Complete STOC Esko Ukkonen, Eljas Soisalon-Soininen
1981	J	`jnl`	Minimizing the Number of Evaluation Passes for Attribute Grammars. SIAM J. Comput. Kari-Jouko Räihä, Esko Ukkonen
1981	A*	`conf`	On Size Bounds for Deterministic Parsers. ICALP Esko Ukkonen
1981	J	`jnl`	On the calculation of the effects of roundoff errors. ACM Trans. Math. Softw. Esko Ukkonen
1981	J	`jnl`	The Shortest Common Supersequence Problem over Binary Alphabet is NP-Complete. Theor. Comput. Sci. Kari-Jouko Räihä, Esko Ukkonen
1980	A*	`conf`	A Decision Method for the Equivalence of some Non-Real-Time Deterministic Pushdown Automata STOC Esko Ukkonen
1980	—	`conf`	Balancing Syntactic and Semantic Power in Compiler Specification. IFIP Congress Kari-Jouko Räihä, Esko Ukkonen
1980	A*	`conf`	On the Optimal Assignment of Attributes to Passes in Multi-Pass Attribute Evaluators. ICALP Kari-Jouko Räihä, Esko Ukkonen
1979	J	`jnl`	A Method for Transforming Grammars into LL(k) Form. Acta Informatica Eljas Soisalon-Soininen, Esko Ukkonen
1979	A*	`conf`	A Modification of the LR(k) Method for Constructing Compact Bottom-Up Parsers. ICALP Esko Ukkonen
1979	—	`conf`	Remarks on the Nonexistence of some Covering Grammars. Theoretical Computer Science Esko Ukkonen
1979	J	`jnl`	The Nonexistence of Some Covering Context-Free Grammars. Inf. Process. Lett. Esko Ukkonen
1978	B	`conf`	Tranformations to Produce Certain Covering Grammars. MFCS Esko Ukkonen
1976	A*	`conf`	A Characterization of LL(k) Languages. ICALP Eljas Soisalon-Soininen, Esko Ukkonen