![]() ![]() ![]() | ![]() |
![]() ![]() ![]() ![]() ![]() |
![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() |
Note: Links lead to the DBLP on the Web. Seppo Sippu Ibrahim Jaluta , Seppo Sippu, Eljas Soisalon-Soininen : Concurrency control and recovery for balanced B-link trees. VLDB J. 14 (2): 257-277 (2005) Seppo Sippu, Eljas Soisalon-Soininen : A Theory of Transactions on Recoverable Search Trees. ICDT 2001 : 83-98 Seppo Sippu, Eljas Soisalon-Soininen : An Analysis of Magic Sets and Related Optimization Strategies for Logic Queries. J. ACM 43 (6): 1046-1088 (1996) Seppo Sippu, Eljas Soisalon-Soininen : Avoiding Redundant Computations in Evaluating Linear Queries. Australasian Database Conference 1994 : 124-135 Gösta Grahne , Seppo Sippu, Eljas Soisalon-Soininen : Efficient Evaluation for a Subset of Recursive Queries. J. Log. Program. 10 (1/2/3&4): 301-332 (1991) Seppo Sippu, Eljas Soisalon-Soininen : Multiple SIP Strategies and Bottom-Up Adorning in Logic Query Optimization. ICDT 1990 : 485-498 Juhani Kuittinen , Otto Nurmi , Seppo Sippu, Eljas Soisalon-Soininen : Efficient Implementation of Loops in Bottom-Up Evaluation of Logic Queries. VLDB 1990 : 372-379 Seppo Sippu, Eljas Soisalon-Soininen : An Optimization Strategy for Recursive Queries in Logic Databases. ICDE 1988 : 470-477 Seppo Sippu, Eljas Soisalon-Soininen : A Generalized Transitive Closure for Relational Queries. PODS 1988 : 325-332 Kai Koskimies , Otto Nurmi , Jukka Paakki , Seppo Sippu: The Design of a Language Processor Generator. Softw., Pract. Exper. 18 (2): 107-135 (1988) Gösta Grahne , Seppo Sippu, Eljas Soisalon-Soininen : Efficient Evaluation for a Subset of Recursive Queries. PODS 1987 : 284-293 Seppo Sippu, Eljas Soisalon-Soininen : On the Use of Relational Expressions in the Design of Efficient Algorithms (Extended Abstract). ICALP 1985 : 456-464 Seppo Sippu, Eljas Soisalon-Soininen : A Syntax-Error-Handling Technique and Its Experimental Analysis. ACM Trans. Program. Lang. Syst. 5 (4): 656-679 (1983) Seppo Sippu, Eljas Soisalon-Soininen , Esko Ukkonen : The Complexity of LALR(k) Testing J. ACM 30 (2): 259-270 (1983) Seppo Sippu, Eljas Soisalon-Soininen : On the Complexity of LL(k) Testing. J. Comput. Syst. Sci. 26 (2): 244-268 (1983) Seppo Sippu, Eljas Soisalon-Soininen : Practical Error Recovery in LR Parsing. POPL 1982 : 177-184 Seppo Sippu: Derivational Complexity of Context-Free Grammars Information and Control 53 (1/2): 52-65 (1982) Seppo Sippu, Eljas Soisalon-Soininen : On LL(k) Parsing Information and Control 53 (3): 141-164 (1982) Seppo Sippu, Eljas Soisalon-Soininen : On LALR(1) Testing. ICALP 1981 : 208-217 Seppo Sippu, Eljas Soisalon-Soininen : Characterizations of the LL(k) Property. ICALP 1980 : 596-608 Seppo Sippu, Eljas Soisalon-Soininen : Con Constructing LL(k) Parsers. ICALP 1979 : 585-595 Seppo Sippu, Eljas Soisalon-Soininen : On Defining Error Recovery in Context-Free Parsing. ICALP 1977 : 492-503 1 [ 12 ] [ 18 ] 2 [ 22 ] 3 [ 13 ] 4 [ 16 ] 5 [ 13 ] [ 16 ] 6 [ 13 ] 7 [ 1 ] [ 2 ] [ 3 ] [ 4 ] [ 5 ] [ 7 ] [ 8 ] [ 9 ] [ 10 ] [ 11 ] [ 12 ] [ 14 ] [ 15 ] [ 16 ] [ 17 ] [ 18 ] [ 19 ] [ 20 ] [ 21 ] [ 22 ] 8 [ 9 ] ![]() ©2006 Association for Computing Machinery |