INESSENTIAL ESSOR ENTRIES AND THEIR USE IN LR PARSER OPTIMIZATIONSOISALON SOININEN E.1982; ACM TRANS. PROGRAM. LANG. SYST.; ISSN 0164-0925; USA; DA. 1982; VOL. 4; NO 2; PP. 178-195; BIBL. 11 REF.Article

ON THE SPACE OPTIMIZING EFFECT OF ELIMINATING SINGLE PRODUCTIONS FROM LR PARSERSSOISALON SOININEN E.1980; ACTA INFORMAT.; DEU; DA. 1980; VOL. 14; NO 2; PP. 157-174; BIBL. 21 REF.Article

TRANSLATIONS ON A SUBCLASS OF LR(K) GRAMMARSSOISALON SOININEN E.1982; BIT (NORD. TIDSKR. INF. BEHANDL.); ISSN 0006-3835; SWE; DA. 1982; VOL. 22; NO 3; PP. 303-312; BIBL. 9 REF.Article

ON LALR (K) TESTINGSIPPU S; SOISALON SOININEN E.1981; LECT. NOTES COMPUT. SCI.; ISSN 0302-9743; DEU; DA. 1981; NO 115; PP. 208-217; BIBL. 7 REF.Conference Paper

A SCHEME FOR LR(K) PARSING WITH ERROR RECOVERY. I: ERROR CORRECTIONSIPPU S; SOISALON SOININEN E.1980; INT. J. COMPUT. MATH.; ISSN 0020-7160; GBR; DA. 1980; VOL. 8; NO 3; PP. 189-206; BIBL. 9 REF.Article

A SCHEME FOR LR(K) PARSING WITH ERROR RECOVERY. II: ERROR RECOVERYSIPPU P; SOISALON SOININEN E.1980; INTERNATION. J. COMPUTER MATH.; USA; DA. 1980; VOL. 8; NO 2; PP. 107-119; BIBL. 11 REF.Article

ON STRUCTURAL SIMILARITY OF CONTEXT-FREE GRAMMARSSOISALON SOININEN E; WOOD D.1981; LECT. NOTES COMPUT. SCI.; ISSN 0302-9743; DEU; DA. 1981; NO 118; PP. 491-498; BIBL. 7 REF.Conference Paper

CHARACTERIZATION OF THE LL (K) PROPERTYSIPPU S; SOISALON SOININEN E.1980; LECTURE NOTES COMPUTER SCI.; DEU; DA. 1980; NO 85; PP. 596-608; BIBL. 8 REF.Conference Paper

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

ON A COVERING RELATION FOR CONTEXT-FREE GRAMMARSSOISALON SOININEN E; WOOD D.1982; ACTA INFORMATICA; ISSN 0001-5903; DEU; DA. 1982; VOL. 17; NO 4; PP. 435-449; BIBL. 9 REF.Article

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

ON CONSTRUCTING LL (K) PARSERSSIPPU S; SOISALON SOININEN E.1979; LECTURE NOTES COMPUTER SCI.; DEU; DA. 1979; NO 71; PP. 585-595; BIBL. 12 REF.Conference Paper

PRACTICAL ERROR RECOVERY IN LR PARSINGSIPPU S; SOISALON SOININEN E.1982; ANNUAL ASSOCIATION FOR COMPUTING MACHINERY SYMPOSIUM ON PRINCIPLES OF PROGRAMMING LANGUAGES. 9/1982-01-25/ALBUQUERQUE NM; USA; NEW YORK: ACM; DA. 1982; PP. 177-184; BIBL. 18 REF.Conference Paper

CH (K) GRAMMARS: A CHARACTERIZATION OF LL (K) LANGUAGESNIJHOLT A; SOISALON SOININEN E.1979; LECTURE NOTES COMPUTER SCI.; DEU; DA. 1979; VOL. 74; PP. 390-397; BIBL. 9 REF.Conference Paper

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

On the complexicity of concurrency control by locking in distributed database systemsSOISALON-SOININEN, E; WIDMAYER, P.Information and control. 1984, Vol 60, Num 1-3, pp 103-108, issn 0019-9958Article

On the complexity of LL(k) testingSIPPU, S; SOISALON-SOININEN, E.Journal of computer and system sciences (Print). 1983, Vol 26, Num 2, pp 244-268, issn 0022-0000Article

An analysis of magic sets and related optimization strategies for logic queriesSIPPU, S; SOISALON-SOININEN, E.Journal of the Association for Computing Machinery. 1996, Vol 43, Num 6, pp 1046-1088, issn 0004-5411Article

Chromatic binary search trees : A structure for concurrent rebalancingNURMI, O; SOISALON-SOININEN, E.Acta informatica. 1996, Vol 33, Num 6, pp 547-557, issn 0001-5903Article

Safety by uninterpreted locksLAUSEN, G; SOISALON-SOININEN, E.Information and computation (Print). 1995, Vol 117, Num 1, pp 37-49, issn 0890-5401Article

Optimal algorithms to compute the closure of a set of iso-rectanglesSOISALON-SOININEN, E; WOOD, D.Journal of algorithms (Print). 1984, Vol 5, Num 2, pp 199-214, issn 0196-6774Article

Relaxed balance using standard rotationsLARSEN, K. S; SOISALON-SOININEN, E; WIDMAYER, P et al.Algorithmica. 2001, Vol 31, Num 4, pp 501-512, issn 0178-4617Article

Relaxed AVL trees, main-memory databases and concurrencyNURMI, O; SOISALON-SOININEN, E; WOOD, D et al.International journal of computer mathematics. 1996, Vol 62, Num 1-2, pp 23-44, issn 0020-7160Article

Partitioning and separating sets of orthogonal polygonsOTTMANN, T; SOISALON-SOININEN, E; WOOD, D et al.Information sciences. 1987, Vol 42, Num 1, pp 31-49, issn 0020-0255Article

Pre-analysis lockingLAUSEN, G; SOISALON-SOININEN, E; WIDMAYER, P et al.Information and control. 1986, Vol 70, Num 2-3, pp 193-215, issn 0019-9958Article