default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDEljas Soisalon-Soininen
Person information
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[c59]Amir El-Shaikh
, Bernhard Seeger, Eljas Soisalon-Soininen:
Lightweight Latches for B-Trees to Cope with High Contention. DEXA (2) 2024: 217-232- 2023
- [j39]Sami El-Mahgary, Eljas Soisalon-Soininen, Pekka Orponen, Petri Rönnholm, Hannu Hyyppä:
OVI-3: A NoSQL visual query system supporting efficient anti-joins. J. Intell. Inf. Syst. 60(3): 777-801 (2023)
2010 – 2019
- 2017
- [c58]Tuuli Klemetti, Reijo Salminen, Olli Martikainen, Riku Saikkonen, Eljas Soisalon-Soininen:
Extracting Service Process Models with Teams. SIMPDA 2017: 147-148 - 2016
- [j38]Riku Saikkonen, Eljas Soisalon-Soininen:
Cache-Sensitive Memory Layout for Dynamic Binary Trees. Comput. J. 59(5): 630-649 (2016) - [c57]Mei Hsu, Alfons Kemper, Timos K. Sellis, Boris Novikov, Eljas Soisalon-Soininen:
Message from the ICDE 2016 Program Committee and general chairs. ICDE 2016: i-ii - [c56]Ye Zhang, Olli Martikainen, Riku Saikkonen, Eljas Soisalon-Soininen:
Location-based Automated Process Modelling. SIMPDA 2016: 23-34 - [c55]Ye Zhang, Olli Martikainen, Riku Saikkonen, Eljas Soisalon-Soininen:
Extracting Service Process Models from Location Data. SIMPDA (Revised Selected Papers) 2016: 78-96 - 2015
- [j37]Sami El-Mahgary, Eljas Soisalon-Soininen:
A form-based query interface for complex queries. J. Vis. Lang. Comput. 29: 15-53 (2015) - [c54]Riku Saikkonen, Seppo Sippu, Eljas Soisalon-Soininen:
Experimental Analysis of an Online Dictionary Matching Algorithm for Regular Expressions with Gaps. SEA 2015: 327-338 - 2014
- [b3]Seppo Sippu, Eljas Soisalon-Soininen:
Transaction Processing - Management of the Logical Database and its Underlying Physical Structure. Data-Centric Systems and Applications, Springer 2014, ISBN 978-3-319-12291-5, pp. 1-369 - 2013
- [j36]Tuukka Haapasalo, Ibrahim Jaluta, Seppo Sippu, Eljas Soisalon-Soininen:
On the Recovery of R-Trees. IEEE Trans. Knowl. Data Eng. 25(1): 145-157 (2013) - [c53]Seppo Sippu, Eljas Soisalon-Soininen:
Online Matching of Multiple Regular Patterns with Gaps and Character Classes. LATA 2013: 523-534 - 2012
- [c52]Riku Saikkonen, Eljas Soisalon-Soininen:
A General Method for Improving Insertion-Based Adaptive Sorting. ISAAC 2012: 217-226 - 2011
- [c51]Tuukka Haapasalo, Panu Silvasti, Seppo Sippu, Eljas Soisalon-Soininen:
Online Dictionary Matching with Variable-Length Gaps. SEA 2011: 76-87 - 2010
- [j35]Panu Silvasti, Seppo Sippu, Eljas Soisalon-Soininen:
Evaluating Linear XPath Expressions by Pattern-Matching Automata. J. Univers. Comput. Sci. 16(5): 833-851 (2010) - [c50]Panu Silvasti, Seppo Sippu, Eljas Soisalon-Soininen:
Online Dictionary Matching for Streams of XML Documents. IFIP TCS 2010: 153-164
2000 – 2009
- 2009
- [c49]Panu Silvasti, Seppo Sippu, Eljas Soisalon-Soininen:
Schema-conscious filtering of XML documents. EDBT 2009: 970-981 - [c48]Tuukka Haapasalo, Ibrahim Jaluta, Bernhard Seeger, Seppo Sippu, Eljas Soisalon-Soininen:
Transactions on the multiversion B+-tree. EDBT 2009: 1064-1075 - [c47]Tuukka Haapasalo, Seppo Sippu, Ibrahim Jaluta, Eljas Soisalon-Soininen:
Concurrent updating transactions on versioned data. IDEAS 2009: 77-87 - [c46]Panu Silvasti, Seppo Sippu, Eljas Soisalon-Soininen:
Processing Schema-Optimized XPath Filters by Deterministic Automata. SEDE 2009: 55-60 - [c45]Riku Saikkonen, Eljas Soisalon-Soininen:
Bulk-Insertion Sort: Towards Composite Measures of Presortedness. SEA 2009: 269-280 - 2008
- [j34]Panu Silvasti, Seppo Sippu, Eljas Soisalon-Soininen:
XML-document-filtering automaton. Proc. VLDB Endow. 1(2): 1666-1671 (2008) - [c44]Tuukka K. Haapasalo, Ibrahim Jaluta, Seppo Sippu, Eljas Soisalon-Soininen:
Concurrency control and recovery for multiversion database structures. PIKM 2008: 73-80 - [c43]Riku Saikkonen, Eljas Soisalon-Soininen:
Cache-sensitive Memory Layout for Binary Trees. IFIP TCS 2008: 241-255 - 2007
- [c42]Sami El-Mahgary, Eljas Soisalon-Soininen:
A Two-Phased Visual Query Interface for Relational Databases. DEXA 2007: 489-498 - [c41]Timo Lilja, Riku Saikkonen, Seppo Sippu, Eljas Soisalon-Soininen:
Online Bulk Deletion. ICDE 2007: 956-965 - 2006
- [j33]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
- [j32]Ibrahim Jaluta, Seppo Sippu, Eljas Soisalon-Soininen:
Concurrency control and recovery for balanced B-link trees. VLDB J. 14(2): 257-277 (2005) - 2004
- [c40]Kerttu Pollari-Malmi, Eljas Soisalon-Soininen:
Concurrency Control and I/O-Optimality in Bulk Insertion.. SPIRE 2004: 161-170 - [c39]Eljas Soisalon-Soininen, Tatu Ylönen:
On Classification of Strings. SPIRE 2004: 321-330 - 2003
- [j31]Konrad Schlude, Eljas Soisalon-Soininen, Peter Widmayer:
Distributed Search Trees: Fault Tolerance in an Asynchronous Environment. Theory Comput. Syst. 36(6): 611-629 (2003) - [c38]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 - 2002
- [c37]Konrad Schlude, Eljas Soisalon-Soininen, Peter Widmayer:
Distributed Highly Available Search Trees. SIROCCO 2002: 259-274 - [c36]Eljas Soisalon-Soininen, Peter Widmayer:
Amortized Complexity of Bulk Updates in AVL-Trees. SWAT 2002: 439-448 - 2001
- [j30]Kim S. Larsen, Thomas Ottmann, Eljas Soisalon-Soininen:
Relaxed balance for search trees with local rebalancing. Acta Informatica 37(10): 743-763 (2001) - [j29]Kim S. Larsen, Eljas Soisalon-Soininen, Peter Widmayer:
Relaxed Balance Using Standard Rotations. Algorithmica 31(4): 501-512 (2001) - [j28]Vesa Hirvisalo, Esko Nuutila, Eljas Soisalon-Soininen:
Transitive closure algorithm MEMTC and its performance analysis. Discret. Appl. Math. 110(1): 77-84 (2001) - [c35]Seppo Sippu, Eljas Soisalon-Soininen:
A Theory of Transactions on Recoverable Search Trees. ICDT 2001: 83-98 - 2000
- [c34]Sabine Hanke, Eljas Soisalon-Soininen:
Group Updates for Red-Black Trees. CIAC 2000: 253-262 - [c33]Kerttu Pollari-Malmi, Jarmo Ruuth, Eljas Soisalon-Soininen:
Concurrency Control for B-Trees with Differential Indices. IDEAS 2000: 287-295
1990 – 1999
- 1999
- [c32]Lauri Malmi, Eljas Soisalon-Soininen:
Group Updates for Relaxed Height-Balanced Trees. PODS 1999: 358-367 - [c31]Eljas Soisalon-Soininen, Peter Widmayer:
Concurrency and Recovery in Full-Text Indexing. SPIRE/CRIWG 1999: 192-198 - 1997
- [c30]Eljas Soisalon-Soininen, Peter Widmayer:
Relaxed Balancing in Search Trees. Advances in Algorithms, Languages, and Complexity 1997: 267-283 - [c29]Sabine Hanke, Thomas Ottmann, Eljas Soisalon-Soininen:
Relaxed Balanced Red-Black Trees. CIAC 1997: 193-204 - [c28]Kim S. Larsen, Thomas Ottmann, Eljas Soisalon-Soininen:
Relaxed Balance for Search Trees with Local Rebalancing. ESA 1997: 350-363 - [c27]Kim S. Larsen, Eljas Soisalon-Soininen, Peter Widmayer:
Relaxed Balance through Standard Rotations. WADS 1997: 450-461 - 1996
- [j27]Otto Nurmi, Eljas Soisalon-Soininen:
Chromatic Binary Search Trees. A Structure for Concurrent Rebalancing. Acta Informatica 33(6): 547-557 (1996) - [j26]Otto Nurmi, Eljas Soisalon-Soininen, Derick Wood:
Relaxed avl trees, main-memory databases and concurrency. Int. J. Comput. Math. 62(1-2): 23-44 (1996) - [j25]Seppo Sippu, Eljas Soisalon-Soininen:
An Analysis of Magic Sets and Related Optimization Strategies for Logic Queries. J. ACM 43(6): 1046-1088 (1996) - [j24]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) - 1995
- [j23]Georg Lausen, Eljas Soisalon-Soininen:
Safety by Uninterpreted Locks. Inf. Comput. 117(1): 37-49 (1995) - [c26]Eljas Soisalon-Soininen, Tatu Ylönen:
Partial Strictness in Two-Phase Locking. ICDT 1995: 139-147 - 1994
- [j22]Esko Nuutila, Eljas Soisalon-Soininen:
On Finding the Strongly Connected Components in a Directed Graph. Inf. Process. Lett. 49(1): 9-14 (1994) - [c25]Seppo Sippu, Eljas Soisalon-Soininen:
Avoiding Redundant Computations in Evaluating Linear Queries. Australasian Database Conference 1994: 124-135 - 1991
- [j21]Gösta Grahne, Seppo Sippu, Eljas Soisalon-Soininen:
Efficient Evaluation for a Subset of Recursive Queries. J. Log. Program. 10(3&4): 301-332 (1991) - [c24]Otto Nurmi, Eljas Soisalon-Soininen:
Uncoupling Updating and Rebalancing in Chromatic Binary Search Trees. PODS 1991: 192-198 - 1990
- [b2]Seppo Sippu, Eljas Soisalon-Soininen:
Parsing Theory - Volume II: LR(k) and LL(k) Parsing. EATCS Monographs on Theoretical Computer Science 20, Springer 1990, ISBN 978-3-642-08079-1, pp. I-IX, 1-427 - [j20]Georg Lausen, Eljas Soisalon-Soininen, Peter Widmayer:
On the Power of Safe Locking. J. Comput. Syst. Sci. 40(2): 269-288 (1990) - [c23]Seppo Sippu, Eljas Soisalon-Soininen:
Multiple SIP Strategies and Bottom-Up Adorning in Logic Query Optimization. ICDT 1990: 485-498 - [c22]Juhani Kuittinen, Otto Nurmi, Seppo Sippu, Eljas Soisalon-Soininen:
Efficient Implementation of Loops in Bottom-Up Evaluation of Logic Queries. VLDB 1990: 372-379
1980 – 1989
- 1989
- [c21]Georg Lausen, Eljas Soisalon-Soininen:
Locling Policies and Predeclared Transactions. MFDBS 1989: 317-336 - 1988
- [b1]Seppo Sippu, Eljas Soisalon-Soininen:
Parsing Theory - Volume I: Languages and Parsing. EATCS Monographs on Theoretical Computer Science 15, Springer 1988, ISBN 978-3-642-64801-4, pp. I-VIII, 1-228 - [j19]Eljas Soisalon-Soininen, Jorma Tarhio:
Looping LR Parsers. Inf. Process. Lett. 26(5): 251-253 (1988) - [c20]Seppo Sippu, Eljas Soisalon-Soininen:
An Optimization Strategy for Recursive Queries in Logic Databases. ICDE 1988: 470-477 - [c19]Seppo Sippu, Eljas Soisalon-Soininen:
A Generalized Transitive Closure for Relational Queries. PODS 1988: 325-332 - 1987
- [j18]Thomas Ottmann, Eljas Soisalon-Soininen, Derick Wood:
Partitioning and separating sets of orthogonal polygons. Inf. Sci. 42(1): 31-49 (1987) - [c18]Otto Nurmi, Eljas Soisalon-Soininen, Derick Wood:
Concurrency Control in Database Structures with Relaxed Balance. PODS 1987: 170-176 - [c17]Gösta Grahne, Seppo Sippu, Eljas Soisalon-Soininen:
Efficient Evaluation for a Subset of Recursive Queries. PODS 1987: 284-293 - 1986
- [j17]Georg Lausen, Eljas Soisalon-Soininen, Peter Widmayer:
Pre-analysis Locking. Inf. Control. 70(2/3): 193-215 (1986) - [j16]Ivan Stojmenovic, Eljas Soisalon-Soininen:
A Note on Approximate Convex Hulls. Inf. Process. Lett. 22(2): 55-56 (1986) - [c16]Georg Lausen, Eljas Soisalon-Soininen, Peter Widmayer:
Towards Online Schedulers Based on Pre-Analysis Locking. ICDT 1986: 242-259 - 1985
- [c15]Seppo Sippu, Eljas Soisalon-Soininen:
On the Use of Relational Expressions in the Design of Efficient Algorithms (Extended Abstract). ICALP 1985: 456-464 - [c14]Georg Lausen, Eljas Soisalon-Soininen, Peter Widmayer:
Pre-Analysis Locking: A Safe and Deadlock Free Locking Policy. VLDB 1985: 270-281 - 1984
- [j15]Eljas Soisalon-Soininen, Peter Widmayer:
On the Complexity of Concurrency Control by Locking in Distributed Database Systems. Inf. Control. 60(1-3): 103-108 (1984) - [j14]Thomas Ottmann, Eljas Soisalon-Soininen, Derick Wood:
On the Definition and Computation of Rectlinear Convex Hulls. Inf. Sci. 33: 157-171 (1984) - [j13]Eljas Soisalon-Soininen, Derick Wood:
Optimal Algorithms to Compute the Closure of a Set of Iso-Rectangles. J. Algorithms 5(2): 199-214 (1984) - [c13]Bernard Chazelle, Thomas Ottmann, Eljas Soisalon-Soininen, Derick Wood:
The Complexity and Decidability of Separation. ICALP 1984: 119-127 - [c12]Georg Lausen, Eljas Soisalon-Soininen, Peter Widmayer:
Maximal Concurrency by Locking. PODS 1984: 38-44 - 1983
- [j12]Eljas Soisalon-Soininen:
On Computing Approximate Convex Hulls. Inf. Process. Lett. 16(3): 121-126 (1983) - [j11]Seppo Sippu, Eljas Soisalon-Soininen, Esko Ukkonen:
The Complexity of LALR(k) Testing. J. ACM 30(2): 259-270 (1983) - [j10]Seppo Sippu, Eljas Soisalon-Soininen:
On the Complexity of LL(k) Testing. J. Comput. Syst. Sci. 26(2): 244-268 (1983) - [j9]Seppo Sippu, Eljas Soisalon-Soininen:
A Syntax-Error-Handling Technique and Its Experimental Analysis. ACM Trans. Program. Lang. Syst. 5(4): 656-679 (1983) - 1982
- [j8]Eljas Soisalon-Soininen, Derick Wood:
On a Covering Relation for Context-Free Grammars. Acta Informatica 17: 435-449 (1982) - [j7]Eljas Soisalon-Soininen:
Translations on a Subclass of LR(k) Grammars. BIT 22(3): 303-312 (1982) - [j6]Seppo Sippu, Eljas Soisalon-Soininen:
On LL(k) Parsing. Inf. Control. 53(3): 141-164 (1982) - [j5]Eljas Soisalon-Soininen:
Inessential Error Entries and Their Use in LR Parser Optimization. ACM Trans. Program. Lang. Syst. 4(2): 179-195 (1982) - [c11]Eljas Soisalon-Soininen, Derick Wood:
An Optimal Algorithm for Testing for Safety and Detecting Deadlocks in Locked Transaction Systems. PODS 1982: 108-116 - [c10]Seppo Sippu, Eljas Soisalon-Soininen:
Practical Error Recovery in LR Parsing. POPL 1982: 177-184 - 1981
- [c9]Seppo Sippu, Eljas Soisalon-Soininen:
On LALR(1) Testing. ICALP 1981: 208-217 - [c8]Eljas Soisalon-Soininen, Derick Wood:
On Structural Similarity of Context-Free Grammars. MFCS 1981: 491-498 - [c7]Esko Ukkonen, Eljas Soisalon-Soininen:
LALR(k) Testing is PSPACE-Complete. STOC 1981: 202-206 - 1980
- [j4]Eljas Soisalon-Soininen:
On the Space Optimizing Effect of Eliminating Single Productions from LR Parsers. Acta Informatica 14: 157-174 (1980) - [j3]Eljas Soisalon-Soininen:
On Comparing LL(k) and LR(k) Grammars. Math. Syst. Theory 13: 323-329 (1980) - [c6]Seppo Sippu, Eljas Soisalon-Soininen:
Characterizations of the LL(k) Property. ICALP 1980: 596-608
1970 – 1979
- 1979
- [j2]Eljas Soisalon-Soininen, Esko Ukkonen:
A Method for Transforming Grammars into LL(k) Form. Acta Informatica 12: 339-369 (1979) - [j1]Eljas Soisalon-Soininen:
On the Covering Problem for Left-Recursive Grammars. Theor. Comput. Sci. 8: 1-11 (1979) - [c5]Seppo Sippu, Eljas Soisalon-Soininen:
Con Constructing LL(k) Parsers. ICALP 1979: 585-595 - [c4]Anton Nijholt, Eljas Soisalon-Soininen:
Ch(k) Grammars: A Characterization of LL(k) Languages. MFCS 1979: 390-397 - 1977
- [c3]Seppo Sippu, Eljas Soisalon-Soininen:
On Defining Error Recovery in Context-Free Parsing. ICALP 1977: 492-503 - [c2]Eljas Soisalon-Soininen:
Elimination of Single Productions from LR Parsers in Conjunction with the Use of Default Reductions. POPL 1977: 183-193 - 1976
- [c1]Eljas Soisalon-Soininen, Esko Ukkonen:
A Characterization of LL(k) Languages. ICALP 1976: 20-30
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-09-21 23:40 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
