default search action
Erkki Mäkinen
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2010 – 2019
- 2018
- [j92]Kalpana Mahalingam
, Prithwineel Paul
On Derivation Languages of a Class of Splicing Systems. Acta Cybern. 23(4): 981-993 (2018) - 2017
- [c19]Tuomo Hyttinen, Erkki Mäkinen, Timo Poranen:
Terrain synthesis using noise by examples. MindTrek 2017: 17-25 - 2016
- [j91]Erkki Mäkinen
A Note on the Emptiness of Intersection Problem for Left Szilard Languages. Acta Cybern. 22(3): 613-616 (2016) - [j90]Sari Walldén, Erkki Mäkinen
A review on objective measurement of usage in technology acceptance studies. Univers. Access Inf. Soc. 15(4): 713-726 (2016) - 2015
- [j89]Hongmei He
Various heuristic algorithms to minimise the two-page crossingnumbers of graphs. Open Comput. Sci. 5(1) (2015) - [j88]Outi Sievi-Korte
Techniques for Genetic Software Architecture Design. Comput. J. 58(11): 3141-3170 (2015) - [j87]Hongmei He
Task-oriented distributed data fusion in autonomous wireless sensor networks. Soft Comput. 19(8): 2305-2319 (2015) - [e1]Jyrki Nummenmaa, Outi Sievi-Korte, Erkki Mäkinen:
Proceedings of the 14th Symposium on Programming Languages and Software Tools (SPLST'15), Tampere, Finland, October 9-10, 2015. CEUR Workshop Proceedings 1525, CEUR-WS.org 2015 [contents] - 2014
- [j86]Sari Walldén, Erkki Mäkinen:
Educational Data Mining and Problem-Based Learning. Informatics Educ. 13(1): 141-156 (2014) - [j85]Liliana Cojocaru, Erkki Mäkinen
On some derivation mechanisms and the complexity of their Szilard languages. Theor. Comput. Sci. 537: 87-96 (2014) - [j84]Sari Walldén, Erkki Mäkinen
On accepting smart environments at user and societal levels. Univers. Access Inf. Soc. 13(4): 449-469 (2014) - 2013
- [j83]Outi Sievi-Korte
Simulated Annealing for Aiding Genetic Algorithm in Software Architecture Synthesis. Acta Cybern. 21(2): 235-265 (2013) - [j82]Liliana Cojocaru, Erkki Mäkinen
The Complexity of Szilard Languages of Matrix Grammars Revisited. Fundam. Informaticae 123(4): 381-399 (2013) - [c18]Liliana Cojocaru, Erkki Mäkinen
Searching for Traces of Communication in Szilard Languages of Parallel Communicating Grammar Systems - Complexity Views. DCFS 2013: 42-53 - 2011
- [c17]Outi Räihä
Multi-objective genetic synthesis of software architecture. GECCO (Companion) 2011: 249-250 - [c16]Liliana Cojocaru, Erkki Mäkinen
On the Complexity of Szilard Languages of Regulated Grammars. ICTAC 2011: 77-94 - [c15]Outi Räihä
Generating software architecture spectrum with multi-objective genetic algorithms. NaBIC 2011: 29-36 - [c14]Liliana Cojocaru, Erkki Mäkinen
On the Complexity of Szilard Languages of Matrix Grammars. SYNASC 2011: 339-347 - [p1]Outi Räihä
Synthesizing Architecture from Requirements: A Genetic Approach. Relating Software Requirements and Architectures 2011: 307-331 - 2010
- [j81]Hongmei He
One- and two-page crossing numbers for some types of graphs. Int. J. Comput. Math. 87(8): 1667-1679 (2010) - [c13]Outi Räihä
Complementary crossover for genetic software architecture synthesis. ISDA 2010: 266-271
2000 – 2009
- 2009
- [j80]Hongmei He
A Neural Network Model to Minimize the Connected Dominating Set for Self-Configuration of Wireless Sensor Networks. IEEE Trans. Neural Networks 20(6): 973-982 (2009) - [c12]Margareta Ackerman
Three New Algorithms for Regular Language Enumeration. COCOON 2009: 178-191 - [c11]Outi Räihä
Using simulated annealing for producing software architectures. GECCO (Companion) 2009: 2131-2136 - [c10]Outi Räihä
Scenario-Based Genetic Synthesis of Software Architecture. ICSEA 2009: 437-445 - [c9]Outi Räihä
Empirical Study on the Effect of Crossover in Genetic Software Architecture Synthesis. NaBIC 2009: 619-625 - [c8]Liliana Cojocaru, Erkki Mäkinen
Classes of Szilard Languages in NC1. SYNASC 2009: 299-306 - 2008
- [j79]Outi Räihä, Kai Koskimies, Erkki Mäkinen, Tarja Systä:
Pattern-Based Genetic Model Refinements in MDA. Nord. J. Comput. 14(4): 338-355 (2008) - [c7]Outi Räihä
Genetic Synthesis of Software Architecture. SEAL 2008: 565-574 - 2007
- [j78]Hongmei He
Genetic algorithms for the 2-page book drawing problem of graphs. J. Heuristics 13(1): 77-93 (2007) - [j77]Hongmei He
Parallelisation of genetic algorithms for the 2-page crossing number problem. J. Parallel Distributed Comput. 67(2): 229-241 (2007) - 2006
- [j76]Isto Aho, Erkki Mäkinen
On a parallel machine scheduling problem with precedence constraints. J. Sched. 9(5): 493-495 (2006) - 2005
- [j75]Erkki Mäkinen, Harri Siirtola:
The Barycenter Heuristic and the Reorderable Matrix. Informatica (Slovenia) 29(3): 357-364 (2005) - [j74]Harri Siirtola
Constructing and reconstructing the reorderable matrix. Inf. Vis. 4(1): 32-48 (2005) - 2003
- [j73]Erkki Mäkinen, Tarja Systä:
Engineering Software by Grammatical Inference. Informatica (Slovenia) 27(4): 461-467 (2003) - [j72]Erkki Mäkinen:
Inferring Finite Transducers. J. Braz. Comput. Soc. 9(1): 5-8 (2003) - [c6]Timo Poranen, Erkki Mäkinen, Jyrki Nummenmaa:
How to Draw a Sequence Diagram. SPLST 2003: 91-102 - 2002
- [j71]Erkki Mäkinen
Minimally adequate teacher synthesizes statechart diagrams. Acta Informatica 38(4): 235-259 (2002) - [j70]Johannes Koskinen, Erkki Mäkinen, Tarja Systä:
Implementing a Component-Based Tool for Interactive Synthesis of UML Statechart Diagrams. Acta Cybern. 15(4): 547-565 (2002) - [j69]Jarmo Siltaneva, Erkki Mäkinen
A Comparison of Random Binary Tree Generators. Comput. J. 45(6): 653-660 (2002) - [j68]Ferucio Laurentiu Tiplea, Erkki Mäkinen, Dragos Trinca, Costel Enea:
Characterization Results for Time-Varying Codes. Fundam. Informaticae 53(2): 185-198 (2002) - [j67]Ferucio Laurentiu Tiplea, Erkki Mäkinen
SE-Systems, Timing Mechanisms, and Time-Varying Codes. Int. J. Comput. Math. 79(10): 1083-1091 (2002) - [j66]Tarja Systä, Kai Koskimies, Erkki Mäkinen
Automated compression of state machines using UML statechart diagram notation. Inf. Softw. Technol. 44(10): 565-578 (2002) - [j65]Ferucio Laurentiu Tiplea, Erkki Mäkinen:
On the Complexity of a Problem on Monadic String Rewriting Systems. J. Autom. Lang. Comb. 7(4): 599-609 (2002) - 2001
- [j64]Ferucio Laurentiu Tiplea, Erkki Mäkinen, Corina Apachite:
Synchronized extension systems. Acta Informatica 37(6): 449-465 (2001) - [j63]Erkki Mäkinen
Comment on 'A Framework for Modelling Trojans and Computer Virus Infection'. Comput. J. 44(4): 321-323 (2001) - [j62]Ferucio Laurentiu Tiplea, Erkki Mäkinen:
A Note on SE-Systems and Regular Canonical Systems. Fundam. Informaticae 46(3): 253-256 (2001) - [j61]Erkki Mäkinen:
On the longest upsequence problem for permutations. Int. J. Comput. Math. 77(1): 45-53 (2001) - [j60]Ferucio Laurentiu Tiplea, Erkki Mäkinen
A note on synchronized extension systems. Inf. Process. Lett. 79(1): 7-9 (2001) - [j59]Erkki Mäkinen
A genetic algorithm for determining the thickness of a graph. Inf. Sci. 138(1-4): 155-164 (2001) - [j58]Erkki Mäkinen:
On the Inclusion Problem for Very Simple Deterministic Pushdown Automata. J. Autom. Lang. Comb. 6(3): 351-357 (2001) - [c5]Ferucio Laurentiu Tiplea, Erkki Mäkinen:
On the Complexity of a Problem on Monadic String Rewriting Systems. DCFS 2001: 187-194 - [c4]Erkki Mäkinen, Tarja Systä:
MAS - An Interactive Synthesizer to Support Behavioral Modeling in UML. ICSE 2001: 15-24 - 2000
- [j57]Takeshi Koshiba, Erkki Mäkinen, Yuji Takada:
Inferring pure context-free languages from positive data. Acta Cybern. 14(3): 469-477 (2000) - [j56]Erkki Mäkinen:
On inferring zero-reversible languages. Acta Cybern. 14(3): 479-484 (2000) - [j55]Erkki Mäkinen:
A Conjecture on the Error Bound of the Barycenter Heuristic. Bull. EATCS 70: 156-158 (2000) - [j54]Erkki Mäkinen:
Constructing a binary tree efficiently from its traversals. Int. J. Comput. Math. 75(2): 143-147 (2000) - [j53]Erkki Mäkinen
On inferring linear single-tree languages. Inf. Process. Lett. 73(1-2): 1-3 (2000) - [j52]Erkki Mäkinen, Markku Siermala:
Restricted universe data structures. ACM SIGCSE Bull. 32(2): 22-24 (2000) - [j51]Jarmo Siltaneva, Erkki Mäkinen:
A note on the expected distribution of degrees in random binary trees. ACM SIGCSE Bull. 32(4): 32-33 (2000) - [c3]Erkki Mäkinen, Harri Siirtola:
Reordering the Reorderable Matrix as an Algorithmic Problem. Diagrams 2000: 453-467
1990 – 1999
- 1999
- [j50]Erkki Mäkinen:
Inferring regular languages by merging nonterminals. Int. J. Comput. Math. 70(4): 601-616 (1999) - [j49]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): 55-75 (1999) - [j48]Erkki Mäkinen:
Generating Random Binary Trees - A Survey. Inf. Sci. 115(1-4): 123-136 (1999) - 1998
- [j47]Erkki Mäkinen:
Binary Tree Code Words as Context-Free Languages. Comput. J. 41(6): 422-424 (1998) - [j46]Erkki Mäkinen:
Ranking and unranking left szilard languages. Int. J. Comput. Math. 68(1-2): 29-38 (1998) - [j45]Isto Aho, Erkki Mäkinen, Tarja Systä:
Remarks on the Thickness of a Graph. Inf. Sci. 108(1-4): 1-4 (1998) - 1997
- [j44]Erkki Mäkinen:
On Lexicographic Enumeration of Regular and Context-Free Languages. Acta Cybern. 13(1): 55-61 (1997) - [j43]Erkki Mäkinen, Ferucio Laurentiu Tiplea:
Pattern Ambiguities for Pure Context-Free Grammars. Fundam. Informaticae 30(2): 183-191 (1997) - [j42]Ferucio Laurentiu Tiplea, Erkki Mäkinen:
Jumping Petri Nets. Specific Properties. Fundam. Informaticae 32(3-4): 373-392 (1997) - [j41]Erkki Mäkinen:
Inferring Uniquely Terminating Regular Languages from Positive Data. Inf. Process. Lett. 62(2): 57-60 (1997) - [j40]Takeshi Koshiba
Learning Deterministic even Linear Languages From Positive Examples. Theor. Comput. Sci. 185(1): 63-79 (1997) - [c2]Ferucio Laurentiu Tiplea, Erkki Mäkinen:
Jumping Petri Nets - Specific Properties. Developments in Language Theory 1997: 461-476 - 1996
- [j39]Erkki Mäkinen:
A Note on the Grammatical Inference Problem for Even Linear Languages. Fundam. Informaticae 25(2): 175-181 (1996) - [j38]Erkki Mäkinen:
(0,1)-Totality is Undecidable for Arbitrary Context-Free Grammars. Fundam. Informaticae 27(4): 413-415 (1996) - [j37]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): 175-179 (1996) - [j36]Erkki Mäkinen:
Programming projects on chess. ACM SIGCSE Bull. 28(4): 41-44 (1996) - 1995
- [j35]Juha Lehikoinen, Erkki Mäkinen:
A New Distance-based Coding Method For Binary Trees. Bull. EATCS 55 (1995) - [j34]Harri Klemetti, Ismo Lapinleimu, Erkki Mäkinen, Mika Sieranta:
A programming project: trimming the spring algorithm for drawing hypergraphs. ACM SIGCSE Bull. 27(3): 34-38 (1995) - [c1]Takeshi Koshiba, Erkki Mäkinen, Yuji Takada:
Learning Strongly Deterministic Even Linear Languages from Positive Examples. ALT 1995: 41-54 - 1994
- [j33]Kai Koskimies, Erkki Mäkinen:
Automatic Synthesis of State Machines from Trace Diagrams. Softw. Pract. Exp. 24(7): 643-658 (1994) - 1992
- [j32]Erkki Mäkinen:
A note on Graftings, Rotations, and Distances in Binary Trees. Bull. EATCS 46: 146-148 (1992) - [j31]Erkki Mäkinen:
On the generative capacity of context-free matrix grammars over one-letter alphabet. Fundam. Informaticae 16(1): 93-97 (1992) - [j30]Erkki Mäkinen:
On Grammatical inference and derivational complexity of context grammars. Fundam. Informaticae 17(4): 363-368 (1992) - [j29]Erkki Mäkinen
On drawing regular bipartite graphs. Int. J. Comput. Math. 43(1-2): 39-43 (1992) - [j28]Erkki Mäkinen
On the Structural Grammatical Inference Problem for Some Classes of Context-Free Grammars. Inf. Process. Lett. 42(1): 1-5 (1992) - [j27]Erkki Mäkinen
Remarks on the Structural Grammatical Inference Problem for Context-Free Grammars. Inf. Process. Lett. 44(3): 125-127 (1992) - 1991
- [j26]Erkki Mäkinen:
A Survey on Binary Tree Codings. Comput. J. 34(5): 438-443 (1991) - [j25]Erkki Mäkinen:
A hierarchy of context-free derivations. Fundam. Informaticae 14(2): 255-259 (1991) - [j24]Erkki Mäkinen:
On pure context-free language and left szilard languages. Fundam. Informaticae 15(1): 86-89 (1991) - 1990
- [j23]Jyrki Katajainen, Erkki Mäkinen:
A note on the complexity of trie compaction. Bull. EATCS 41: 212-216 (1990) - [j22]Erkki Mäkinen:
On Breadth-first Context-free Grammars. J. Inf. Process. Cybern. 26(3): 129-135 (1990) - [j21]Erkki Mäkinen:
How to draw a hypergraph. Int. J. Comput. Math. 34(3-4): 177-185 (1990) - [j20]Erkki Mäkinen
Experiments on drawing 2-level hierarchical graphs. Int. J. Comput. Math. 36(3-4): 175-181 (1990) - [j19]Erkki Mäkinen
Experiments on drawing 2-level hierarchical graphs. Int. J. Comput. Math. 37(3-4): 129-135 (1990) - [j18]Jyrki Katajainen, Erkki Mäkinen:
Tree Compression and Optimization with Applications. Int. J. Found. Comput. Sci. 1(4): 425-448 (1990) - [j17]Erkki Mäkinen
The Grammatical Inference Problem for the Szilard Languages of Linear Grammars. Inf. Process. Lett. 36(4): 203-206 (1990)
1980 – 1989
- 1989
- [j16]Erkki Mäkinen:
On Implementing Two Adaptive Data-Compression Schemes. Comput. J. 32(3): 238-240 (1989) - [j15]Erkki Mäkinen
On the Subtree Isomorphism Problem for Ordered Trees. Inf. Process. Lett. 32(5): 271-273 (1989) - 1988
- [j14]Erkki Mäkinen
On the Rotation Distance of Binary Trees. Inf. Process. Lett. 26(5): 271-272 (1988) - [j13]Erkki Mäkinen
On Linear Search Heuristics. Inf. Process. Lett. 29(1): 35-36 (1988) - 1987
- [j12]Erkki Mäkinen
Left Distance Binary Tree Representations. BIT 27(2): 163-169 (1987) - [j11]Erkki Mäkinen
On Top-Down Splaying. BIT 27(3): 330-339 (1987) - [j10]Erkki Mäkinen:
Normal forms for pure context-free grammars. Bull. EATCS 31: 35-37 (1987) - 1986
- [j9]Erkki Mäkinen:
On Szilard Languages of Pure Context-free Grammars. J. Inf. Process. Cybern. 22(10/11): 527-532 (1986) - [j8]Erkki Mäkinen
A Note on Pure Grammars. Inf. Process. Lett. 23(5): 271-274 (1986) - 1985
- [j7]Erkki Mäkinen
On Permutative Grammars Generating Context-Free Languages. BIT 25(4): 604-610 (1985) - [j6]Erkki Mäkinen
A Note on Undercover Relation. Inf. Process. Lett. 20(1): 19-21 (1985) - [j5]Erkki Mäkinen
An Undecidable Problem for Context-Free Grammars. Inf. Process. Lett. 20(3): 141-142 (1985) - 1984
- [j4]Erkki Mäkinen
On Context-Free and Szilard Languages. BIT 24(2): 164-170 (1984) - [j3]Erkki Mäkinen
On Derivation Preservation. Inf. Process. Lett. 19(5): 225-228 (1984) - 1983
- [j2]Erkki Mäkinen:
On Certain Properties of Left Szilard Languages. J. Inf. Process. Cybern. 19(10/11): 497-501 (1983) - [j1]Erkki Mäkinen
Boundedness Testing for Unambiguous Context-Free Grammars. Inf. Process. Lett. 17(4): 181-183 (1983)
Coauthor Index
Outi Sievi-Korte
aka: Outi Räihä
aka: Outi Räihä
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-26 17:42 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: