On Derivation Languages of a Class of Splicing Systems.

Erkki Mäkinen

Kalpana Mahalingam Prithwineel Paul Erkki Mäkinen On Derivation Languages of a Class of Splicing Systems. 981-993 2018 23 Acta Cybern. 4 https://doi.org/10.14232/actacyb.23.4.2018.1 https://www.wikidata.org/entity/Q62046572 db/journals/actaC/actaC23.html#MahalingamPM18

Tuomo Hyttinen Erkki Mäkinen Timo Poranen Terrain synthesis using noise by examples. 17-25 2017 MindTrek https://doi.org/10.1145/3131085.3131099 conf/mindtrek/2017 db/conf/mindtrek/mindtrek2017.html#HyttinenMP17

Erkki Mäkinen A Note on the Emptiness of Intersection Problem for Left Szilard Languages. 613-616 2016 22 Acta Cybern. 3 https://doi.org/10.14232/actacyb.22.3.2016.4 db/journals/actaC/actaC22.html#Makinen16

Sari Walldén Erkki Mäkinen Roope Raisamo A review on objective measurement of usage in technology acceptance studies. 713-726 2016 15 Univers. Access Inf. Soc. 4 https://doi.org/10.1007/s10209-015-0443-y db/journals/uais/uais15.html#WalldenMR16

Hongmei He Ana Salagean Erkki Mäkinen Imrich Vrt'o Various heuristic algorithms to minimise the two-page crossingnumbers of graphs. 2015 5 Open Comput. Sci. 1 https://doi.org/10.1515/comp-2015-0004 db/journals/cejcs/cejcs5.html#HeSMV15

Outi Sievi-Korte Kai Koskimies Erkki Mäkinen Techniques for Genetic Software Architecture Design. 3141-3170 2015 58 Comput. J. 11 https://doi.org/10.1093/comjnl/bxv049 db/journals/cj/cj58.html#Sievi-KorteKM15

Hongmei He Zhenhuan Zhu Erkki Mäkinen Task-oriented distributed data fusion in autonomous wireless sensor networks. 2305-2319 2015 19 Soft Comput. 8 https://doi.org/10.1007/s00500-014-1421-7 db/journals/soco/soco19.html#HeZM15

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. SPLST CEUR-WS.org CEUR Workshop Proceedings 1525 2015 https://ceur-ws.org/Vol-1525 https://nbn-resolving.org/urn:nbn:de:0074-1525-1 db/conf/splst/splst2015.html

Sari Walldén Erkki Mäkinen Educational Data Mining and Problem-Based Learning. 141-156 2014 13 Informatics Educ. 1 https://doi.org/10.15388/infedu.2014.08 db/journals/iie/iie13.html#WalldenM14

Liliana Cojocaru Erkki Mäkinen On some derivation mechanisms and the complexity of their Szilard languages. 87-96 2014 537 Theor. Comput. Sci. https://doi.org/10.1016/j.tcs.2014.02.048 db/journals/tcs/tcs537.html#CojocaruM14

Sari Walldén Erkki Mäkinen On accepting smart environments at user and societal levels. 449-469 2014 13 Univers. Access Inf. Soc. 4 https://doi.org/10.1007/s10209-013-0327-y db/journals/uais/uais13.html#WalldenM14

Outi Sievi-Korte Erkki Mäkinen Timo Poranen Simulated Annealing for Aiding Genetic Algorithm in Software Architecture Synthesis. 235-265 2013 21 Acta Cybern. 2 https://doi.org/10.14232/actacyb.21.2.2013.3 db/journals/actaC/actaC21.html#Sievi-KorteMP13

Liliana Cojocaru Erkki Mäkinen The Complexity of Szilard Languages of Matrix Grammars Revisited. 381-399 2013 123 Fundam. Informaticae 4 https://doi.org/10.3233/FI-2013-817 db/journals/fuin/fuin123.html#CojocaruM13

