Eljas Soisalon-Soininen

According to our database1, Eljas Soisalon-Soininen
  • authored at least 96 papers between 1976 and 2016.
  • has a "Dijkstra number"2 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2016
Cache-Sensitive Memory Layout for Dynamic Binary Trees.
Comput. J., 2016

Location-based Automated Process Modelling.
Proceedings of the 6th International Symposium on Data-driven Process Discovery and Analysis (SIMPDA 2016), 2016

Message from the ICDE 2016 Program Committee and general chairs.
Proceedings of the 32nd IEEE International Conference on Data Engineering, 2016

2015
A form-based query interface for complex queries.
J. Vis. Lang. Comput., 2015

Experimental Analysis of an Online Dictionary Matching Algorithm for Regular Expressions with Gaps.
Proceedings of the Experimental Algorithms - 14th International Symposium, 2015

2014
Transaction Processing - Management of the Logical Database and its Underlying Physical Structure
Data-Centric Systems and Applications, Springer, ISBN: 978-3-319-12292-2, 2014

2013
On the Recovery of R-Trees.
IEEE Trans. Knowl. Data Eng., 2013

Online Matching of Multiple Regular Patterns with Gaps and Character Classes.
Proceedings of the Language and Automata Theory and Applications, 2013

2012
A General Method for Improving Insertion-Based Adaptive Sorting.
Proceedings of the Algorithms and Computation - 23rd International Symposium, 2012

2011
Online Dictionary Matching with Variable-Length Gaps.
Proceedings of the Experimental Algorithms - 10th International Symposium, 2011

2010
Evaluating Linear XPath Expressions by Pattern-Matching Automata.
J. UCS, 2010

Online Dictionary Matching for Streams of XML Documents.
Proceedings of the Theoretical Computer Science, 2010

2009
Bulk-Insertion Sort: Towards Composite Measures of Presortedness.
Proceedings of the Experimental Algorithms, 8th International Symposium, 2009

Processing Schema-Optimized XPath Filters by Deterministic Automata.
Proceedings of the 18th International Conference on Software Engineering and Data Engineering (SEDE-2009), 2009

Concurrent updating transactions on versioned data.
Proceedings of the International Database Engineering and Applications Symposium (IDEAS 2009), 2009

Schema-conscious filtering of XML documents.
Proceedings of the EDBT 2009, 2009

Transactions on the multiversion B+-tree.
Proceedings of the EDBT 2009, 2009

2008
XML-document-filtering automaton.
PVLDB, 2008

Cache-sensitive Memory Layout for Binary Trees.
Proceedings of the Fifth IFIP International Conference On Theoretical Computer Science, 2008

Concurrency control and recovery for multiversion database structures.
Proceedings of the Second Ph.D. Workshop in CIKM, 2008

2007
Online Bulk Deletion.
Proceedings of the 23rd International Conference on Data Engineering, 2007

A Two-Phased Visual Query Interface for Relational Databases.
Proceedings of the Database and Expert Systems Applications, 18th International Conference, 2007

2006
B-tree concurrency control and recovery in page-server database systems.
ACM Trans. Database Syst., 2006

2005
Concurrency control and recovery for balanced B-link trees.
VLDB J., 2005

2004
On Classification of Strings.
Proceedings of the String Processing and Information Retrieval, 2004

Concurrency Control and I/O-Optimality in Bulk Insertion..
Proceedings of the String Processing and Information Retrieval, 2004

2003
Distributed Search Trees: Fault Tolerance in an Asynchronous Environment.
Theory Comput. Syst., 2003

Single and Bulk Updates in Stratified Trees: An Amortized and Worst-Case Analysis.
Proceedings of the Computer Science in Perspective, Essays Dedicated to Thomas Ottmann, 2003

2002
Amortized Complexity of Bulk Updates in AVL-Trees.
Proceedings of the Algorithm Theory, 2002

Distributed Highly Available Search Trees.
Proceedings of the SIROCCO 9, 2002

2001
Transitive closure algorithm MEMTC and its performance analysis.
Discrete Applied Mathematics, 2001

Relaxed Balance Using Standard Rotations.
Algorithmica, 2001

Relaxed balance for search trees with local rebalancing.
Acta Inf., 2001

A Theory of Transactions on Recoverable Search Trees.
Proceedings of the Database Theory, 2001

2000
Concurrency Control for B-Trees with Differential Indices.
Proceedings of the 2000 International Database Engineering and Applications Symposium, 2000

Group Updates for Red-Black Trees.
Proceedings of the Algorithms and Complexity, 4th Italian Conference, 2000

1999
Concurrency and Recovery in Full-Text Indexing.
Proceedings of the Sixth International Symposium on String Processing and Information Retrieval and Fifth International Workshop on Groupware, 1999

Group Updates for Relaxed Height-Balanced Trees.
Proceedings of the Eighteenth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, May 31, 1999

1997
Relaxed Balance through Standard Rotations.
Proceedings of the Algorithms and Data Structures, 5th International Workshop, 1997

Relaxed Balance for Search Trees with Local Rebalancing.
Proceedings of the Algorithms, 1997

Relaxed Balanced Red-Black Trees.
Proceedings of the Algorithms and Complexity, Third Italian Conference, 1997

Relaxed Balancing in Search Trees.
Proceedings of the Advances in Algorithms, Languages, and Complexity, 1997

1996
Concurrency Control in B-Trees with Batch Updates.
IEEE Trans. Knowl. Data Eng., 1996

An Analysis of Magic Sets and Related Optimization Strategies for Logic Queries.
J. ACM, 1996

Chromatic Binary Search Trees. A Structure for Concurrent Rebalancing.
Acta Inf., 1996

