Esko Ukkonen

According to our database, Esko Ukkonen authored at least 147 papers between 1976 and 2020.

Collaborative distances:

• Dijkstra number of three.
• Erdős number of three.

2020

MODER2: first-order Markov modeling and discovery of monomeric and dimeric binding motifs.

Jarkko Toivonen, Pratyush K. Das, Jussi Taipale, Esko Ukkonen

Bioinform., 2020

2018

Discovery of Regulatory Motifs in DNA.

Esko Ukkonen

Proceedings of the Prague Stringology Conference 2018, 2018

2017

Accurate self-correction of errors in long reads using de Bruijn graphs.

Leena Salmela, Riku Walve, Eric Rivals, Esko Ukkonen

Bioinform., 2017

Fast motif matching revisited: high-order PWMs, SNPs and indels.

Janne H. Korhonen, Kimmo Palin, Jussi Taipale, Esko Ukkonen

Bioinform., 2017

Seed-driven Learning of Position Probability Matrices from Large Sequence Sets.

Jarkko Toivonen, Jussi Taipale, Esko Ukkonen

Proceedings of the 17th International Workshop on Algorithms in Bioinformatics, 2017

2016

Point Pattern Matching.

Veli Mäkinen, Esko Ukkonen

Encyclopedia of Algorithms, 2016

2015

Longest common substrings with k mismatches.

Tomás Flouri, Emanuele Giaquinta, Kassian Kobert, Esko Ukkonen

Inf. Process. Lett., 2015

2014

Motif matching using gapped patterns.

Emanuele Giaquinta, Kimmo Fredriksson, Szymon Grabowski, Alexandru I. Tomescu, Esko Ukkonen

Theor. Comput. Sci., 2014

2013

Fast Matching of Transcription Factor Motifs Using Generalized Position Weight Matrix Models.

Emanuele Giaquinta, Szymon Grabowski, Esko Ukkonen

J. Comput. Biol., 2013

Motif Matching Using Gapped Patterns.

Emanuele Giaquinta, Kimmo Fredriksson, Szymon Grabowski, Esko Ukkonen

Proceedings of the Combinatorial Algorithms - 24th International Workshop, 2013

2012

How to Reconstruct a Genome.

Esko Ukkonen

Proceedings of the Mathematical Foundations of Computer Science 2012, 2012

2011

Finding Significant Matches of Position Weight Matrices in Linear Time.

Cinzia Pizzi, Pasi Rastas, Esko Ukkonen

IEEE ACM Trans. Comput. Biol. Bioinform., 2011

Editorial.

Gregory Kucherov, Esko Ukkonen

J. Discrete Algorithms, 2011

Fast scaffolding with small independent mixed integer programs.

Leena Salmela, Veli Mäkinen, Niko Välimäki, Johannes Ylinen, Esko Ukkonen

Bioinform., 2011

Efficient algorithms for the discovery of gapped factors.

Alberto Apostolico, Cinzia Pizzi, Esko Ukkonen

Algorithms Mol. Biol., 2011

Editors' Introduction.

Jyrki Kivinen, Csaba Szepesvári, Esko Ukkonen, Thomas Zeugmann

Proceedings of the Algorithmic Learning Theory - 22nd International Conference, 2011

2010

Geometric Point Pattern Matching in the Knuth-Morris-Pratt Way.

Esko Ukkonen

J. Univers. Comput. Sci., 2010

On the complexity of finding gapped motifs.

Morris Michael, François Nicolas, Esko Ukkonen

J. Discrete Algorithms, 2010

2009

Maximal and minimal representations of gapped and non-gapped motifs of a string.

Esko Ukkonen

Theor. Comput. Sci., 2009

Efficient construction of maximal and minimal representations of motifs of a string.

François Nicolas, Veli Mäkinen, Esko Ukkonen

Theor. Comput. Sci., 2009

MOODS: fast search for position weight matrix matches in DNA sequences.

Janne H. Korhonen, Petri Martinmäki, Cinzia Pizzi, Pasi Rastas, Esko Ukkonen

Bioinform., 2009

Motif Construction from High-Throughput SELEX Data.

Esko Ukkonen

Proceedings of the Bioinformatics Research and Applications, 5th International Symposium, 2009

2008

Point Pattern Matching.

Veli Mäkinen, Esko Ukkonen

Proceedings of the Encyclopedia of Algorithms - 2008 Edition, 2008

Multidimensional String Matching.

Juha Kärkkäinen, Esko Ukkonen

