AAAAAA
Results:
1-12
|
Results: 12
Authors:
Makinen, E
Citation: E. Makinen, On the longest upsequence problem for permutations, INT J COM M, 77(1), 2001, pp. 45-53
Authors:
Makinen, E
Poranen, T
Vuorenmaa, P
Citation: E. Makinen et al., A genetic algorithm for determining the thickness of a graph, INF SCI, 138(1-4), 2001, pp. 155-164
Authors:
Tiplea, FL
Makinen, E
Citation: Fl. Tiplea et E. Makinen, A note on synchronized extension systems, INF PROCESS, 79(1), 2001, pp. 7-9
Authors:
Makinen, E
Citation: E. Makinen, Comment on 'A framework for modelling trojans and computer virus infection', COMPUTER J, 44(4), 2001, pp. 321-323
Authors:
Tiplea, FL
Makinen, E
Apachite, C
Citation: Fl. Tiplea et al., Synchronized extension systems, ACT INFORM, 37(6), 2001, pp. 449-465
Authors:
Nousiainen, P
Vehvilainen, M
Struszczyk, H
Makinen, E
Citation: P. Nousiainen et al., Functional hybrid fibers of cellulose/microcrystalline chitosan. I. Manufacture of viscose/microcrystalline chitosan fibers, J APPL POLY, 76(12), 2000, pp. 1725-1730
Authors:
Makinen, E
Citation: E. Makinen, Constructing a binary tree efficiently from its traversals, INT J COM M, 75(2), 2000, pp. 143-147
Authors:
Makinen, E
Citation: E. Makinen, On inferring linear single-tree languages, INF PROCESS, 73(1-2), 2000, pp. 1-3
Authors:
Aho, I
Kemppainen, H
Koskimies, K
Makinen, E
Niemi, T
Citation: I. Aho et al., Searching neural network structures with L systems and genetic algorithms, INT J COM M, 73(1), 1999, pp. 55-75
Authors:
Makinen, E
Citation: E. Makinen, Inferring regular languages by merging nonterminals, INT J COM M, 70(4), 1999, pp. 601-616
Authors:
Makinen, E
Citation: E. Makinen, Generating random binary trees - A survey, INF SCI, 115(1-4), 1999, pp. 123-136
Authors:
Makinen, E
Citation: E. Makinen, Binary tree code words as context-free languages, COMPUTER J, 41(6), 1998, pp. 422-424
Risultati:
1-12
|