Pascal and Francis Bibliographic Databases

Help

Search results

Your search

au.\*:("UKKONEN E")

Document Type [dt]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Publication Year[py]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Discipline (document) [di]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Author Country

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Results 1 to 25 of 45

  • Page / 2

Export

Selection :

  • and

EXPONENTIAL LOWER BOUNDS FOR SOME NP-COMPLETE PROBLEMS IN A RESTRICTED LINEAR DECISION TREE MODELUKKONEN E.1983; BIT (NORDISK TIDSKRIFT FOR INFORMATIONSBEHANDLING); ISSN 0006-3835; SWE; DA. 1983; VOL. 23; NO 2; PP. 181-192; BIBL. 9 REF.Article

THE NONEXISTENCE OF SOME COVERING CONTEXT-FREE GRAMMARSUKKONEN E.1979; INFORM. PROCESSG LETTERS; NLD; DA. 1979; VOL. 8; NO 4; PP. 187-192; BIBL. 6 REF.Article

A MODIFICATION OF THE LR (K) METHOD FOR CONSTRUCTING COMPACT BOTTOM-UP PARSERSUKKONEN E.1979; LECTURE NOTES COMPUTER SCI.; DEU; DA. 1979; NO 71; PP. 646-658; BIBL. 12 REF.Conference Paper

ON THE CALCULATION OF THE EFFECTS OF ROUNDOFF ERRORSUKKONEN E.1981; A.C.M. TRANS. MATH. SOFTWARE; USA; DA. 1981; VOL. 7; NO 3; PP. 259-271; BIBL. 12 REF.Article

REMARKS ON THE NONEXISTENCE OF SOME COVERING GRAMMARSUKKONEN E.1979; LECTURE NOTES COMPUTER SCI.; DEU; DA. 1979; NO 67; PP. 298-309; BIBL. 7 REF.Conference Paper

ON SIZE BOUNDS FOR DETERMINISTIC PARSERSUKKONEN E.1981; LECT. NOTES COMPUT. SCI.; ISSN 0302-9743; DEU; DA. 1981; NO 115; PP. 218-228; BIBL. 8 REF.Conference Paper

THE EQUIVALENCE PROBLEM FOR SOME NON-REAL-TIME DETERMINISTIC PUSHDOWN AUTOMATAUKKONEN E.1982; J. ASSOC. COMPUT. MACH.; ISSN 0004-5411; USA; DA. 1982; VOL. 29; NO 4; PP. 1166-1181; BIBL. 17 REF.Article

AN ANALYSIS OF THE EFFECT OF ROUNDING ERRORS ON THE FLOW OF CONTROL IN NUMERICAL PROCESSESUKKONEN E.1979; B.I.T.; DNK; DA. 1979; VOL. 19; NO 1; PP. 116-133; BIBL. 17 REF.Article

STRUCTURE PRESERVING ELIMINATION OF NULL PRODUCTIONS FROM CONTEXT-FREE GRAMMARSUKKONEN E.1982; THEOR. COMPUT. SCI.; ISSN 0304-3975; NLD; DA. 1982; VOL. 17; NO 1; PP. 43-54; BIBL. 10 REF.Article

A DECISION METHOD FOR THE EQUIVALENCE OF SOME NON-REAL-TIME DETERMINISTIC PUSHDOWN AUTOMATAUKKONEN E.1980; ANNUAL ASSOCIATION FOR COMPUTING MACHINERY SYMPOSIUM ON THEORY OF COMPUTING. 12/1980/LOS ANGELES CA; USA; NEW YORK: ACM; DA. 1980; PP. 29-38; BIBL. 18 REF.Conference Paper

Upper bounds on the size of LR(k) parsersUKKONEN, E.Information processing letters. 1985, Vol 20, Num 2, pp 99-103, issn 0020-0190Article

MINIMIZING THE NUMBER OF EVALUATION PASSES FOR ATTRIBUTE GRAMMARSRAIHA KJ; UKKONEN E.1981; SIAM J. COMPUT.; ISSN 0097-5397; USA; DA. 1981; VOL. 10; NO 4; PP. 772-786; BIBL. 19 REF.Article

ON THE OPTIMAL ASSIGNMENT OF ATTRIBUTES TO PASSES IN MULTI-PASS ATTRIBUTE EVALUATORSRAEIHAE KJ; UKKONEN E.1980; LECTURE NOTES COMPUTER SCI.; DEU; DA. 1980; NO 85; PP. 500-511; BIBL. 17 REF.Conference Paper

Lower bounds on the size of deterministic parsersUKKONEN, E.Journal of computer and system sciences (Print). 1983, Vol 26, Num 2, pp 153-170, issn 0022-0000Article

Finding approximate patterns in stringsUKKONEN, E.Journal of algorithms (Print). 1985, Vol 6, Num 1, pp 132-137, issn 0196-6774Article

Algorithms for approximate string matchingUKKONEN, E.Information and control. 1985, Vol 64, Num 1-3, pp 100-118, issn 0019-9958Article

Two results on polynomial time truth-table reductions to sparse setsUKKONEN, E.SIAM journal on computing (Print). 1983, Vol 12, Num 3, pp 580-587, issn 0097-5397Article

A METHOD FOR TRANSFORMING GRAMMARS INTO LL(K) FORMSOISALON SOININEN E; UKKONEN E.1979; ACTA INFORMAT.; DEU; DA. 1979; VOL. 12; NO 4; PP. 339-369; BIBL. 30 REF.Article

THE SHORTEST COMMON SUPERSEQUENCE PROBLEM OVER BINARY ALPHABET IS NP-COMPLETEKARI JOUKO RAIHA; UKKONEN E.1981; THEOR. COMPUT. SCI.; ISSN 0304-3975; NLD; DA. 1981; VOL. 16; NO 2; PP. 187-198; BIBL. 7 REF.Article

A CHARACTERIZATION OF LL(K) LANGUAGES.SOISALON SOININEN E; UKKONEN E.1976; IN: AUTOM. LANG. PROGRAM. INT. COLLOQ. 3; EDINBURGH; 1976; EDINBURGH; UNIV. PRESS; DA. 1976; PP. 20-30; BIBL. 16 REF.Conference Paper

LABR (K) TESTING IS PSPACE-COMPLETEUKKONEN E; SOISALON SOININEN E.1981; ANNUAL ASSOCIATION FOR COMPUTING MACHINERY SYMPOSIUM ON THEORY OF COMPUTING. 13/1981/MILWAUKEE WI; USA; NEW YORK: ASSOCIATION FOR COMPUTING MACHINERY; DA. 1981; PP. 202-206; BIBL. 10 REF.Conference Paper

Approximate Boyer-Moore string matchingTARHIO, J; UKKONEN, E.SIAM journal on computing (Print). 1993, Vol 22, Num 2, pp 243-260, issn 0097-5397Article

A simple linear-tine algorithm for in situ mergingMANNILA, H; UKKONEN, E.Information processing letters. 1984, Vol 18, Num 4, pp 203-208, issn 0020-0190Article

Two- and higher-dimensional pattern matching in optimal expected timeKÄRKKÄINEN, J; UKKONEN, E.SIAM journal on computing (Print). 2000, Vol 29, Num 2, pp 571-589, issn 0097-5397Article

Toward complete genome data mining in computational biologyUKKONEN, E.Lecture notes in computer science. 2000, pp 20-21, issn 0302-9743, isbn 3-540-67690-2Conference Paper

  • Page / 2