Proceedings of the Encyclopedia of Algorithms - 2008 Edition, 2008

Fast profile matching algorithms - A survey.

Cinzia Pizzi, Esko Ukkonen

Theor. Comput. Sci., 2008

ReMatch: 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. Integr. Bioinform., 2008

An analytic and systematic framework for estimating metabolic flux ratios from ¹³<i>C </i>tracer experiments.

Ari Rantanen, Juho Rousu, Paula Jouhten, Nicola Zamboni, Hannu Maaheimo, Esko Ukkonen

BMC Bioinform., 2008

The BREW workshop series: a stimulating experience in PhD education.

Robert Giegerich, Alvis Brazma, Inge Jonassen, Esko Ukkonen, Martin Vingron

Briefings Bioinform., 2008

A Computational Method for Reconstructing Gapless Metabolic Networks.

Esa Pitkänen, Ari Rantanen, Juho Rousu, Esko Ukkonen

Proceedings of the Bioinformatics Research and Development, 2008

2007

Probabilistic modeling and machine learning in structural and systems biology.

Samuel Kaski, Juho Rousu, Esko Ukkonen

BMC Bioinform., 2007

Haplotype Inference Via Hierarchical Genotype Parsing.

Pasi Rastas, Esko Ukkonen

Proceedings of the Algorithms in Bioinformatics, 7th International Workshop, 2007

Structural Analysis of Gapped Motifs of a String.

Esko Ukkonen

Proceedings of the Mathematical Foundations of Computer Science 2007, 2007

Fast Search Algorithms for Position Specific Scoring Matrices.

Cinzia Pizzi, Pasi Rastas, Esko Ukkonen

Proceedings of the Bioinformatics Research and Development, First International Conference, 2007

2006

Equivalence of Metabolite Fragments and Flow Analysis of Isotopomer Distributions for Flux Estimation.

Ari Rantanen, Hannu Maaheimo, Esa Pitkänen, Juho Rousu, Esko Ukkonen

Trans. Comp. Sys. Biology, 2006

On size reduction techniques for multitape automata.

Hellis Tamm, Matti Nykänen, Esko Ukkonen

Theor. Comput. Sci., 2006

The complexity of maximum matroid-greedoid intersection and weighted greedoid maximization^,.

Taneli Mielikäinen, Esko Ukkonen

Discret. Appl. Math., 2006

Planning optimal measurements of isotopomer distributions for estimation of metabolic fluxes.

Ari Rantanen, Taneli Mielikäinen, Juho Rousu, Hannu Maaheimo, Esko Ukkonen

Bioinform., 2006

2005

Sequential and indexed two-dimensional combinatorial template matching allowing rotations.

Kimmo Fredriksson, Gonzalo Navarro, Esko Ukkonen

Theor. Comput. Sci., 2005

Transposition invariant string matching.

Veli Mäkinen, Gonzalo Navarro, Esko Ukkonen

J. Algorithms, 2005

Optimization of cDNA-AFLP experiments using genomic sequence data.

Teemu Kivioja, Mikko Arvas, Markku Saloheimo, Merja Penttilä, Esko Ukkonen

Bioinform., 2005

Size Reduction of Multitape Automata.

Hellis Tamm, Matti Nykänen, Esko Ukkonen

Proceedings of the Implementation and Application of Automata, 2005

A Hidden Markov Technique for Haplotype Reconstruction.

Pasi Rastas, Mikko Koivisto, Heikki Mannila, Esko Ukkonen

Proceedings of the Algorithms in Bioinformatics, 5th International Workshop, 2005

Finding Feasible Pathways in Metabolic Networks.

Esa Pitkänen, Ari Rantanen, Juho Rousu, Esko Ukkonen

Proceedings of the Advances in Informatics, 2005

Planning isotopomer measurements for estimation of metabolic fluxes.

Ari Rantanen, Taneli Mielikäinen, Juho Rousu, Esko Ukkonen

Proceedings of the German Conference on Bioinformatics (GCB 2005), Hamburg, 2005

2004

Bideterministic automata and minimal representations of regular languages.

Hellis Tamm, Esko Ukkonen

Theor. Comput. Sci., 2004

The Computational Complexity of Orientation Search Problems in Cryo-Electron Microscopy

Taneli Mielikäinen, Janne Ravantti, Esko Ukkonen

CoRR, 2004

The Complexity of Maximum Matroid-Greedoid Intersection and Weighted Greedoid Maximization

Taneli Mielikäinen, Esko Ukkonen

CoRR, 2004