Liliana Cojocaru Erkki Mäkinen Searching for Traces of Communication in Szilard Languages of Parallel Communicating Grammar Systems - Complexity Views. 42-53 2013 DCFS https://doi.org/10.1007/978-3-642-39310-5_6 conf/dcfs/2013 db/conf/dcfs/dcfs2013.html#CojocaruM13 Outi Räihä Kai Koskimies Erkki Mäkinen Multi-objective genetic synthesis of software architecture. 249-250 2011 GECCO (Companion) https://doi.org/10.1145/2001858.2001998 conf/gecco/2011c db/conf/gecco/gecco2011c.html#RaihaKM11 Liliana Cojocaru Erkki Mäkinen On the Complexity of Szilard Languages of Regulated Grammars. 77-94 2011 ICTAC https://doi.org/10.1007/978-3-642-23283-1_8 conf/ictac/2011 db/conf/ictac/ictac2011.html#CojocaruM11 Outi Räihä Kai Koskimies Erkki Mäkinen Generating software architecture spectrum with multi-objective genetic algorithms. 29-36 2011 NaBIC https://doi.org/10.1109/NaBIC.2011.6089413 https://orkg.org/orkg/resource/R28801 conf/nabic/2011 db/conf/nabic/nabic2011.html#RaihaKM11 Liliana Cojocaru Erkki Mäkinen On the Complexity of Szilard Languages of Matrix Grammars. 339-347 2011 SYNASC https://doi.org/10.1109/SYNASC.2011.34 https://doi.ieeecomputersociety.org/10.1109/SYNASC.2011.34 conf/synasc/2011 db/conf/synasc/synasc2011.html#CojocaruM11 Outi Räihä Hadaytullah Kundi Kai Koskimies Erkki Mäkinen Synthesizing Architecture from Requirements: A Genetic Approach. 307-331 2011 Relating Software Requirements and Architectures https://doi.org/10.1007/978-3-642-21001-3_18 books/daglib/0027654 db/books/daglib/0027654.html#RaihaKKM11

Hongmei He Ana Salagean Erkki Mäkinen One- and two-page crossing numbers for some types of graphs. 1667-1679 2010 87 Int. J. Comput. Math. 8 https://doi.org/10.1080/00207160802524747 db/journals/ijcm/ijcm87.html#HeSM10

Outi Räihä Kai Koskimies Erkki Mäkinen Complementary crossover for genetic software architecture synthesis. 266-271 2010 ISDA https://doi.org/10.1109/ISDA.2010.5687255 conf/isda/2010 db/conf/isda/isda2010.html#RaihaKM10

Hongmei He Zhenhuan Zhu Erkki Mäkinen A Neural Network Model to Minimize the Connected Dominating Set for Self-Configuration of Wireless Sensor Networks. 973-982 2009 20 IEEE Trans. Neural Networks 6 https://doi.org/10.1109/TNN.2009.2015088 https://www.wikidata.org/entity/Q51836015 db/journals/tnn/tnn20.html#HeZM09

Margareta Ackerman Erkki Mäkinen Three New Algorithms for Regular Language Enumeration. 178-191 2009 COCOON https://doi.org/10.1007/978-3-642-02882-3_19 conf/cocoon/2009 db/conf/cocoon/cocoon2009.html#AckermanM09 Outi Räihä Erkki Mäkinen Timo Poranen Using simulated annealing for producing software architectures. 2131-2136 2009 GECCO (Companion) https://doi.org/10.1145/1570256.1570289 conf/gecco/2009c db/conf/gecco/gecco2009c.html#RaihaMP09 Outi Räihä Kai Koskimies Erkki Mäkinen Scenario-Based Genetic Synthesis of Software Architecture. 437-445 2009 ICSEA https://doi.org/10.1109/ICSEA.2009.70 https://doi.ieeecomputersociety.org/10.1109/ICSEA.2009.70 conf/icsea/2009 db/conf/icsea/icsea2009.html#RaihaKM09 Outi Räihä Kai Koskimies Erkki Mäkinen Empirical Study on the Effect of Crossover in Genetic Software Architecture Synthesis. 619-625 2009 NaBIC https://doi.org/10.1109/NABIC.2009.5393431 conf/nabic/2009 db/conf/nabic/nabic2009.html#RaihaKM09 Liliana Cojocaru Erkki Mäkinen Ferucio Laurentiu Tiplea Classes of Szilard Languages in NC<sup>1</sup>. 299-306 2009 SYNASC https://doi.org/10.1109/SYNASC.2009.58 https://doi.ieeecomputersociety.org/10.1109/SYNASC.2009.58 conf/synasc/2009 db/conf/synasc/synasc2009.html#CojocaruMT09

