Erkki Mäkinen

ORCID

Publication Activity (10 Years)

Years Active: 1983-2018
Publications (10 Years): 4

Top Venues

Acta Cybern.

Univers. Access Inf. Soc.

Fundam. Informaticae

Soft Comput.

Publications

Kalpana Mahalingam, Prithwineel Paul, Erkki Mäkinen
On Derivation Languages of a Class of Splicing Systems. Acta Cybern. 23 (4) (2018)
Tuomo Hyttinen, Erkki Mäkinen, Timo Poranen
Terrain synthesis using noise by examples. MindTrek (2017)
Sari Walldén, Erkki Mäkinen, Roope Raisamo
A review on objective measurement of usage in technology acceptance studies. Univers. Access Inf. Soc. 15 (4) (2016)
Erkki Mäkinen
A Note on the Emptiness of Intersection Problem for Left Szilard Languages. Acta Cybern. 22 (3) (2016)
Outi Sievi-Korte, Kai Koskimies, Erkki Mäkinen
Techniques for Genetic Software Architecture Design. Comput. J. 58 (11) (2015)
Hongmei He, Zhenhuan Zhu, Erkki Mäkinen
Task-oriented distributed data fusion in autonomous wireless sensor networks. Soft Comput. 19 (8) (2015)
Hongmei He, Ana Salagean, Erkki Mäkinen, Imrich Vrt'o
Various heuristic algorithms to minimise the two-page crossingnumbers of graphs. Open Comput. Sci. 5 (1) (2015)
Liliana Cojocaru, Erkki Mäkinen
On some derivation mechanisms and the complexity of their Szilard languages. Theor. Comput. Sci. 537 (2014)
Sari Walldén, Erkki Mäkinen
On accepting smart environments at user and societal levels. Univers. Access Inf. Soc. 13 (4) (2014)
Sari Walldén, Erkki Mäkinen
Educational Data Mining and Problem-Based Learning. Informatics Educ. 13 (1) (2014)
Liliana Cojocaru, Erkki Mäkinen
Searching for Traces of Communication in Szilard Languages of Parallel Communicating Grammar Systems - Complexity Views. DCFS (2013)
Outi Sievi-Korte, Erkki Mäkinen, Timo Poranen
Simulated Annealing for Aiding Genetic Algorithm in Software Architecture Synthesis. Acta Cybern. 21 (2) (2013)
Liliana Cojocaru, Erkki Mäkinen
The Complexity of Szilard Languages of Matrix Grammars Revisited. Fundam. Informaticae 123 (4) (2013)
Outi Räihä, Kai Koskimies, Erkki Mäkinen
Generating software architecture spectrum with multi-objective genetic algorithms. NaBIC (2011)
Outi Räihä, Kai Koskimies, Erkki Mäkinen
Multi-objective genetic synthesis of software architecture. GECCO (Companion) (2011)
Liliana Cojocaru, Erkki Mäkinen
On the Complexity of Szilard Languages of Regulated Grammars. ICTAC (2011)
Liliana Cojocaru, Erkki Mäkinen
On the Complexity of Szilard Languages of Matrix Grammars. SYNASC (2011)
Outi Räihä, Kai Koskimies, Erkki Mäkinen
Complementary crossover for genetic software architecture synthesis. ISDA (2010)
Hongmei He, Ana Salagean, Erkki Mäkinen
One- and two-page crossing numbers for some types of graphs. Int. J. Comput. Math. 87 (8) (2010)
Hongmei He, Zhenhuan Zhu, Erkki Mäkinen
A Neural Network Model to Minimize the Connected Dominating Set for Self-Configuration of Wireless Sensor Networks. IEEE Trans. Neural Networks 20 (6) (2009)
Outi Räihä, Erkki Mäkinen, Timo Poranen
Using simulated annealing for producing software architectures. GECCO (Companion) (2009)
Liliana Cojocaru, Erkki Mäkinen, Ferucio Laurentiu Tiplea
. SYNASC (2009)
Margareta Ackerman, Erkki Mäkinen
Three New Algorithms for Regular Language Enumeration. COCOON (2009)
Outi Räihä, Kai Koskimies, Erkki Mäkinen
Empirical Study on the Effect of Crossover in Genetic Software Architecture Synthesis. NaBIC (2009)
Outi Räihä, Kai Koskimies, Erkki Mäkinen
Scenario-Based Genetic Synthesis of Software Architecture. ICSEA (2009)
Outi Räihä, Kai Koskimies, Erkki Mäkinen
Genetic Synthesis of Software Architecture. SEAL (2008)
Outi Räihä, Kai Koskimies, Erkki Mäkinen, Tarja Systä
Pattern-Based Genetic Model Refinements in MDA. Nord. J. Comput. 14 (4) (2008)
Hongmei He, Ondrej Sýkora, Erkki Mäkinen
Genetic algorithms for the 2-page book drawing problem of graphs. J. Heuristics 13 (1) (2007)
Hongmei He, Ondrej Sýkora, Ana Salagean, Erkki Mäkinen
Parallelisation of genetic algorithms for the 2-page crossing number problem. J. Parallel Distributed Comput. 67 (2) (2007)
Isto Aho, Erkki Mäkinen
On a parallel machine scheduling problem with precedence constraints. J. Sched. 9 (5) (2006)
Erkki Mäkinen, Harri Siirtola
The Barycenter Heuristic and the Reorderable Matrix. Informatica (Slovenia) 29 (3) (2005)
Harri Siirtola, Erkki Mäkinen
Constructing and reconstructing the reorderable matrix. Inf. Vis. 4 (1) (2005)
Erkki Mäkinen, Tarja Systä
Engineering Software by Grammatical Inference. Informatica (Slovenia) 27 (4) (2003)
Timo Poranen, Erkki Mäkinen, Jyrki Nummenmaa
How to Draw a Sequence Diagram. SPLST (2003)
Erkki Mäkinen
Inferring Finite Transducers. J. Braz. Comput. Soc. 9 (1) (2003)
Ferucio Laurentiu Tiplea, Erkki Mäkinen, Dragos Trinca, Costel Enea
Characterization Results for Time-Varying Codes. Fundam. Informaticae 53 (2) (2002)
Erkki Mäkinen, Tarja Systä
Minimally adequate teacher synthesizes statechart diagrams. Acta Informatica 38 (4) (2002)
Johannes Koskinen, Erkki Mäkinen, Tarja Systä
Implementing a Component-Based Tool for Interactive Synthesis of UML Statechart Diagrams. Acta Cybern. 15 (4) (2002)
Tarja Systä, Kai Koskimies, Erkki Mäkinen
Automated compression of state machines using UML statechart diagram notation. Inf. Softw. Technol. 44 (10) (2002)
Ferucio Laurentiu Tiplea, Erkki Mäkinen, Constantin Enea
SE-Systems, Timing Mechanisms, and Time-Varying Codes. Int. J. Comput. Math. 79 (10) (2002)
Ferucio Laurentiu Tiplea, Erkki Mäkinen
On the Complexity of a Problem on Monadic String Rewriting Systems. J. Autom. Lang. Comb. 7 (4) (2002)
Jarmo Siltaneva, Erkki Mäkinen
A Comparison of Random Binary Tree Generators. Comput. J. 45 (6) (2002)
Erkki Mäkinen, Tarja Systä
MAS - An Interactive Synthesizer to Support Behavioral Modeling in UML. ICSE (2001)
Erkki Mäkinen
On the longest upsequence problem for permutations. Int. J. Comput. Math. 77 (1) (2001)
Ferucio Laurentiu Tiplea, Erkki Mäkinen
A note on synchronized extension systems. Inf. Process. Lett. 79 (1) (2001)
Ferucio Laurentiu Tiplea, Erkki Mäkinen
On the Complexity of a Problem on Monadic String Rewriting Systems. DCFS (2001)
Erkki Mäkinen
Comment on 'A Framework for Modelling Trojans and Computer Virus Infection'. Comput. J. 44 (4) (2001)
Ferucio Laurentiu Tiplea, Erkki Mäkinen, Corina Apachite
Synchronized extension systems. Acta Informatica 37 (6) (2001)
Erkki Mäkinen, Timo Poranen, Petri Vuorenmaa
A genetic algorithm for determining the thickness of a graph. Inf. Sci. 138 (1-4) (2001)
Erkki Mäkinen
On the Inclusion Problem for Very Simple Deterministic Pushdown Automata. J. Autom. Lang. Comb. 6 (3) (2001)
Ferucio Laurentiu Tiplea, Erkki Mäkinen
A Note on SE-Systems and Regular Canonical Systems. Fundam. Informaticae 46 (3) (2001)
Erkki Mäkinen
A Conjecture on the Error Bound of the Barycenter Heuristic. Bull. EATCS 70 (2000)
Takeshi Koshiba, Erkki Mäkinen, Yuji Takada
Inferring pure context-free languages from positive data. Acta Cybern. 14 (3) (2000)
Erkki Mäkinen, Markku Siermala
Restricted universe data structures. ACM SIGCSE Bull. 32 (2) (2000)
Jarmo Siltaneva, Erkki Mäkinen
A note on the expected distribution of degrees in random binary trees. ACM SIGCSE Bull. 32 (4) (2000)
Erkki Mäkinen, Harri Siirtola
Reordering the Reorderable Matrix as an Algorithmic Problem. Diagrams (2000)
Erkki Mäkinen
On inferring linear single-tree languages. Inf. Process. Lett. 73 (1-2) (2000)
Erkki Mäkinen
Constructing a binary tree efficiently from its traversals. Int. J. Comput. Math. 75 (2) (2000)
Erkki Mäkinen
On inferring zero-reversible languages. Acta Cybern. 14 (3) (2000)
Isto Aho, Harri Kemppainen, Kai Koskimies, Erkki Mäkinen, Tapio Niemi
Searching neural network structures with L systems and genetic algorithms. Int. J. Comput. Math. 73 (1) (1999)
Erkki Mäkinen
Inferring regular languages by merging nonterminals. Int. J. Comput. Math. 70 (4) (1999)
Erkki Mäkinen
Generating Random Binary Trees - A Survey. Inf. Sci. 115 (1-4) (1999)
Erkki Mäkinen
Ranking and unranking left szilard languages. Int. J. Comput. Math. 68 (1-2) (1998)
Erkki Mäkinen
Binary Tree Code Words as Context-Free Languages. Comput. J. 41 (6) (1998)
Isto Aho, Erkki Mäkinen, Tarja Systä
Remarks on the Thickness of a Graph. Inf. Sci. 108 (1-4) (1998)
Takeshi Koshiba, Erkki Mäkinen, Yuji Takada
Learning Deterministic even Linear Languages From Positive Examples. Theor. Comput. Sci. 185 (1) (1997)
Ferucio Laurentiu Tiplea, Erkki Mäkinen
Jumping Petri Nets - Specific Properties. Developments in Language Theory (1997)
Ferucio Laurentiu Tiplea, Erkki Mäkinen
Jumping Petri Nets. Specific Properties. Fundam. Informaticae 32 (3-4) (1997)
Erkki Mäkinen
Inferring Uniquely Terminating Regular Languages from Positive Data. Inf. Process. Lett. 62 (2) (1997)
Erkki Mäkinen, Ferucio Laurentiu Tiplea
Pattern Ambiguities for Pure Context-Free Grammars. Fundam. Informaticae 30 (2) (1997)
Erkki Mäkinen
On Lexicographic Enumeration of Regular and Context-Free Languages. Acta Cybern. 13 (1) (1997)
Erkki Mäkinen
Programming projects on chess. ACM SIGCSE Bull. 28 (4) (1996)
Erkki Mäkinen
(0,1)-Totality is Undecidable for Arbitrary Context-Free Grammars. Fundam. Informaticae 27 (4) (1996)
Erkki Mäkinen
A Note on the Grammatical Inference Problem for Even Linear Languages. Fundam. Informaticae 25 (2) (1996)
Erkki Mäkinen
A family of languages which is polynomial-time learnable from positive data in pitt's sense. Int. J. Comput. Math. 61 (3-4) (1996)
Takeshi Koshiba, Erkki Mäkinen, Yuji Takada
Learning Strongly Deterministic Even Linear Languages from Positive Examples. ALT (1995)
Harri Klemetti, Ismo Lapinleimu, Erkki Mäkinen, Mika Sieranta
A programming project: trimming the spring algorithm for drawing hypergraphs. ACM SIGCSE Bull. 27 (3) (1995)
Juha Lehikoinen, Erkki Mäkinen
A New Distance-based Coding Method For Binary Trees. Bull. EATCS 55 (1995)
Kai Koskimies, Erkki Mäkinen
Automatic Synthesis of State Machines from Trace Diagrams. Softw. Pract. Exp. 24 (7) (1994)
Erkki Mäkinen
A note on Graftings, Rotations, and Distances in Binary Trees. Bull. EATCS 46 (1992)
Erkki Mäkinen
On Grammatical inference and derivational complexity of context grammars. Fundam. Informaticae 17 (4) (1992)
Erkki Mäkinen
On the Structural Grammatical Inference Problem for Some Classes of Context-Free Grammars. Inf. Process. Lett. 42 (1) (1992)
Erkki Mäkinen
Remarks on the Structural Grammatical Inference Problem for Context-Free Grammars. Inf. Process. Lett. 44 (3) (1992)
Erkki Mäkinen
On the generative capacity of context-free matrix grammars over one-letter alphabet. Fundam. Informaticae 16 (1) (1992)
Erkki Mäkinen
On drawing regular bipartite graphs. Int. J. Comput. Math. 43 (1-2) (1992)
Erkki Mäkinen
A Survey on Binary Tree Codings. Comput. J. 34 (5) (1991)
Erkki Mäkinen
A hierarchy of context-free derivations. Fundam. Informaticae 14 (2) (1991)
Erkki Mäkinen
On pure context-free language and left szilard languages. Fundam. Informaticae 15 (1) (1991)
Erkki Mäkinen
How to draw a hypergraph. Int. J. Comput. Math. 34 (3-4) (1990)
Erkki Mäkinen
On Breadth-first Context-free Grammars. J. Inf. Process. Cybern. 26 (3) (1990)
Erkki Mäkinen
Experiments on drawing 2-level hierarchical graphs. Int. J. Comput. Math. 37 (3-4) (1990)
Erkki Mäkinen
The Grammatical Inference Problem for the Szilard Languages of Linear Grammars. Inf. Process. Lett. 36 (4) (1990)
Jyrki Katajainen, Erkki Mäkinen
A note on the complexity of trie compaction. Bull. EATCS 41 (1990)
Erkki Mäkinen
Experiments on drawing 2-level hierarchical graphs. Int. J. Comput. Math. 36 (3-4) (1990)
Jyrki Katajainen, Erkki Mäkinen
Tree Compression and Optimization with Applications. Int. J. Found. Comput. Sci. 1 (4) (1990)
Erkki Mäkinen
On Implementing Two Adaptive Data-Compression Schemes. Comput. J. 32 (3) (1989)
Erkki Mäkinen
On the Subtree Isomorphism Problem for Ordered Trees. Inf. Process. Lett. 32 (5) (1989)
Erkki Mäkinen
On the Rotation Distance of Binary Trees. Inf. Process. Lett. 26 (5) (1988)
Erkki Mäkinen
On Linear Search Heuristics. Inf. Process. Lett. 29 (1) (1988)
Erkki Mäkinen
Left Distance Binary Tree Representations. BIT 27 (2) (1987)

Erkki Mäkinen.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Erkki Mäkinen