The Computational Complexity of Orientation Search in Cryo-Electron Microscopy.

Taneli Mielikäinen, Janne Ravantti, Esko Ukkonen

Proceedings of the Computational Science, 2004

Recombination Systems.

Mikko Koivisto, Pasi Rastas, Esko Ukkonen

Proceedings of the Theory Is Forever, 2004

Hidden Markov Modelling Techniques for Haplotype Analysis.

Mikko Koivisto, Teemu Kivioja, Heikki Mannila, Pasi Rastas, Esko Ukkonen

Proceedings of the Algorithmic Learning Theory, 15th International Conference, 2004

Local Approximate 3D Matching of Proteins in Viral Cryo-EM Density Maps.

Stefan Burkhardt, Kimmo Fredriksson, Tuomas Ojamies, Janne Ravantti, Esko Ukkonen

Proceedings of the 2nd International Symposium on 3D Data Processing, 2004

2003

Approximate string matching on Ziv-Lempel compressed text.

Juha Kärkkäinen, Gonzalo Navarro, Esko Ukkonen

J. Discrete Algorithms, 2003

Design and implementation of a string database query language.

Gösta Grahne, Raul Hakli, Matti Nykänen, Hellis Tamm, Esko Ukkonen

Inf. Syst., 2003

Approximate Matching of Run-Length Compressed Strings.

Veli Mäkinen, Esko Ukkonen, Gonzalo Navarro

Algorithmica, 2003

Matching Numeric Strings under Noise.

Veli Mäkinen, Gonzalo Navarro, Esko Ukkonen

Proceedings of the Prague Stringology Conference 2003, Prague, Czech Republic, 2003

Algorithms for Transposition Invariant String Matching.

Veli Mäkinen, Gonzalo Navarro, Esko Ukkonen

Proceedings of the STACS 2003, 20th Annual Symposium on Theoretical Aspects of Computer Science, Berlin, Germany, February 27, 2003

An 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

Proceedings of the 8th Pacific Symposium on Biocomputing, 2003

Geometric algorithms for transposition invariant content based music retrieval.

Esko Ukkonen, Kjell Lemström, Veli Mäkinen

Proceedings of the ISMIR 2003, 2003

The C-BRAHMS project.

Kjell Lemström, Veli Mäkinen, Anna Pienimäki, Mika Turkia, Esko Ukkonen

Proceedings of the ISMIR 2003, 2003

A Method for Estimating Metabolic Fluxes from Incomplete Isotopomer Information.

Juho Rousu, Ari Rantanen, Hannu Maaheimo, Esa Pitkänen, Katja Saarela, Esko Ukkonen

Proceedings of the Computational Methods in Systems Biology, First International Workshop, 2003

Sweepline the Music!

Esko Ukkonen, Kjell Lemström, Veli Mäkinen

Proceedings of the Computer Science in Perspective, Essays Dedicated to Thomas Ottmann, 2003

2002

The Exact Path Length Problem.

Matti Nykänen, Esko Ukkonen

J. Algorithms, 2002

Online timestamped text indexing.

Amihood Amir, Gad M. Landau, Esko Ukkonen

Inf. Process. Lett., 2002

Finding Founder Sequences from a Set of Recombinants.

Esko Ukkonen

Proceedings of the Algorithms in Bioinformatics, Second International Workshop, 2002

Assigning probes into a small number of pools separable by electrophoresis.

Teemu Kivioja, Mikko Arvas, Kari Kataja, Merja Penttilä, Hans Söderlund, Esko Ukkonen

Proceedings of the Tenth International Conference on Intelligent Systems for Molecular Biology, 2002

Correlating gene promoters and expression in gene disruption experiments.

Kimmo Palin, Esko Ukkonen, Alvis Brazma, Jaak Vilo

Proceedings of the European Conference on Computational Biology (ECCB 2002), 2002

Local Similarity Based Point-Pattern Matching.

Veli Mäkinen, Esko Ukkonen

Proceedings of the Combinatorial Pattern Matching, 13th Annual Symposium, 2002

Optimal Exact and Fast Approximate Two Dimensional Pattern Matching Allowing Rotations.

Kimmo Fredriksson, Gonzalo Navarro, Esko Ukkonen

Proceedings of the Combinatorial Pattern Matching, 13th Annual Symposium, 2002

2001

Faster template matching without FFT.

Kimmo Fredriksson, Esko Ukkonen

Proceedings of the 2001 International Conference on Image Processing, 2001