Outi Räihä Kai Koskimies Erkki Mäkinen Tarja Systä Pattern-Based Genetic Model Refinements in MDA. 338-355 2008 14 Nord. J. Comput. 4 db/journals/njc/njc14.html#RaihaKMS08

Outi Räihä Kai Koskimies Erkki Mäkinen Genetic Synthesis of Software Architecture. 565-574 2008 SEAL https://doi.org/10.1007/978-3-540-89694-4_57 conf/seal/2008 db/conf/seal/seal2008.html#RaihaKM08

Hongmei He Ondrej Sýkora Erkki Mäkinen Genetic algorithms for the 2-page book drawing problem of graphs. 77-93 2007 13 J. Heuristics 1 https://doi.org/10.1007/s10732-006-9000-4 db/journals/heuristics/heuristics13.html#HeSM07

Hongmei He Ondrej Sýkora Ana Salagean Erkki Mäkinen Parallelisation of genetic algorithms for the 2-page crossing number problem. 229-241 2007 67 J. Parallel Distributed Comput. 2 https://doi.org/10.1016/j.jpdc.2006.08.002 db/journals/jpdc/jpdc67.html#HeSSM07

Isto Aho Erkki Mäkinen On a parallel machine scheduling problem with precedence constraints. 493-495 2006 9 J. Sched. 5 https://doi.org/10.1007/s10951-006-8499-4 db/journals/scheduling/scheduling9.html#AhoM06

Erkki Mäkinen Harri Siirtola The Barycenter Heuristic and the Reorderable Matrix. 357-364 2005 29 Informatica (Slovenia) 3 http://www.informatica.si/index.php/informatica/article/view/51 db/journals/informaticaSI/informaticaSI29.html#MakinenS05

Harri Siirtola Erkki Mäkinen Constructing and reconstructing the reorderable matrix. 32-48 2005 4 Inf. Vis. 1 https://doi.org/10.1057/palgrave.ivs.9500086 db/journals/ivs/ivs4.html#SiirtolaM05

Erkki Mäkinen Tarja Systä Engineering Software by Grammatical Inference. 461-467 2003 27 Informatica (Slovenia) 4 db/journals/informaticaSI/informaticaSI27.html#MakinenS03

Erkki Mäkinen Inferring Finite Transducers. 5-8 2003 9 J. Braz. Comput. Soc. 1 https://doi.org/10.1590/S0104-65002003000200001 db/journals/jbcs/jbcs9.html#Makinen03

Timo Poranen Erkki Mäkinen Jyrki Nummenmaa How to Draw a Sequence Diagram. 91-102 2003 conf/splst/2003 SPLST db/conf/splst/splst2003.html#PoranenMN03

Erkki Mäkinen Tarja Systä Minimally adequate teacher synthesizes statechart diagrams. 235-259 2002 38 Acta Informatica 4 https://doi.org/10.1007/s236-002-8033-8 db/journals/acta/acta38.html#MakinenS02

Johannes Koskinen Erkki Mäkinen Tarja Systä Implementing a Component-Based Tool for Interactive Synthesis of UML Statechart Diagrams. 547-565 2002 15 Acta Cybern. 4 https://cyber.bibl.u-szeged.hu/index.php/actcybern/article/view/3596 db/journals/actaC/actaC15.html#KoskinenMS02

