THE IMPORTANCE OF FULL SCALE TESTING IN ICE FOR DESIGNING ICEBREAKING SHIPS.MAKINEN E.1976; JB. SCHIFFBAUTECH. GESELLSCH.; DTSCH.; DA. 1976 PARU 1977; VOL. 70; PP. 7-16; BIBL. 14 REF.Article

On the subtree isomorphism problem for ordered treesMAKINEN, E.Information processing letters. 1989, Vol 32, Num 5, pp 271-273, issn 0020-0190Article

Two complexity measures for context-free languagesMAKINEN, E.International journal of computer mathematics. 1988, Vol 26, Num 1, pp 29-34, issn 0020-7160Article

On homomorphic images of Szilard languagesMAKINEN, E.International journal of computer mathematics. 1986, Vol 18, Num 3-4, pp 239-245, issn 0020-7160Article

ECTOPIC URETEROCELE. A RADIOLOGICAL APPRAISAL OF 66 CONSECUTIVE CASES = L'URETEROCELE ECTOPIQUE. EVALUATION RADIOLOGIQUE DE 66 CAS CONSECUTIFSEKLOEF O; MAKINEN E.1974; PEDIATR. RADIOL.; GERM.; DA. 1974; VOL. 2; NO 2; PP. 111-120; BIBL. 13REF.Article

On circular layoutsMAKINEN, E.International journal of computer mathematics. 1988, Vol 24, Num 1, pp 29-37, issn 0020-7160Article

INTESTINAL BLIND POUCH- AND BLIND LOOP-SYNDROME IN CHILDREN OPERATED PREVIOUSLY FOR CONGENITAL DUODENAL OBSTRUCTION = LE SYNDROME DE LA POCHE OU DE L'ANSE AVEUGLE CHEZ LES ENFANTS OPERES PREALABLEMENT POUR UNE OBSTRUCTION DUODENALE CONGENITALESALONEN IS; MAKINEN E.1976; ANN. CHIR. GYNAECOL.; FINL.; DA. 1976; VOL. 65; NO 1; PP. 38-45; BIBL. 1 P. 1/2Article

Splay trees as priority queuesMAKINEN, E.International journal of computer mathematics. 1989, Vol 31, Num 1-2, pp 55-62, issn 0020-7160Article

Left distance binary tree representationsMAKINEN, E.BIT (Nordisk Tidskrift for Informationsbehandling). 1987, Vol 27, Num 2, pp 163-169, issn 0006-3835Article

On context-free and Szilard languagesMAKINEN, E.BIT (Nordisk Tidskrift for Informationsbehandling). 1984, Vol 24, Num 2, pp 164-170, issn 0006-3835Article

Ranking and unranking left szilard languagesMAKINEN, E.International journal of computer mathematics. 1998, Vol 68, Num 1-2, pp 29-38, issn 0020-7160Article

Constructing a binary tree from its traversalsMAKINEN, E.BIT (Nordisk Tidskrift for Informationsbehandling). 1989, Vol 29, Num 3, pp 572-575, issn 0006-3835Article

On linear search heuristicsMAKINEN, E.Information processing letters. 1988, Vol 29, Num 1, pp 35-36, issn 0020-0190Article

A note on the inclusion problem for Szilard languagesMAKINEN, E.International journal of computer mathematics. 1987, Vol 21, Num 3-4, pp 291-295, issn 0020-7160Article

Left distance binary tree representationsMAKINEN, E.BIT (Nordisk Tidskrift for Informationsbehandling). 1987, Vol 27, Num 2, pp 163-169, issn 0006-3835Article

A note on depth-first derivationsMAKINEN, E.BIT (Nordisk Tidskrift for Informationsbehandling). 1985, Vol 25, Num 1, pp 293-296, issn 0006-3835Article

On derivation preservationMAKINEN, E.Information processing letters. 1984, Vol 19, Num 5, pp 225-228, issn 0020-0190Article

Constructing a binary tree efficiently from its traversalsMÄKINEN, E.International journal of computer mathematics. 2000, Vol 75, Num 2, pp 143-147, issn 0020-7160Article

A family of languages which is polynomial-time learnable from positive data in Pitt's senseMÄKINEN, E.International journal of computer mathematics. 1996, Vol 61, Num 3-4, pp 175-179, issn 0020-7160Article

On the relationship between diagram synthesis and grammatical inferenceMÄKINEN, E.International journal of computer mathematics. 1994, Vol 52, Num 3-4, pp 129-137, issn 0020-7160Article

Efficient generation of rotational-admissible codewords for binary treesMÄKINEN, E.Computer journal (Print). 1991, Vol 34, Num 4, issn 0010-4620, p. 379Article

A note on undercover relationMÄKINEN, E.Information processing letters. 1985, Vol 20, Num 1, pp 19-21, issn 0020-0190Article

On inferring linear single-tree languagesMÄKINEN, E.Information processing letters. 2000, Vol 73, Num 1-2, pp 1-3, issn 0020-0190Article

Inferring uniquely terminating regular languages from positive dataMÄKINEN, E.Information processing letters. 1997, Vol 62, Num 2, pp 57-60, issn 0020-0190Article

Page / 2