| 2009 |
|---|
| 79 | EE | Tuukka K. Haapasalo,
Ibrahim Jaluta,
Bernhard Seeger,
Seppo Sippu,
Eljas Soisalon-Soininen:
Transactions on the multiversion B+-tree.
EDBT 2009: 1064-1075 |
| 78 | EE | Panu Silvasti,
Seppo Sippu,
Eljas Soisalon-Soininen:
Schema-conscious filtering of XML documents.
EDBT 2009: 970-981 |
| 2008 |
|---|
| 77 | EE | Riku Saikkonen,
Eljas Soisalon-Soininen:
Cache-sensitive Memory Layout for Binary Trees.
IFIP TCS 2008: 241-255 |
| 76 | EE | Tuukka K. Haapasalo,
Ibrahim Jaluta,
Seppo Sippu,
Eljas Soisalon-Soininen:
Concurrency control and recovery for multiversion database structures.
PIKM 2008: 73-80 |
| 75 | EE | Panu Silvasti,
Seppo Sippu,
Eljas Soisalon-Soininen:
XML-document-filtering automaton.
PVLDB 1(2): 1666-1671 (2008) |
| 2007 |
|---|
| 74 | EE | Sami El-Mahgary,
Eljas Soisalon-Soininen:
A Two-Phased Visual Query Interface for Relational Databases.
DEXA 2007: 489-498 |
| 73 | EE | Timo Lilja,
Riku Saikkonen,
Seppo Sippu,
Eljas Soisalon-Soininen:
Online Bulk Deletion.
ICDE 2007: 956-965 |
| 2006 |
|---|
| 72 | EE | Ibrahim Jaluta,
Seppo Sippu,
Eljas Soisalon-Soininen:
B-tree concurrency control and recovery in page-server database systems.
ACM Trans. Database Syst. 31(1): 82-132 (2006) |
| 2005 |
|---|
| 71 | EE | Ibrahim Jaluta,
Seppo Sippu,
Eljas Soisalon-Soininen:
Concurrency control and recovery for balanced B-link trees.
VLDB J. 14(2): 257-277 (2005) |
| 2004 |
|---|
| 70 | EE | Kerttu Pollari-Malmi,
Eljas Soisalon-Soininen:
Concurrency Control and I/O-Optimality in Bulk Insertion..
SPIRE 2004: 161-170 |
| 69 | EE | Eljas Soisalon-Soininen,
Tatu Ylönen:
On Classification of Strings.
SPIRE 2004: 321-330 |
| 2003 |
|---|
| 68 | EE | Eljas Soisalon-Soininen,
Peter Widmayer:
Single and Bulk Updates in Stratified Trees: An Amortized and Worst-Case Analysis.
Computer Science in Perspective 2003: 278-292 |
| 67 | EE | Konrad Schlude,
Eljas Soisalon-Soininen,
Peter Widmayer:
Distributed Search Trees: Fault Tolerance in an Asynchronous Environment.
Theory Comput. Syst. 36(6): 611-629 (2003) |
| 2002 |
|---|
| 66 | | Konrad Schlude,
Eljas Soisalon-Soininen,
Peter Widmayer:
Distributed Highly Available Search Trees.
SIROCCO 2002: 259-274 |
| 65 | EE | Eljas Soisalon-Soininen,
Peter Widmayer:
Amortized Complexity of Bulk Updates in AVL-Trees.
SWAT 2002: 439-448 |
| 2001 |
|---|
| 64 | EE | Seppo Sippu,
Eljas Soisalon-Soininen:
A Theory of Transactions on Recoverable Search Trees.
ICDT 2001: 83-98 |
| 63 | EE | Kim S. Larsen,
Thomas Ottmann,
Eljas Soisalon-Soininen:
Relaxed balance for search trees with local rebalancing.
Acta Inf. 37(10): 743-763 (2001) |
| 62 | EE | Kim S. Larsen,
Eljas Soisalon-Soininen,
Peter Widmayer:
Relaxed Balance Using Standard Rotations.
Algorithmica 31(4): 501-512 (2001) |
| 61 | | Vesa Hirvisalo,
Esko Nuutila,
Eljas Soisalon-Soininen:
Transitive closure algorithm MEMTC and its performance analysis.
Discrete Applied Mathematics 110(1): 77-84 (2001) |
| 2000 |
|---|
| 60 | EE | Sabine Hanke,
Eljas Soisalon-Soininen:
Group Updates for Red-Black Trees.
CIAC 2000: 253-262 |
| 59 | EE | Kerttu Pollari-Malmi,
Jarmo Ruuth,
Eljas Soisalon-Soininen:
Concurrency Control for B-Trees with Differential Indices.
IDEAS 2000: 287-295 |
| 1999 |
|---|
| 58 | EE | Lauri Malmi,
Eljas Soisalon-Soininen:
Group Updates for Relaxed Height-Balanced Trees.
PODS 1999: 358-367 |
| 57 | EE | Eljas Soisalon-Soininen,
Peter Widmayer:
Concurrency and Recovery in Full-Text Indexing.
SPIRE/CRIWG 1999: 192-198 |
| 1997 |
|---|
| 56 | | Eljas Soisalon-Soininen,
Peter Widmayer:
Relaxed Balancing in Search Trees.
Advances in Algorithms, Languages, and Complexity 1997: 267-283 |
| 55 | | Sabine Hanke,
Thomas Ottmann,
Eljas Soisalon-Soininen:
Relaxed Balanced Red-Black Trees.
CIAC 1997: 193-204 |
| 54 | | Kim S. Larsen,
Thomas Ottmann,
Eljas Soisalon-Soininen:
Relaxed Balance for Search Trees with Local Rebalancing.
ESA 1997: 350-363 |
| 53 | | Kim S. Larsen,
Eljas Soisalon-Soininen,
Peter Widmayer:
Relaxed Balance through Standard Rotations.
WADS 1997: 450-461 |
| 1996 |
|---|
| 52 | | Otto Nurmi,
Eljas Soisalon-Soininen:
Chromatic Binary Search Trees. A Structure for Concurrent Rebalancing.
Acta Inf. 33(6): 547-557 (1996) |
| 51 | EE | Kerttu Pollari-Malmi,
Eljas Soisalon-Soininen,
Tatu Ylönen:
Concurrency Control in B-Trees with Batch Updates.
IEEE Trans. Knowl. Data Eng. 8(6): 975-984 (1996) |
| 50 | EE | Seppo Sippu,
Eljas Soisalon-Soininen:
An Analysis of Magic Sets and Related Optimization Strategies for Logic Queries.
J. ACM 43(6): 1046-1088 (1996) |
| 1995 |
|---|
| 49 | EE | Eljas Soisalon-Soininen,
Tatu Ylönen:
Partial Strictness in Two-Phase Locking.
ICDT 1995: 139-147 |
| 48 | | Georg Lausen,
Eljas Soisalon-Soininen:
Safety by Uninterpreted Locks
Inf. Comput. 117(1): 37-49 (1995) |
| 1994 |
|---|
| 47 | | Seppo Sippu,
Eljas Soisalon-Soininen:
Avoiding Redundant Computations in Evaluating Linear Queries.
Australasian Database Conference 1994: 124-135 |
| 46 | | Esko Nuutila,
Eljas Soisalon-Soininen:
On Finding the Strongly Connected Components in a Directed Graph.
Inf. Process. Lett. 49(1): 9-14 (1994) |
| 1991 |
|---|
| 45 | EE | Otto Nurmi,
Eljas Soisalon-Soininen:
Uncoupling Updating and Rebalancing in Chromatic Binary Search Trees.
PODS 1991: 192-198 |
| 44 | | 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) |
| 1990 |
|---|
| 43 | EE | Seppo Sippu,
Eljas Soisalon-Soininen:
Multiple SIP Strategies and Bottom-Up Adorning in Logic Query Optimization.
ICDT 1990: 485-498 |
| 42 | EE | Juhani Kuittinen,
Otto Nurmi,
Seppo Sippu,
Eljas Soisalon-Soininen:
Efficient Implementation of Loops in Bottom-Up Evaluation of Logic Queries.
VLDB 1990: 372-379 |
| 41 | | Georg Lausen,
Eljas Soisalon-Soininen,
Peter Widmayer:
On the Power of Safe Locking.
J. Comput. Syst. Sci. 40(2): 269-288 (1990) |
| 1989 |
|---|
| 40 | EE | Georg Lausen,
Eljas Soisalon-Soininen:
Locling Policies and Predeclared Transactions.
MFDBS 1989: 317-336 |
| 1988 |
|---|
| 39 | EE | Seppo Sippu,
Eljas Soisalon-Soininen:
An Optimization Strategy for Recursive Queries in Logic Databases.
ICDE 1988: 470-477 |
| 38 | EE | Seppo Sippu,
Eljas Soisalon-Soininen:
A Generalized Transitive Closure for Relational Queries.
PODS 1988: 325-332 |
| 37 | | Eljas Soisalon-Soininen,
Jorma Tarhio:
Looping LR Parsers.
Inf. Process. Lett. 26(5): 251-253 (1988) |
| 1987 |
|---|
| 36 | EE | Otto Nurmi,
Eljas Soisalon-Soininen,
Derick Wood:
Concurrency Control in Database Structures with Relaxed Balance.
PODS 1987: 170-176 |
| 35 | EE | Gösta Grahne,
Seppo Sippu,
Eljas Soisalon-Soininen:
Efficient Evaluation for a Subset of Recursive Queries.
PODS 1987: 284-293 |
| 34 | EE | Thomas Ottmann,
Eljas Soisalon-Soininen,
Derick Wood:
Partitioning and separating sets of orthogonal polygons.
Inf. Sci. 42(1): 31-49 (1987) |
| 1986 |
|---|
| 33 | EE | 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.
Inf. Process. Lett. 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) |
| 1985 |
|---|
| 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 | EE | Georg Lausen,
Eljas Soisalon-Soininen,
Peter Widmayer:
Pre-Analysis Locking: A Safe and Deadlock Free Locking Policy.
VLDB 1985: 270-281 |
| 1984 |
|---|
| 28 | | Bernard Chazelle,
Thomas Ottmann,
Eljas Soisalon-Soininen,
Derick Wood:
The Complexity and Decidability of Separation.
ICALP 1984: 119-127 |
| 27 | EE | Georg Lausen,
Eljas Soisalon-Soininen,
Peter Widmayer:
Maximal Concurrency by Locking.
PODS 1984: 38-44 |
| 26 | EE | Thomas Ottmann,
Eljas Soisalon-Soininen,
Derick Wood:
On the Definition and Computation of Rectlinear Convex Hulls.
Inf. Sci. 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) |
| 1983 |
|---|
| 23 | EE | Seppo Sippu,
Eljas Soisalon-Soininen:
A Syntax-Error-Handling Technique and Its Experimental Analysis.
ACM Trans. Program. Lang. Syst. 5(4): 656-679 (1983) |
| 22 | | Eljas Soisalon-Soininen:
On Computing Approximate Convex Hulls.
Inf. Process. Lett. 16(3): 121-126 (1983) |
| 21 | EE | Seppo Sippu,
Eljas Soisalon-Soininen,
Esko Ukkonen:
The Complexity of LALR(k) Testing
J. ACM 30(2): 259-270 (1983) |
| 20 | | Seppo Sippu,
Eljas Soisalon-Soininen:
On the Complexity of LL(k) Testing.
J. Comput. Syst. Sci. 26(2): 244-268 (1983) |
| 1982 |
|---|
| 19 | EE | 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 | EE | Eljas Soisalon-Soininen:
Inessential Error Entries and Their Use in LR Parser Optimization.
ACM Trans. Program. Lang. Syst. 4(2): 179-195 (1982) |
| 16 | | Eljas Soisalon-Soininen,
Derick Wood:
On a Covering Relation for Context-Free Grammars.
Acta Inf. 17: 435-449 (1982) |
| 15 | | Eljas Soisalon-Soininen:
Translations on a Subclass of LR(k) Grammars.
BIT 22(3): 303-312 (1982) |
| 14 | | Seppo Sippu,
Eljas Soisalon-Soininen:
On LL(k) Parsing
Information and Control 53(3): 141-164 (1982) |
| 1981 |
|---|
| 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 |
| 1980 |
|---|
| 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 Inf. 14: 157-174 (1980) |
| 8 | | Eljas Soisalon-Soininen:
On Comparing LL(k) and LR(k) Grammars.
Mathematical Systems Theory 13: 323-329 (1980) |
| 1979 |
|---|
| 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 Inf. 12: 339-369 (1979) |
| 4 | | Eljas Soisalon-Soininen:
On the Covering Problem for Left-Recursive Grammars.
Theor. Comput. Sci. 8: 1-11 (1979) |
| 1977 |
|---|
| 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 |
| 1976 |
|---|
| 1 | | Eljas Soisalon-Soininen,
Esko Ukkonen:
A Characterization of LL(k) Languages.
ICALP 1976: 20-30 |