The Complexity of Maximum Matroid-Greedoid Intersection.

Taneli Mielikäinen, Esko Ukkonen

Proceedings of the Fundamentals of Computation Theory, 13th International Symposium, 2001

2000

Toward Complete Genome Data Mining in Computational Biology.

Esko Ukkonen

Proceedings of the Algorithm Theory, 2000

Combinatorial Methods for Approximate Pattern Matching under Rotations and Translations in 3D Arrays.

Kimmo Fredriksson, Esko Ukkonen

Proceedings of the Seventh International Symposium on String Processing and Information Retrieval, 2000

Mining for Putative Regulatory Elements in the Yeast Genome Using Gene Expression Data.

Jaak Vilo, Alvis Brazma, Inge Jonassen, Alan J. Robinson, Esko Ukkonen

Proceedings of the Eighth International Conference on Intelligent Systems for Molecular Biology, 2000

An Index for Two Dimensional String Matching Allowing Rotations.

Kimmo Fredriksson, Gonzalo Navarro, Esko Ukkonen

Proceedings of the Theoretical Computer Science, 2000

Approximate String Matching over Ziv-Lempel Compressed Text.

Juha Kärkkäinen, Gonzalo Navarro, Esko Ukkonen

Proceedings of the Combinatorial Pattern Matching, 11th Annual Symposium, 2000

1999

Two- and Higher-Dimensional Pattern Matching in Optimal Expected Time.

Juha Kärkkäinen, Esko Ukkonen

SIAM J. Comput., 1999

Combinatorial methods for approximate image matching under translations and rotations.

Kimmo Fredriksson, Esko Ukkonen

Pattern Recognit. Lett., 1999

Reasoning about Strings in Databases.

Gösta Grahne, Matti Nykänen, Esko Ukkonen

J. Comput. Syst. Sci., 1999

Finding Paths with the Right Cost.

Matti Nykänen, Esko Ukkonen

Proceedings of the STACS 99, 1999

Implementing a Declarative String Query Language with String Restructuring.

Raul Hakli, Matti Nykänen, Hellis Tamm, Esko Ukkonen

Proceedings of the Practical Aspects of Declarative Languages, 1999

Term Frequency-Based Identification of FAQ-Articles.

Kai Korpimies, Esko Ukkonen

Proceedings of the Digital Libraries: Interdisciplinary Concepts, 1999

1998

Pattern Discovery in Biosequences.

Alvis Brazma, Inge Jonassen, Jaak Vilo, Esko Ukkonen

Proceedings of the Grammatical Inference, 4th International Colloquium, 1998

Predicting gene regulatory elements from their expression data in the complete yeast genome.

Alvis Brazma, Inge Jonassen, Jaak Vilo, Esko Ukkonen

Proceedings of the German Conference on Bioinformatics, 1998

Searching for General Documents.

Kai Korpimies, Esko Ukkonen

Proceedings of the Flexible Query Answering Systems, Third International Conference, 1998

A Rotation Invariant Filter for Two-Dimensional String Matching.

Kimmo Fredriksson, Esko Ukkonen

Proceedings of the Combinatorial Pattern Matching, 9th Annual Symposium, 1998

Term Weighting in Query-Based Document Clustering (Extended Abstract).

Kai Korpimies, Esko Ukkonen

Proceedings of the Advances in Databases and Information Systems, 1998

1997

On the Equivalence Problem for E-Pattern Languages.

Enno Ohlebusch, Esko Ukkonen

Theor. Comput. Sci., 1997

Data Mining for Regulatory Elements in Yeast Genome.

Alvis Brazma, Jaak Vilo, Esko Ukkonen, Kimmo Valtonen

Proceedings of the 5th International Conference on Intelligent Systems for Molecular Biology, 1997

Using Trainable Computing Networks in the Optimization of Lake Regulation.

Markus Huttunen, Esko Ukkonen, Bertel Vehviläinen

Proceedings of the Progress in Connectionist-Based Information Systems: Proceedings of the 1997 International Conference on Neural Information Processing and Intelligent Information Systems, 1997

Finding transcription factor binding site combinations in the yeast genome.

Alvis Brazma, Jaak Vilo, Esko Ukkonen

Proceedings of the German Conference on Bioinformatics, 1997

1996

A Comparison of Approximate String Matching Algorithms.

Petteri Jokinen, Jorma Tarhio, Esko Ukkonen

Softw. Pract. Exp., 1996

Discovering Patterns and Subfamilies in Biosequences.