1995
Safety by Uninterpreted Locks
Inf. Comput., February, 1995

Partial Strictness in Two-Phase Locking.
Proceedings of the Database Theory, 1995

1994
On Finding the Strongly Connected Components in a Directed Graph.
Inf. Process. Lett., 1994

Avoiding Redundant Computations in Evaluating Linear Queries.
Proceedings of the 5th Australasian Database Conference, 1994

1991
Efficient Evaluation for a Subset of Recursive Queries.
J. Log. Program., 1991

Uncoupling Updating and Rebalancing in Chromatic Binary Search Trees.
Proceedings of the Tenth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, 1991

1990
Parsing Theory - Volume II: LR(k) and LL(k) Parsing
EATCS Monographs on Theoretical Computer Science 20, Springer, ISBN: 978-3-662-08424-3, 1990

On the Power of Safe Locking.
J. Comput. Syst. Sci., 1990

Efficient Implementation of Loops in Bottom-Up Evaluation of Logic Queries.
Proceedings of the 16th International Conference on Very Large Data Bases, 1990

Multiple SIP Strategies and Bottom-Up Adorning in Logic Query Optimization.
Proceedings of the ICDT'90, 1990

1989
Locling Policies and Predeclared Transactions.
Proceedings of the MFDBS 89, 1989

1988
Parsing Theory - Volume I: Languages and Parsing
EATCS Monographs on Theoretical Computer Science 15, Springer, ISBN: 0-387-13720-3, 1988

Looping LR Parsers.
Inf. Process. Lett., 1988

A Generalized Transitive Closure for Relational Queries.
Proceedings of the Seventh ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, 1988

An Optimization Strategy for Recursive Queries in Logic Databases.
Proceedings of the Fourth International Conference on Data Engineering, 1988

1987
Partitioning and separating sets of orthogonal polygons.
Inf. Sci., 1987

Concurrency Control in Database Structures with Relaxed Balance.
Proceedings of the Sixth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, 1987

Efficient Evaluation for a Subset of Recursive Queries.
Proceedings of the Sixth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, 1987

1986
A Note on Approximate Convex Hulls.
Inf. Process. Lett., 1986

Pre-analysis Locking
Information and Control, 1986

Towards Online Schedulers Based on Pre-Analysis Locking.
Proceedings of the ICDT'86, 1986

1985
Pre-Analysis Locking: A Safe and Deadlock Free Locking Policy.
Proceedings of the VLDB'85, 1985

On the Use of Relational Expressions in the Design of Efficient Algorithms (Extended Abstract).
Proceedings of the Automata, 1985

1984
Optimal Algorithms to Compute the Closure of a Set of Iso-Rectangles.
J. Algorithms, 1984

On the Definition and Computation of Rectlinear Convex Hulls.
Inf. Sci., 1984

On the Complexity of Concurrency Control by Locking in Distributed Database Systems
Information and Control, 1984

Maximal Concurrency by Locking.
Proceedings of the Third ACM SIGACT-SIGMOD Symposium on Principles of Database Systems, 1984

The Complexity and Decidability of Separation.
Proceedings of the Automata, 1984

1983
The Complexity of LALR(k) Testing
J. ACM, April, 1983

A Syntax-Error-Handling Technique and Its Experimental Analysis.
ACM Trans. Program. Lang. Syst., 1983

On the Complexity of LL(k) Testing.
J. Comput. Syst. Sci., 1983

On Computing Approximate Convex Hulls.
Inf. Process. Lett., 1983

1982
On LL(k) Parsing
Information and Control, June, 1982

Inessential Error Entries and Their Use in LR Parser Optimization.
ACM Trans. Program. Lang. Syst., 1982

Translations on a Subclass of LR(k) Grammars.
BIT, 1982

On a Covering Relation for Context-Free Grammars.
Acta Inf., 1982

Practical Error Recovery in LR Parsing.
Proceedings of the Conference Record of the Ninth Annual ACM Symposium on Principles of Programming Languages, 1982

An Optimal Algorithm for Testing for Safety and Detecting Deadlocks in Locked Transaction Systems.
Proceedings of the ACM Symposium on Principles of Database Systems, 1982

1981
LALR(k) Testing is PSPACE-Complete
Proceedings of the 13th Annual ACM Symposium on Theory of Computing, 1981

On Structural Similarity of Context-Free Grammars.
Proceedings of the Mathematical Foundations of Computer Science 1981, Strbske Pleso, Czechoslovakia, August 31, 1981

On LALR(1) Testing.
Proceedings of the Automata, 1981

1980
On Comparing LL(k) and LR(k) Grammars.
Mathematical Systems Theory, 1980

On the Space Optimizing Effect of Eliminating Single Productions from LR Parsers.
Acta Inf., 1980

Characterizations of the LL(k) Property.
Proceedings of the Automata, 1980

1979
On the Covering Problem for Left-Recursive Grammars.
Theor. Comput. Sci., 1979

A Method for Transforming Grammars into LL(k) Form.
Acta Inf., 1979

Ch(k) Grammars: A Characterization of LL(k) Languages.
Proceedings of the Mathematical Foundations of Computer Science 1979, 1979

Con Constructing LL(k) Parsers.
Proceedings of the Automata, 1979

1977
Elimination of Single Productions from LR Parsers in Conjunction with the Use of Default Reductions.
Proceedings of the Conference Record of the Fourth ACM Symposium on Principles of Programming Languages, 1977

On Defining Error Recovery in Context-Free Parsing.
Proceedings of the Automata, 1977

1976
A Characterization of LL(k) Languages.
ICALP, 1976


  Loading...