Jarmo Siltaneva Erkki Mäkinen A Comparison of Random Binary Tree Generators. 653-660 2002 45 Comput. J. 6 https://doi.org/10.1093/comjnl/45.6.653 db/journals/cj/cj45.html#SiltanevaM02

Ferucio Laurentiu Tiplea Erkki Mäkinen Dragos Trinca Costel Enea Characterization Results for Time-Varying Codes. 185-198 2002 53 Fundam. Informaticae 2 http://content.iospress.com/articles/fundamenta-informaticae/fi53-2-05 db/journals/fuin/fuin53.html#TipleaMTE02

Ferucio Laurentiu Tiplea Erkki Mäkinen Constantin Enea SE-Systems, Timing Mechanisms, and Time-Varying Codes. 1083-1091 2002 79 Int. J. Comput. Math. 10 https://doi.org/10.1080/00207160212709 db/journals/ijcm/ijcm79.html#TipleaME02

Tarja Systä Kai Koskimies Erkki Mäkinen Automated compression of state machines using UML statechart diagram notation. 565-578 2002 44 Inf. Softw. Technol. 10 db/journals/infsof/infsof44.html#SystaKM02 https://doi.org/10.1016/S0950-5849(02)00077-0

Ferucio Laurentiu Tiplea Erkki Mäkinen On the Complexity of a Problem on Monadic String Rewriting Systems. 599-609 2002 7 J. Autom. Lang. Comb. 4 db/journals/jalc/jalc7.html#TipleaM02 https://doi.org/10.25596/jalc-2002-599

Ferucio Laurentiu Tiplea Erkki Mäkinen Corina Apachite Synchronized extension systems. 449-465 2001 37 Acta Informatica 6 https://doi.org/10.1007/PL00013310 db/journals/acta/acta37.html#TipleaMA01

Erkki Mäkinen Comment on 'A Framework for Modelling Trojans and Computer Virus Infection'. 321-323 2001 44 Comput. J. 4 https://doi.org/10.1093/comjnl/44.4.321 db/journals/cj/cj44.html#Makinen01

Ferucio Laurentiu Tiplea Erkki Mäkinen A Note on SE-Systems and Regular Canonical Systems. 253-256 2001 46 Fundam. Informaticae 3 db/journals/fuin/fuin46.html#TipleaM01 http://content.iospress.com/articles/fundamenta-informaticae/fi46-3-04

Erkki Mäkinen On the longest upsequence problem for permutations. 45-53 2001 77 Int. J. Comput. Math. 1 https://doi.org/10.1080/00207160108805049 db/journals/ijcm/ijcm77.html#Makinen01

Ferucio Laurentiu Tiplea Erkki Mäkinen A note on synchronized extension systems. 7-9 2001 79 Inf. Process. Lett. 1 db/journals/ipl/ipl79.html#TipleaM01 https://doi.org/10.1016/S0020-0190(00)00167-8 https://www.wikidata.org/entity/Q128089458

Erkki Mäkinen Timo Poranen Petri Vuorenmaa A genetic algorithm for determining the thickness of a graph. 155-164 2001 138 Inf. Sci. 1-4 db/journals/isci/isci138.html#MakinenPV01 https://doi.org/10.1016/S0020-0255(01)00126-8 https://www.wikidata.org/entity/Q126422528

Erkki Mäkinen On the Inclusion Problem for Very Simple Deterministic Pushdown Automata. 351-357 2001 6 J. Autom. Lang. Comb. 3 db/journals/jalc/jalc6.html#Makinen01 https://doi.org/10.25596/jalc-2001-351

Ferucio Laurentiu Tiplea Erkki Mäkinen On the Complexity of a Problem on Monadic String Rewriting Systems. 187-194 2001 DCFS conf/dcfs/2001 db/conf/dcfs/dcfs2001.html#TipleaM01 Erkki Mäkinen Tarja Systä MAS - An Interactive Synthesizer to Support Behavioral Modeling in UML. 15-24 2001 conf/icse/2001 ICSE db/conf/icse/icse2001.html#MakinenS01 https://doi.org/10.1109/ICSE.2001.919077 https://doi.ieeecomputersociety.org/10.1109/ICSE.2001.919077