Alvis Brazma, Inge Jonassen, Esko Ukkonen, Jaak Vilo

Proceedings of the Fourth International Conference on Intelligent Systems for Molecular Biology, 1996

Discovering Unbounded Unions of Regular Pattern Languages from Positive Examples (Extended Abstract).

Alvis Brazma, Esko Ukkonen, Jaak Vilo

Proceedings of the Algorithms and Computation, 7th International Symposium, 1996

Sparse Suffix Trees.

Juha Kärkkäinen, Esko Ukkonen

Proceedings of the Computing and Combinatorics, Second Annual International Conference, 1996

1995

Editor's Foreword.

Esko Ukkonen

Nord. J. Comput., 1995

On-Line Construction of Suffix Trees.

Esko Ukkonen

Algorithmica, 1995

MDL learning of unions of simple pattern languages from positive examples.

Pekka Kilpeläinen, Heikki Mannila, Esko Ukkonen

Proceedings of the Computational Learning Theory, Second European Conference, 1995

1994

Finding Lowest Common Ancestors in Arbitrarily Directed Trees.

Matti Nykänen, Esko Ukkonen

Inf. Process. Lett., 1994

An ALgorithm for Learning Hierarchical Classifiers.

Jyrki Kivinen, Heikki Mannila, Esko Ukkonen, Jaak Vilo

Proceedings of the Machine Learning: ECML-94, 1994

A Geometric Approach to Feature Selection.

Tapio Elomaa, Esko Ukkonen

Proceedings of the Machine Learning: ECML-94, 1994

1993

Approximate Boyer-Moore String Matching.

Jorma Tarhio, Esko Ukkonen

SIAM J. Comput., 1993

Approximate String Matching with Suffix Automata.

Esko Ukkonen, Derick Wood

Algorithmica, 1993

Learning rules with local exceptions.

Jyrki Kivinen, Heikki Mannila, Esko Ukkonen

Proceedings of the First European Conference on Computational Learning Theory, 1993

Approximate String-Matching over Suffix Trees.

Esko Ukkonen

Proceedings of the Combinatorial Pattern Matching, 4th Annual Symposium, 1993

1992

Approximate String Matching with q-grams and Maximal Matches.

Esko Ukkonen

Theor. Comput. Sci., 1992

Constructing Suffix Trees On-Line in Linear Time.

Esko Ukkonen

Proceedings of the Algorithms, Software, Architecture, 1992

Learning Hierarchical Rule Sets.

Jyrki Kivinen, Heikki Mannila, Esko Ukkonen

Proceedings of the Fifth Annual ACM Conference on Computational Learning Theory, 1992

1991

Two Algorithms for Approximate String Matching in Static Texts.

Petteri Jokinen, Esko Ukkonen

Proceedings of the Mathematical Foundations of Computer Science 1991, 1991

1990

Unifications, Deunifications, and Their Complexity.

Heikki Mannila, Esko Ukkonen

BIT, 1990

A Linear-Time Algorithm for Finding Approximate Shortest Common Superstrings.

Esko Ukkonen

Algorithmica, 1990

Boyer-Moore Approach to Approximate String Matching (Extended Abstract).

Jorma Tarhio, Esko Ukkonen

Proceedings of the SWAT 90, 1990

1988

A Greedy Approximation Algorithm for Constructing Shortest Common Superstrings.

Jorma Tarhio, Esko Ukkonen

Theor. Comput. Sci., 1988

Time Parameter and Arbitrary Deunions in the Set Union Problem.

Heikki Mannila, Esko Ukkonen

Proceedings of the SWAT 88, 1988

1987

Flow Analysis of Prolog Programs.

Heikki Mannila, Esko Ukkonen

Proceedings of the 1987 Symposium on Logic Programming, San Francisco, California, USA, August 31, 1987

1986

Algorithms for the search of amino acid patterns in nucleic acid sequences.

Hannu Peltola, Hans Söderlund, Esko Ukkonen

Nucleic Acids Res., 1986

Timestamped Term Representation for Implementing Prolog.

Heikki Mannila, Esko Ukkonen

Proceedings of the 1986 Symposium on Logic Programming, 1986

A Greedy Algorithm for Constructing Shortest Common Superstrings.

Jorma Tarhio, Esko Ukkonen

Proceedings of the Mathematical Foundations of Computer Science 1986, 1986

On the Complexity of Unification Sequences.

Heikki Mannila, Esko Ukkonen

Proceedings of the Third International Conference on Logic Programming, 1986

The Set Union Problem with Backtracking.

