| |
 |      |
                                            |
Note: Links lead to the DBLP on the Web. Eljas Soisalon-Soininen 64 Eljas Soisalon-Soininen, Peter Widmayer : Amortized Complexity of Bulk Updates in AVL-Trees. SWAT 2002 : 439-448 63 Seppo Sippu , Eljas Soisalon-Soininen: A Theory of Transactions on Recoverable Search Trees. ICDT 2001 : 83-98 62 Kim S. Larsen , Thomas Ottmann , Eljas Soisalon-Soininen: Relaxed balance for search trees with local rebalancing. Acta Informatica 37 (10): 743-763 (2001) 61 Kim S. Larsen , Eljas Soisalon-Soininen, Peter Widmayer : Relaxed Balance Using Standard Rotations. Algorithmica 31 (4): 501-512 (2001) 60 Vesa Hirvisalo , Esko Nuutila , Eljas Soisalon-Soininen: Transitive closure algorithm MEMTC and its performance analysis. Discrete Applied Mathematics 110 (1): 77-84 (2001) 59 Sabine Hanke , Eljas Soisalon-Soininen: Group Updates for Red-Black Trees. CIAC 2000 : 253-262 58 Kerttu Pollari-Malmi , Jarmo Ruuth , Eljas Soisalon-Soininen: Concurrency Control for B-Trees with Differential Indices. IDEAS 2000 : 287-295 57 Lauri Malmi , Eljas Soisalon-Soininen: Group Updates for Relaxed Height-Balanced Trees. PODS 1999 : 358-367 56 Eljas Soisalon-Soininen, Peter Widmayer : Concurrency and Recovery in Full-Text Indexing. SPIRE/CRIWG 1999 : 192-198 55 Eljas Soisalon-Soininen, Peter Widmayer : Relaxed Balancing in Search Trees. Advances in Algorithms, Languages, and Complexity 1997 : 267-283 54 Sabine Hanke , Thomas Ottmann , Eljas Soisalon-Soininen: Relaxed Balanced Red-Black Trees. CIAC 1997 : 193-204 53 Kim S. Larsen , Thomas Ottmann , Eljas Soisalon-Soininen: Relaxed Balance for Search Trees with Local Rebalancing. ESA 1997 : 350-363 52 Kim S. Larsen , Eljas Soisalon-Soininen, Peter Widmayer : Relaxed Balance through Standard Rotations. WADS 1997 : 450-461 51 Otto Nurmi , Eljas Soisalon-Soininen: Chromatic Binary Search Trees. A Structure for Concurrent Rebalancing. Acta Informatica 33 (6): 547-557 (1996) 50 Seppo Sippu , Eljas Soisalon-Soininen: An Analysis of Magic Sets and Related Optimization Strategies for Logic Queries. JACM 43 (6): 1046-1088 (1996) 49 Kerttu Pollari-Malmi , Eljas Soisalon-Soininen, Tatu Ylönen : Concurrency Control in B-Trees with Batch Updates. TKDE 8 (6): 975-984 (1996) 48 Eljas Soisalon-Soininen, Tatu Ylönen : Partial Strictness in Two-Phase Locking. ICDT 1995 : 139-147 47 Georg Lausen , Eljas Soisalon-Soininen: Safety by Uninterpreted Locks. Information and Computation 117 (1): 37-49 (1995) 46 Seppo Sippu , Eljas Soisalon-Soininen: Avoiding Redundant Computations in Evaluating Linear Queries. Australasian Database Conference 1994 : 124-135 45 Esko Nuutila , Eljas Soisalon-Soininen: On Finding the Strongly Connected Components in a Directed Graph. Information Processing Letters 49 (1): 9-14 (1994) 44 Otto Nurmi , Eljas Soisalon-Soininen: Uncoupling Updating and Rebalancing in Chromatic Binary Search Trees. PODS 1991 : 192-198 43 Gösta Grahne , Seppo Sippu , Eljas Soisalon-Soininen: Efficient Evaluation for a Subset of Recursive Queries. JLP 10 (1/2/3&4): 301-332 (1991) 42 Seppo Sippu , Eljas Soisalon-Soininen: Multiple SIP Strategies and Bottom-Up Adorning in Logic Query Optimization. ICDT 1990 : 485-498 41 Juhani Kuittinen , Otto Nurmi , Seppo Sippu , Eljas Soisalon-Soininen: Efficient Implementation of Loops in Bottom-Up Evaluation of Logic Queries. VLDB 1990 : 372-379 40 Georg Lausen , Eljas Soisalon-Soininen, Peter Widmayer : On the Power of Safe Locking. JCSS 40 (2): 269-288 (1990) 39 Georg Lausen , Eljas Soisalon-Soininen: Locling Policies and Predeclared Transactions. MFDBS 1989 : 317-336 38 Seppo Sippu , Eljas Soisalon-Soininen: An Optimization Strategy for Recursive Queries in Logic Databases. ICDE 1988 : 470-477 37 Seppo Sippu , Eljas Soisalon-Soininen: A Generalized Transitive Closure for Relational Queries. PODS 1988 : 325-332 36 Eljas Soisalon-Soininen, Jorma Tarhio : Looping LR Parsers. Information Processing Letters 26 (5): 251-253 (1988) 35 Otto Nurmi , Eljas Soisalon-Soininen, Derick Wood : Concurrency Control in Database Structures with Relaxed Balance. PODS 1987 : 170-176 34 Gösta Grahne , Seppo Sippu , Eljas Soisalon-Soininen: Efficient Evaluation for a Subset of Recursive Queries. PODS 1987 : 284-293 33 Georg Lausen , Eljas Soisalon-Soininen, Peter Widmayer : Towards Online Schedulers Based on Pre-Analysis Locking. ICDT 1986 : 242-259 32 Ivan Stojmenovic , Eljas Soisalon-Soininen: A Note on Approximate Convex Hulls. Information Processing Letters 22 (2): 55-56 (1986) 31 Georg Lausen , Eljas Soisalon-Soininen, Peter Widmayer : Pre-analysis Locking. Information and Control 70 (2/3): 193-215 (1986) 30 Seppo Sippu , Eljas Soisalon-Soininen: On the Use of Relational Expressions in the Design of Efficient Algorithms (Extended Abstract). ICALP 1985 : 456-464 29 Georg Lausen , Eljas Soisalon-Soininen, Peter Widmayer : Pre-Analysis Locking: A Safe and Deadlock Free Locking Policy. VLDB 1985 : 270-281 28 Bernard Chazelle , Thomas Ottmann , Eljas Soisalon-Soininen, Derick Wood : The Complexity and Decidability of Separation. ICALP 1984 : 119-127 27 Georg Lausen , Eljas Soisalon-Soininen, Peter Widmayer : Maximal Concurrency by Locking. PODS 1984 : 38-44 26 Thomas Ottmann , Eljas Soisalon-Soininen, Derick Wood : On the Definition and Computation of Rectlinear Convex Hulls. Information Sciences 33 : 157-171 (1984) 25 Eljas Soisalon-Soininen, Peter Widmayer : On the Complexity of Concurrency Control by Locking in Distributed Database Systems. Information and Control 60 (1-3): 103-108 (1984) 24 Eljas Soisalon-Soininen, Derick Wood : Optimal Algorithms to Compute the Closure of a Set of Iso-Rectangles. J. Algorithms 5 (2): 199-214 (1984) 23 Eljas Soisalon-Soininen: On Computing Approximate Convex Hulls. Information Processing Letters 16 (3): 121-126 (1983) 22 Seppo Sippu , Eljas Soisalon-Soininen, Esko Ukkonen : The Complexity of LALR(k) Testing. JACM 30 (2): 259-270 (1983) 21 Seppo Sippu , Eljas Soisalon-Soininen: On the Complexity of LL(k) Testing. JCSS 26 (2): 244-268 (1983) 20 Seppo Sippu , Eljas Soisalon-Soininen: A Syntax-Error-Handling Technique and Its Experimental Analysis. TOPLAS 5 (4): 656-679 (1983) 19 Eljas Soisalon-Soininen, Derick Wood : An Optimal Algorithm for Testing for Safety and Detecting Deadlocks in Locked Transaction Systems. PODS 1982 : 108-116 18 Seppo Sippu , Eljas Soisalon-Soininen: Practical Error Recovery in LR Parsing. POPL 1982 : 177-184 17 Eljas Soisalon-Soininen, Derick Wood : On a Covering Relation for Context-Free Grammars. Acta Informatica 17 : 435-449 (1982) 16 Eljas Soisalon-Soininen: Translations on a Subclass of LR(k) Grammars. BIT 22 (3): 303-312 (1982) 15 Seppo Sippu , Eljas Soisalon-Soininen: On LL(k) Parsing. Information and Control 53 (3): 141-164 (1982) 14 Eljas Soisalon-Soininen: Inessential Error Entries and Their Use in LR Parser Optimization. TOPLAS 4 (2): 179-195 (1982) 13 Seppo Sippu , Eljas Soisalon-Soininen: On LALR(1) Testing. ICALP 1981 : 208-217 12 Eljas Soisalon-Soininen, Derick Wood : On Structural Similarity of Context-Free Grammars. MFCS 1981 : 491-498 11 Esko Ukkonen , Eljas Soisalon-Soininen: LALR(k) Testing is PSPACE-Complete. STOC 1981 : 202-206 10 Seppo Sippu , Eljas Soisalon-Soininen: Characterizations of the LL(k) Property. ICALP 1980 : 596-608 9 Eljas Soisalon-Soininen: On the Space Optimizing Effect of Eliminating Single Productions from LR Parsers. Acta Informatica 14 : 157-174 (1980) 8 Eljas Soisalon-Soininen: On Comparing LL(k) and LR(k) Grammars. Mathematical Systems Theory 13 : 323-329 (1980) 7 Seppo Sippu , Eljas Soisalon-Soininen: Con Constructing LL(k) Parsers. ICALP 1979 : 585-595 6 Anton Nijholt , Eljas Soisalon-Soininen: Ch(k) Grammars: A Characterization of LL(k) Languages. MFCS 1979 : 390-397 5 Eljas Soisalon-Soininen, Esko Ukkonen : A Method for Transforming Grammars into LL(k) Form. Acta Informatica 12 : 339-369 (1979) 4 Eljas Soisalon-Soininen: On the Covering Problem for Left-Recursive Grammars. TCS 8 : 1-11 (1979) 3 Seppo Sippu , Eljas Soisalon-Soininen: On Defining Error Recovery in Context-Free Parsing. ICALP 1977 : 492-503 2 Eljas Soisalon-Soininen: Elimination of Single Productions from LR Parsers in Conjunction with the Use of Default Reductions. POPL 1977 : 183-193 1 Eljas Soisalon-Soininen, Esko Ukkonen : A Characterization of LL(k) Languages. ICALP 1976 : 20-30  DiSC'02 © 2003 Association for Computing Machinery |