Takeshi Koshiba Erkki Mäkinen Yuji Takada Inferring pure context-free languages from positive data. 469-477 2000 14 Acta Cybern. 3 https://cyber.bibl.u-szeged.hu/index.php/actcybern/article/view/3540 db/journals/actaC/actaC14.html#KoshibaMT00

Erkki Mäkinen On inferring zero-reversible languages. 479-484 2000 14 Acta Cybern. 3 https://cyber.bibl.u-szeged.hu/index.php/actcybern/article/view/3541 db/journals/actaC/actaC14.html#Makinen00

Erkki Mäkinen A Conjecture on the Error Bound of the Barycenter Heuristic. 156-158 2000 70 Bull. EATCS db/journals/eatcs/eatcs70.html#Makinen00

Erkki Mäkinen Constructing a binary tree efficiently from its traversals. 143-147 2000 75 Int. J. Comput. Math. 2 https://doi.org/10.1080/00207160008804973 db/journals/ijcm/ijcm75.html#Makinen00

Erkki Mäkinen On inferring linear single-tree languages. 1-3 2000 73 Inf. Process. Lett. 1-2 db/journals/ipl/ipl73.html#Makinen00 https://doi.org/10.1016/S0020-0190(99)00157-X

Erkki Mäkinen Markku Siermala Restricted universe data structures. 22-24 2000 32 ACM SIGCSE Bull. 2 https://doi.org/10.1145/355354.355365 db/journals/sigcse/sigcse32.html#MakinenS00

Jarmo Siltaneva Erkki Mäkinen A note on the expected distribution of degrees in random binary trees. 32-33 2000 32 ACM SIGCSE Bull. 4 https://doi.org/10.1145/369295.369317 db/journals/sigcse/sigcse32.html#SiltanevaM00

Erkki Mäkinen Harri Siirtola Reordering the Reorderable Matrix as an Algorithmic Problem. 453-467 https://doi.org/10.1007/3-540-44590-0_37 2000 conf/diagrams/2000 Diagrams db/conf/diagrams/diagrams2000.html#MakinenS00

Erkki Mäkinen Inferring regular languages by merging nonterminals. 601-616 1999 70 Int. J. Comput. Math. 4 https://doi.org/10.1080/00207169908804778 db/journals/ijcm/ijcm70.html#Makinen99

Isto Aho Harri Kemppainen Kai Koskimies Erkki Mäkinen Tapio Niemi Searching neural network structures with L systems and genetic algorithms. 55-75 1999 73 Int. J. Comput. Math. 1 https://doi.org/10.1080/00207169908804880 db/journals/ijcm/ijcm73.html#AhoKKMN99

Erkki Mäkinen Generating Random Binary Trees - A Survey. 123-136 1999 115 Inf. Sci. 1-4 db/journals/isci/isci115.html#Makinen99 https://doi.org/10.1016/S0020-0255(98)10080-4

Erkki Mäkinen Binary Tree Code Words as Context-Free Languages. 422-424 1998 41 Comput. J. 6 db/journals/cj/cj41.html#Makinen98 https://doi.org/10.1093/comjnl/41.6.422

Erkki Mäkinen Ranking and unranking left szilard languages. 29-38 1998 68 Int. J. Comput. Math. 1-2 https://doi.org/10.1080/00207169808804677 db/journals/ijcm/ijcm68.html#Makinen98

Isto Aho Erkki Mäkinen Tarja Systä Remarks on the Thickness of a Graph. 1-4 1998 108 Inf. Sci. 1-4 db/journals/isci/isci108.html#AhoMS98 https://doi.org/10.1016/S0020-0255(97)10059-7