Heikki Mannila, Esko Ukkonen

Proceedings of the Automata, Languages and Programming, 13th International Colloquium, 1986

1985

Finding Approximate Patterns in Strings.

Esko Ukkonen

J. Algorithms, 1985

Upper Bounds on the Size of LR(k) Parsers.

Esko Ukkonen

Inf. Process. Lett., 1985

Algorithms for Approximate String Matching

Esko Ukkonen

Inf. Control., 1985

1984

SEQAID: a DNA sequence assembling program based on a mathematical model.

Hannu Peltola, Hans Söderlund, Esko Ukkonen

Nucleic Acids Res., 1984

A Simple Linear-Time Algorithm for in Situ Merging.

Heikki Mannila, Esko Ukkonen

Inf. Process. Lett., 1984

Finding Temporary Terms in Prolog Programs.

Pentti Vataja, Esko Ukkonen

Proceedings of the International Conference on Fifth Generation Computer Systems, 1984

1983

The Complexity of LALR(k) Testing

Seppo Sippu, Eljas Soisalon-Soininen, Esko Ukkonen

J. ACM, April, 1983

Two Results on Polynomial Time Truth-Table Reductions to Sparse Sets.

Esko Ukkonen

SIAM J. Comput., 1983

Lower Bounds on the Size of Deterministic Parsers.

Esko Ukkonen

J. Comput. Syst. Sci., 1983

Exponential Lower Bounds for Some NP-Complete Problems in a Restricted Linear Decision Tree Model.

Esko Ukkonen

BIT, 1983

Algorithms for Some String Matching Problems Arising in Molecular Genetics.

Hannu Peltola, Hans Söderlund, Jorma Tarhio, Esko Ukkonen

Proceedings of the Information Processing 83, 1983

On Approximate String Matching.

Esko Ukkonen

Proceedings of the Fundamentals of Computation Theory, 1983

1982

Structure Preserving Elimination of Null Productions from Context-Free Grammars.

Esko Ukkonen

Theor. Comput. Sci., 1982

The equivalence problem for some non-real-time deterministic pushdown automata.

Esko Ukkonen

J. ACM, 1982

1981

On the calculation of the effects of roundoff errors.

Esko Ukkonen

ACM Trans. Math. Softw., 1981

The Shortest Common Supersequence Problem over Binary Alphabet is NP-Complete.

Kari-Jouko Räihä, Esko Ukkonen

Theor. Comput. Sci., 1981

Minimizing the Number of Evaluation Passes for Attribute Grammars.

Kari-Jouko Räihä, Esko Ukkonen

SIAM J. Comput., 1981

LALR(k) Testing is PSPACE-Complete

Esko Ukkonen, Eljas Soisalon-Soininen

Proceedings of the 13th Annual ACM Symposium on Theory of Computing, 1981

On Size Bounds for Deterministic Parsers.

Esko Ukkonen

Proceedings of the Automata, 1981

1980

A Decision Method for the Equivalence of some Non-Real-Time Deterministic Pushdown Automata

Esko Ukkonen

Proceedings of the 12th Annual ACM Symposium on Theory of Computing, 1980

Balancing Syntactic and Semantic Power in Compiler Specification.

Kari-Jouko Räihä, Esko Ukkonen

Proceedings of the Information Processing, Proceedings of the 8th IFIP Congress 1980, Tokyo, Japan - October 6-9, 1980 and Melbourne, Australia, 1980

On the Optimal Assignment of Attributes to Passes in Multi-Pass Attribute Evaluators.

Kari-Jouko Räihä, Esko Ukkonen

Proceedings of the Automata, 1980

1979

The Nonexistence of Some Covering Context-Free Grammars.

Esko Ukkonen

Inf. Process. Lett., 1979

A Method for Transforming Grammars into LL(k) Form.

Eljas Soisalon-Soininen, Esko Ukkonen

Acta Informatica, 1979

Remarks on the Nonexistence of some Covering Grammars.

Esko Ukkonen

Proceedings of the Theoretical Computer Science, 1979

A Modification of the LR(k) Method for Constructing Compact Bottom-Up Parsers.

Esko Ukkonen

Proceedings of the Automata, 1979

1978

Tranformations to Produce Certain Covering Grammars.

Esko Ukkonen

Proceedings of the Mathematical Foundations of Computer Science 1978, 1978

1976

A Characterization of LL(k) Languages.

Eljas Soisalon-Soininen, Esko Ukkonen

Proceedings of the Third International Colloquium on Automata, 1976