| 2024 | DEXA | Lightweight Latches for B-Trees to Cope with High Contention. | Amir El-Shaikh, Bernhard Seeger, Eljas Soisalon-Soininen |
| 2016 | ICDE | Message from the ICDE 2016 Program Committee and general chairs. | Mei Hsu, Alfons Kemper, Timos K. Sellis, Boris Novikov, Eljas Soisalon-Soininen |
| 2013 | LATA | Online Matching of Multiple Regular Patterns with Gaps and Character Classes. | Seppo Sippu, Eljas Soisalon-Soininen |
| 2012 | ISAAC | A General Method for Improving Insertion-Based Adaptive Sorting. | Riku Saikkonen, Eljas Soisalon-Soininen |
| 2009 | EDBT | Transactions on the multiversion B | Tuukka Haapasalo, Ibrahim Jaluta, Bernhard Seeger, Seppo Sippu, Eljas Soisalon-Soininen |
| 2009 | EDBT | Schema-conscious filtering of XML documents. | Panu Silvasti, Seppo Sippu, Eljas Soisalon-Soininen |
| 2009 | IDEAS | Concurrent updating transactions on versioned data. | Tuukka Haapasalo, Seppo Sippu, Ibrahim Jaluta, Eljas Soisalon-Soininen |
| 2008 | CIKM | Concurrency control and recovery for multiversion database structures. | Tuukka K. Haapasalo, Ibrahim Jaluta, Seppo Sippu, Eljas Soisalon-Soininen |
| 2007 | DEXA | A Two-Phased Visual Query Interface for Relational Databases. | Sami El-Mahgary, Eljas Soisalon-Soininen |
| 2007 | ICDE | Online Bulk Deletion. | Timo Lilja, Riku Saikkonen, Seppo Sippu, Eljas Soisalon-Soininen |
| 2004 | SPIRE | Concurrency Control and I/O-Optimality in Bulk Insertion.. | Kerttu Pollari-Malmi, Eljas Soisalon-Soininen |
| 2004 | SPIRE | On Classification of Strings. | Eljas Soisalon-Soininen, Tatu Ylnen |
| 2002 | SIROCCO | Distributed Highly Available Search Trees. | Konrad Schlude, Eljas Soisalon-Soininen, Peter Widmayer |
| 2001 | ICDT | A Theory of Transactions on Recoverable Search Trees. | Seppo Sippu, Eljas Soisalon-Soininen |
| 2000 | CIAC | Group Updates for Red-Black Trees. | Sabine Hanke, Eljas Soisalon-Soininen |
| 2000 | IDEAS | Concurrency Control for B-Trees with Differential Indices. | Kerttu Pollari-Malmi, Jarmo Ruuth, Eljas Soisalon-Soininen |
| 1999 | PODS | Group Updates for Relaxed Height-Balanced Trees. | Lauri Malmi, Eljas Soisalon-Soininen |
| 1999 | SPIRE | Concurrency and Recovery in Full-Text Indexing. | Eljas Soisalon-Soininen, Peter Widmayer |
| 1997 | CIAC | Relaxed Balanced Red-Black Trees. | Sabine Hanke, Thomas Ottmann, Eljas Soisalon-Soininen |
| 1997 | ESA | Relaxed Balance for Search Trees with Local Rebalancing. | Kim S. Larsen, Thomas Ottmann, Eljas Soisalon-Soininen |
| 1997 | WADS | Relaxed Balance through Standard Rotations. | Kim S. Larsen, Eljas Soisalon-Soininen, Peter Widmayer |
| 1995 | ICDT | Partial Strictness in Two-Phase Locking. | Eljas Soisalon-Soininen, Tatu Ylnen |
| 1994 | ADC | Avoiding Redundant Computations in Evaluating Linear Queries. | Seppo Sippu, Eljas Soisalon-Soininen |
| 1991 | PODS | Uncoupling Updating and Rebalancing in Chromatic Binary Search Trees. | Otto Nurmi, Eljas Soisalon-Soininen |
| 1990 | ICDT | Multiple SIP Strategies and Bottom-Up Adorning in Logic Query Optimization. | Seppo Sippu, Eljas Soisalon-Soininen |
| 1990 | VLDB | Efficient Implementation of Loops in Bottom-Up Evaluation of Logic Queries. | Juhani Kuittinen, Otto Nurmi, Seppo Sippu, Eljas Soisalon-Soininen |
| 1988 | ICDE | An Optimization Strategy for Recursive Queries in Logic Databases. | Seppo Sippu, Eljas Soisalon-Soininen |
| 1988 | PODS | A Generalized Transitive Closure for Relational Queries. | Seppo Sippu, Eljas Soisalon-Soininen |
| 1987 | PODS | Efficient Evaluation for a Subset of Recursive Queries. | Gsta Grahne, Seppo Sippu, Eljas Soisalon-Soininen |
| 1987 | PODS | Concurrency Control in Database Structures with Relaxed Balance. | Otto Nurmi, Eljas Soisalon-Soininen, Derick Wood |
| 1986 | ICDT | Towards Online Schedulers Based on Pre-Analysis Locking. | Georg Lausen, Eljas Soisalon-Soininen, Peter Widmayer |
| 1985 | ICALP | On the Use of Relational Expressions in the Design of Efficient Algorithms (Extended Abstract). | Seppo Sippu, Eljas Soisalon-Soininen |
| 1985 | VLDB | Pre-Analysis Locking: A Safe and Deadlock Free Locking Policy. | Georg Lausen, Eljas Soisalon-Soininen, Peter Widmayer |
| 1984 | ICALP | The Complexity and Decidability of Separation. | Bernard Chazelle, Thomas Ottmann, Eljas Soisalon-Soininen, Derick Wood |
| 1984 | PODS | Maximal Concurrency by Locking. | Georg Lausen, Eljas Soisalon-Soininen, Peter Widmayer |
| 1982 | PODS | An Optimal Algorithm for Testing for Safety and Detecting Deadlocks in Locked Transaction Systems. | Eljas Soisalon-Soininen, Derick Wood |
| 1982 | POPL | Practical Error Recovery in LR Parsing. | Seppo Sippu, Eljas Soisalon-Soininen |
| 1981 | ICALP | On LALR(1) Testing. | Seppo Sippu, Eljas Soisalon-Soininen |
| 1981 | MFCS | On Structural Similarity of Context-Free Grammars. | Eljas Soisalon-Soininen, Derick Wood |
| 1981 | STOC | LALR(k) Testing is PSPACE-Complete | Esko Ukkonen, Eljas Soisalon-Soininen |
| 1980 | ICALP | Characterizations of the LL(k) Property. | Seppo Sippu, Eljas Soisalon-Soininen |
| 1979 | ICALP | Con Constructing LL(k) Parsers. | Seppo Sippu, Eljas Soisalon-Soininen |
| 1979 | MFCS | Ch(k) Grammars: A Characterization of LL(k) Languages. | Anton Nijholt, Eljas Soisalon-Soininen |
| 1977 | ICALP | On Defining Error Recovery in Context-Free Parsing. | Seppo Sippu, Eljas Soisalon-Soininen |
| 1977 | POPL | Elimination of Single Productions from LR Parsers in Conjunction with the Use of Default Reductions. | Eljas Soisalon-Soininen |
| 1976 | ICALP | A Characterization of LL(k) Languages. | Eljas Soisalon-Soininen, Esko Ukkonen |