Erkki Mäkinen On Lexicographic Enumeration of Regular and Context-Free Languages. 55-61 1997 13 Acta Cybern. 1 https://cyber.bibl.u-szeged.hu/index.php/actcybern/article/view/3479 db/journals/actaC/actaC13.html#Makinen97

Erkki Mäkinen Ferucio Laurentiu Tiplea Pattern Ambiguities for Pure Context-Free Grammars. 183-191 1997 30 Fundam. Informaticae 2 db/journals/fuin/fuin30.html#MakinenT97 https://doi.org/10.3233/FI-1997-30205

Ferucio Laurentiu Tiplea Erkki Mäkinen Jumping Petri Nets. Specific Properties. 373-392 1997 32 Fundam. Informaticae 3-4 db/journals/fuin/fuin32.html#TipleaM97 https://doi.org/10.3233/FI-1997-323411

Erkki Mäkinen Inferring Uniquely Terminating Regular Languages from Positive Data. 57-60 1997 62 Inf. Process. Lett. 2 db/journals/ipl/ipl62.html#Makinen97 https://doi.org/10.1016/S0020-0190(97)00045-8

Takeshi Koshiba Erkki Mäkinen Yuji Takada Learning Deterministic even Linear Languages From Positive Examples. 63-79 1997 185 Theor. Comput. Sci. 1 db/journals/tcs/tcs185.html#KoshibaMT97 https://doi.org/10.1016/S0304-3975(97)00016-9

Ferucio Laurentiu Tiplea Erkki Mäkinen Jumping Petri Nets - Specific Properties. 461-476 1997 Developments in Language Theory conf/dlt/1997 db/conf/dlt/dlt1997.html#TipleaM97

Erkki Mäkinen A Note on the Grammatical Inference Problem for Even Linear Languages. 175-181 1996 25 Fundam. Informaticae 2 db/journals/fuin/fuin25.html#Makinen96 https://doi.org/10.3233/FI-1996-25203

Erkki Mäkinen (0,1)-Totality is Undecidable for Arbitrary Context-Free Grammars. 413-415 1996 27 Fundam. Informaticae 4 db/journals/fuin/fuin27.html#Makinen96a https://doi.org/10.3233/FI-1996-27404

Erkki Mäkinen A family of languages which is polynomial-time learnable from positive data in pitt's sense. 175-179 1996 61 Int. J. Comput. Math. 3-4 https://doi.org/10.1080/00207169608804510 db/journals/ijcm/ijcm61.html#Makinen96

Erkki Mäkinen Programming projects on chess. 41-44 1996 28 ACM SIGCSE Bull. 4 https://doi.org/10.1145/242649.242661 db/journals/sigcse/sigcse28.html#Makinen96

Juha Lehikoinen Erkki Mäkinen A New Distance-based Coding Method For Binary Trees. 1995 55 Bull. EATCS db/journals/eatcs/eatcs55.html#LehikoinenM95

Harri Klemetti Ismo Lapinleimu Erkki Mäkinen Mika Sieranta A programming project: trimming the spring algorithm for drawing hypergraphs. 34-38 1995 27 ACM SIGCSE Bull. 3 https://doi.org/10.1145/209849.209855 db/journals/sigcse/sigcse27.html#KlemettiLMS95

Takeshi Koshiba Erkki Mäkinen Yuji Takada Learning Strongly Deterministic Even Linear Languages from Positive Examples. 41-54 1995 conf/alt/1995 ALT db/conf/alt/alt1995.html#KoshibaMT95 https://doi.org/10.1007/3-540-60454-5_27

Kai Koskimies Erkki Mäkinen Automatic Synthesis of State Machines from Trace Diagrams. 643-658 1994 24 Softw. Pract. Exp. 7 db/journals/spe/spe24.html#KoskimiesM94 https://doi.org/10.1002/spe.4380240704

Erkki Mäkinen A note on Graftings, Rotations, and Distances in Binary Trees. 146-148 1992 46 Bull. EATCS db/journals/eatcs/eatcs46.html#Makinen92

Erkki Mäkinen On the generative capacity of context-free matrix grammars over one-letter alphabet. 93-97 1992 16 Fundam. Informaticae 1 db/journals/fuin/fuin16.html#Makinen92

Erkki Mäkinen On Grammatical inference and derivational complexity of context grammars. 363-368 1992 17 Fundam. Informaticae 4 db/journals/fuin/fuin17.html#Makinen92a

Erkki Mäkinen On drawing regular bipartite graphs. 39-43 1992 43 Int. J. Comput. Math. 1-2 https://doi.org/10.1080/00207169208804071 db/journals/ijcm/ijcm43.html#Makinen92

Erkki Mäkinen On the Structural Grammatical Inference Problem for Some Classes of Context-Free Grammars. 1-5 1992 42 Inf. Process. Lett. 1 db/journals/ipl/ipl42.html#Makinen92 https://doi.org/10.1016/0020-0190(92)90124-E

Erkki Mäkinen Remarks on the Structural Grammatical Inference Problem for Context-Free Grammars. 125-127 1992 44 Inf. Process. Lett. 3 db/journals/ipl/ipl44.html#Makinen92a https://doi.org/10.1016/0020-0190(92)90051-V

Erkki Mäkinen A Survey on Binary Tree Codings. 438-443 1991 34 Comput. J. 5 db/journals/cj/cj34.html#Makinen91 https://doi.org/10.1093/comjnl/34.5.438

Erkki Mäkinen A hierarchy of context-free derivations. 255-259 1991 14 Fundam. Informaticae 2 db/journals/fuin/fuin14.html#Makinen91

Erkki Mäkinen On pure context-free language and left szilard languages. 86-89 1991 15 Fundam. Informaticae 1 db/journals/fuin/fuin15.html#Makinen91a

Jyrki Katajainen Erkki Mäkinen A note on the complexity of trie compaction. 212-216 1990 41 Bull. EATCS db/journals/eatcs/eatcs41.html#KatajainenM90

Erkki Mäkinen On Breadth-first Context-free Grammars. 129-135 1990 26 J. Inf. Process. Cybern. 3 db/journals/eik/eik26.html#Makinen90

Erkki Mäkinen How to draw a hypergraph. 177-185 1990 34 Int. J. Comput. Math. 3-4 https://doi.org/10.1080/00207169008803875 https://www.wikidata.org/entity/Q56171388 db/journals/ijcm/ijcm34.html#Makinen90a

Erkki Mäkinen Experiments on drawing 2-level hierarchical graphs. 175-181 1990 36 Int. J. Comput. Math. 3-4 https://doi.org/10.1080/00207169008803921 db/journals/ijcm/ijcm36.html#Makinen90

Erkki Mäkinen Experiments on drawing 2-level hierarchical graphs. 129-135 1990 37 Int. J. Comput. Math. 3-4 https://doi.org/10.1080/00207169008803941 db/journals/ijcm/ijcm37.html#Makinen90b

Jyrki Katajainen Erkki Mäkinen Tree Compression and Optimization with Applications. 425-448 1990 1 Int. J. Found. Comput. Sci. 4 db/journals/ijfcs/ijfcs1.html#KatajainenM90 https://doi.org/10.1142/S0129054190000291

Erkki Mäkinen The Grammatical Inference Problem for the Szilard Languages of Linear Grammars. 203-206 1990 36 Inf. Process. Lett. 4 db/journals/ipl/ipl36.html#Makinen90 https://doi.org/10.1016/0020-0190(90)90074-8

Erkki Mäkinen On Implementing Two Adaptive Data-Compression Schemes. 238-240 1989 32 Comput. J. 3 db/journals/cj/cj32.html#Makinen89 https://doi.org/10.1093/comjnl/32.3.238

Erkki Mäkinen On the Subtree Isomorphism Problem for Ordered Trees. 271-273 1989 32 Inf. Process. Lett. 5 db/journals/ipl/ipl32.html#Makinen89 https://doi.org/10.1016/0020-0190(89)90056-2

Erkki Mäkinen On the Rotation Distance of Binary Trees. 271-272 1988 26 Inf. Process. Lett. 5 db/journals/ipl/ipl26.html#Makinen88 https://doi.org/10.1016/0020-0190(88)90153-6

Erkki Mäkinen On Linear Search Heuristics. 35-36 1988 29 Inf. Process. Lett. 1 db/journals/ipl/ipl29.html#Makinen88a https://doi.org/10.1016/0020-0190(88)90129-9

Erkki Mäkinen Left Distance Binary Tree Representations. 163-169 1987 27 BIT 2 db/journals/bit/bit27.html#Makinen87 https://doi.org/10.1007/BF01934181

Erkki Mäkinen On Top-Down Splaying. 330-339 1987 27 BIT 3 db/journals/bit/bit27.html#Makinen87a https://doi.org/10.1007/BF01933728

Erkki Mäkinen Normal forms for pure context-free grammars. 35-37 1987 31 Bull. EATCS db/journals/eatcs/eatcs31.html#Makinen87

Erkki Mäkinen On Szilard Languages of Pure Context-free Grammars. 527-532 1986 22 J. Inf. Process. Cybern. 10/11 db/journals/eik/eik22.html#Makinen86

Erkki Mäkinen A Note on Pure Grammars. 271-274 1986 23 Inf. Process. Lett. 5 db/journals/ipl/ipl23.html#Makinen86 https://doi.org/10.1016/0020-0190(86)90085-2

Erkki Mäkinen On Permutative Grammars Generating Context-Free Languages. 604-610 1985 25 BIT 4 db/journals/bit/bit25.html#Makinen85 https://doi.org/10.1007/BF01936139

Erkki Mäkinen A Note on Undercover Relation. 19-21 1985 20 Inf. Process. Lett. 1 db/journals/ipl/ipl20.html#Makinen85 https://doi.org/10.1016/0020-0190(85)90124-3

Erkki Mäkinen An Undecidable Problem for Context-Free Grammars. 141-142 1985 20 Inf. Process. Lett. 3 db/journals/ipl/ipl20.html#Makinen85a https://doi.org/10.1016/0020-0190(85)90081-X

Erkki Mäkinen On Context-Free and Szilard Languages. 164-170 1984 24 BIT 2 db/journals/bit/bit24.html#Makinen84 https://doi.org/10.1007/BF01937483

Erkki Mäkinen On Derivation Preservation. 225-228 1984 19 Inf. Process. Lett. 5 db/journals/ipl/ipl19.html#Makinen84 https://doi.org/10.1016/0020-0190(84)90057-7

Erkki Mäkinen On Certain Properties of Left Szilard Languages. 497-501 1983 19 J. Inf. Process. Cybern. 10/11 db/journals/eik/eik19.html#Makinen83

Erkki Mäkinen Boundedness Testing for Unambiguous Context-Free Grammars. 181-183 1983 17 Inf. Process. Lett. 4 db/journals/ipl/ipl17.html#Makinen83 https://doi.org/10.1016/0020-0190(83)90037-6

Margareta Ackerman Isto Aho Liliana Cojocaru Constantin Enea Costel Enea HadaytullahHadaytullah Kundi Hongmei He Tuomo Hyttinen Jyrki Katajainen Harri Kemppainen Harri Klemetti Takeshi Koshiba Kai Koskimies Johannes Koskinen Ismo Lapinleimu Juha Lehikoinen Kalpana Mahalingam Corina MitrohinCorina Apachite Tapio Niemi Jyrki Nummenmaa Prithwineel Paul Timo Poranen Roope Raisamo Ana Salagean Mika Sieranta Markku Siermala Outi Sievi-KorteOuti Räihä Harri Siirtola Jarmo Siltaneva Ondrej Sýkora Tarja Systä Yuji Takada Ferucio Laurentiu Tiplea Dragos Trinca Imrich VrtoImrich Vrt'o Petri Vuorenmaa Sari Walldén Zhenhuan Zhu