Eljas Soisalon-Soininen

Pekka Orponen

Petri Rönnholm

Hannu Hyyppä

J. Intell. Inf. Syst., June, 2023

2017

Extracting Service Process Models with Teams.

[BibT_eX]

[DOI]

Proceedings of the 7th International Symposium on Data-driven Process Discovery and Analysis (SIMPDA 2017), 2017

2016

Cache-Sensitive Memory Layout for Dynamic Binary Trees.

[BibT_eX]

[DOI]

Comput. J., 2016

Extracting Service Process Models from Location Data.

[BibT_eX]

[DOI]

Ye Zhang

Olli Martikainen

Proceedings of the Data-Driven Process Discovery and Analysis, 2016

Location-based Automated Process Modelling.

[BibT_eX]

[DOI]

Ye Zhang

Olli Martikainen

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.

[BibT_eX]

[DOI]

Proceedings of the 32nd IEEE International Conference on Data Engineering, 2016

2015

A form-based query interface for complex queries.

[BibT_eX]

[DOI]

Sami El-Mahgary

J. Vis. Lang. Comput., 2015

Experimental Analysis of an Online Dictionary Matching Algorithm for Regular Expressions with Gaps.

[BibT_eX]

[DOI]

Proceedings of the Experimental Algorithms - 14th International Symposium, 2015

2014

Transaction Processing - Management of the Logical Database and its Underlying Physical Structure

[BibT_eX]

[DOI]

Data-Centric Systems and Applications, Springer, ISBN: 978-3-319-12292-2, 2014

2013

On the Recovery of R-Trees.

[BibT_eX]

[DOI]

Tuukka Haapasalo

IEEE Trans. Knowl. Data Eng., 2013

Online Matching of Multiple Regular Patterns with Gaps and Character Classes.

[BibT_eX]

[DOI]

Proceedings of the Language and Automata Theory and Applications, 2013

2012

A General Method for Improving Insertion-Based Adaptive Sorting.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation - 23rd International Symposium, 2012

2011

Online Dictionary Matching with Variable-Length Gaps.

[BibT_eX]

[DOI]

Tuukka Haapasalo

Proceedings of the Experimental Algorithms - 10th International Symposium, 2011

2010

Evaluating Linear XPath Expressions by Pattern-Matching Automata.

[BibT_eX]

[DOI]

J. Univers. Comput. Sci., 2010

Online Dictionary Matching for Streams of XML Documents.

[BibT_eX]

[DOI]

Proceedings of the Theoretical Computer Science, 2010

2009

Bulk-Insertion Sort: Towards Composite Measures of Presortedness.

[BibT_eX]

[DOI]

Proceedings of the Experimental Algorithms, 8th International Symposium, 2009

Processing Schema-Optimized XPath Filters by Deterministic Automata.

[BibT_eX]

Proceedings of the 18th International Conference on Software Engineering and Data Engineering (SEDE-2009), 2009

Concurrent updating transactions on versioned data.

[BibT_eX]

[DOI]

Tuukka Haapasalo

Proceedings of the International Database Engineering and Applications Symposium (IDEAS 2009), 2009

Schema-conscious filtering of XML documents.

[BibT_eX]

[DOI]

Proceedings of the EDBT 2009, 2009

Transactions on the multiversion B<sup>+</sup>-tree.

[BibT_eX]

[DOI]

Proceedings of the EDBT 2009, 2009

2008

XML-document-filtering automaton.

[BibT_eX]

[DOI]

Proc. VLDB Endow., 2008

Cache-sensitive Memory Layout for Binary Trees.

[BibT_eX]

[DOI]

Proceedings of the Fifth IFIP International Conference On Theoretical Computer Science, 2008

Concurrency control and recovery for multiversion database structures.

[BibT_eX]

[DOI]

Tuukka K. Haapasalo

Proceedings of the Second Ph.D. Workshop in CIKM, 2008

2007

Online Bulk Deletion.

[BibT_eX]

[DOI]

Timo Lilja

Proceedings of the 23rd International Conference on Data Engineering, 2007

A Two-Phased Visual Query Interface for Relational Databases.

[BibT_eX]

[DOI]

Sami El-Mahgary

Proceedings of the Database and Expert Systems Applications, 18th International Conference, 2007

2006

B-tree concurrency control and recovery in page-server database systems.

[BibT_eX]

[DOI]

ACM Trans. Database Syst., 2006

2005

Concurrency control and recovery for balanced B-link trees.

[BibT_eX]

[DOI]

VLDB J., 2005

2004

On Classification of Strings.

[BibT_eX]

[DOI]

Tatu Ylönen

Proceedings of the String Processing and Information Retrieval, 2004

Concurrency Control and I/O-Optimality in Bulk Insertion..

[BibT_eX]

[DOI]

Kerttu Pollari-Malmi

Proceedings of the String Processing and Information Retrieval, 2004

2003

Distributed Search Trees: Fault Tolerance in an Asynchronous Environment.

[BibT_eX]

[DOI]

Konrad Schlude

Theory Comput. Syst., 2003

Single and Bulk Updates in Stratified Trees: An Amortized and Worst-Case Analysis.

[BibT_eX]

[DOI]

Proceedings of the Computer Science in Perspective, Essays Dedicated to Thomas Ottmann, 2003

2002

Amortized Complexity of Bulk Updates in AVL-Trees.

[BibT_eX]

[DOI]

Proceedings of the Algorithm Theory, 2002

Distributed Highly Available Search Trees.

[BibT_eX]

Konrad Schlude

Proceedings of the SIROCCO 9, 2002

2001

Transitive closure algorithm MEMTC and its performance analysis.

[BibT_eX]

[DOI]

Vesa Hirvisalo

Esko Nuutila

Discret. Appl. Math., 2001

Relaxed Balance Using Standard Rotations.

[BibT_eX]

[DOI]

Kim S. Larsen

Algorithmica, 2001

Relaxed balance for search trees with local rebalancing.

[BibT_eX]

[DOI]

Kim S. Larsen

Acta Informatica, 2001

A Theory of Transactions on Recoverable Search Trees.

[BibT_eX]

[DOI]

Proceedings of the Database Theory, 2001

2000

Concurrency Control for B-Trees with Differential Indices.

[BibT_eX]

[DOI]

Kerttu Pollari-Malmi

Jarmo Ruuth

Proceedings of the 2000 International Database Engineering and Applications Symposium, 2000

Group Updates for Red-Black Trees.

[BibT_eX]

[DOI]

Sabine Hanke

Proceedings of the Algorithms and Complexity, 4th Italian Conference, 2000

1999

Concurrency and Recovery in Full-Text Indexing.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

Lauri Malmi

Proceedings of the Eighteenth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, May 31, 1999

1997

Relaxed Balance through Standard Rotations.

[BibT_eX]

[DOI]

Kim S. Larsen

Proceedings of the Algorithms and Data Structures, 5th International Workshop, 1997

Relaxed Balanced Red-Black Trees.

[BibT_eX]

[DOI]

Sabine Hanke

Proceedings of the Algorithms and Complexity, Third Italian Conference, 1997

Relaxed Balancing in Search Trees.

[BibT_eX]

Proceedings of the Advances in Algorithms, Languages, and Complexity, 1997

1996

Concurrency Control in B-Trees with Batch Updates.

[BibT_eX]

[DOI]

Kerttu Pollari-Malmi

Tatu Ylönen

IEEE Trans. Knowl. Data Eng., 1996

An Analysis of Magic Sets and Related Optimization Strategies for Logic Queries.

[BibT_eX]

[DOI]

J. ACM, 1996

Relaxed avl trees, main-memory databases and concurrency.

[BibT_eX]

[DOI]

Int. J. Comput. Math., 1996

Chromatic Binary Search Trees. A Structure for Concurrent Rebalancing.

[BibT_eX]

[DOI]

Acta Informatica, 1996

1995

Safety by Uninterpreted Locks

[BibT_eX]

[DOI]

Inf. Comput., February, 1995

Partial Strictness in Two-Phase Locking.

[BibT_eX]

[DOI]

Tatu Ylönen

Proceedings of the Database Theory, 1995

1994

On Finding the Strongly Connected Components in a Directed Graph.

[BibT_eX]

[DOI]

Esko Nuutila

Inf. Process. Lett., 1994

Avoiding Redundant Computations in Evaluating Linear Queries.

[BibT_eX]

Proceedings of the 5th Australasian Database Conference, 1994

1991

Efficient Evaluation for a Subset of Recursive Queries.

[BibT_eX]

[DOI]

Gösta Grahne

J. Log. Program., 1991

Uncoupling Updating and Rebalancing in Chromatic Binary Search Trees.

[BibT_eX]

[DOI]

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

[BibT_eX]

[DOI]

EATCS Monographs on Theoretical Computer Science 20, Springer, ISBN: 978-3-662-08424-3, 1990

On the Power of Safe Locking.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 1990

Efficient Implementation of Loops in Bottom-Up Evaluation of Logic Queries.

[BibT_eX]

[DOI]

Juhani Kuittinen

Proceedings of the 16th International Conference on Very Large Data Bases, 1990

Multiple SIP Strategies and Bottom-Up Adorning in Logic Query Optimization.

[BibT_eX]

[DOI]

Proceedings of the ICDT'90, 1990

1989

Locling Policies and Predeclared Transactions.

[BibT_eX]

[DOI]

Proceedings of the MFDBS 89, 1989

1988

Parsing Theory - Volume I: Languages and Parsing

[BibT_eX]

[DOI]

EATCS Monographs on Theoretical Computer Science 15, Springer, ISBN: 0-387-13720-3, 1988

Looping LR Parsers.

[BibT_eX]

[DOI]

Jorma Tarhio

Inf. Process. Lett., 1988

A Generalized Transitive Closure for Relational Queries.

[BibT_eX]

[DOI]

Proceedings of the Seventh ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, 1988

An Optimization Strategy for Recursive Queries in Logic Databases.

[BibT_eX]

[DOI]

Proceedings of the Fourth International Conference on Data Engineering, 1988

1987

Partitioning and separating sets of orthogonal polygons.

[BibT_eX]

[DOI]

Inf. Sci., 1987

Concurrency Control in Database Structures with Relaxed Balance.

[BibT_eX]

[DOI]

Proceedings of the Sixth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, 1987

1986

A Note on Approximate Convex Hulls.

[BibT_eX]

[DOI]

Ivan Stojmenovic

Inf. Process. Lett., 1986

Pre-analysis Locking

[BibT_eX]

[DOI]

Inf. Control., 1986

Towards Online Schedulers Based on Pre-Analysis Locking.

[BibT_eX]

[DOI]

Proceedings of the ICDT'86, 1986

1985

Pre-Analysis Locking: A Safe and Deadlock Free Locking Policy.

[BibT_eX]

[DOI]

Proceedings of the VLDB'85, 1985

On the Use of Relational Expressions in the Design of Efficient Algorithms (Extended Abstract).

[BibT_eX]

[DOI]

Proceedings of the Automata, 1985

1984

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

[BibT_eX]

[DOI]

J. Algorithms, 1984

On the Definition and Computation of Rectlinear Convex Hulls.

[BibT_eX]

[DOI]

Inf. Sci., 1984

On the Complexity of Concurrency Control by Locking in Distributed Database Systems

[BibT_eX]

[DOI]

Inf. Control., 1984

Maximal Concurrency by Locking.

[BibT_eX]

[DOI]

Proceedings of the Third ACM SIGACT-SIGMOD Symposium on Principles of Database Systems, 1984

The Complexity and Decidability of Separation.

[BibT_eX]

[DOI]

Bernard Chazelle

Proceedings of the Automata, 1984

1983

The Complexity of LALR(k) Testing

[BibT_eX]

[DOI]

J. ACM, April, 1983

A Syntax-Error-Handling Technique and Its Experimental Analysis.

[BibT_eX]

[DOI]

ACM Trans. Program. Lang. Syst., 1983

On the Complexity of LL(k) Testing.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 1983

On Computing Approximate Convex Hulls.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1983

1982

On LL(k) Parsing

[BibT_eX]

[DOI]

Inf. Control., June, 1982

Inessential Error Entries and Their Use in LR Parser Optimization.

[BibT_eX]

[DOI]

ACM Trans. Program. Lang. Syst., 1982

Translations on a Subclass of LR(k) Grammars.

[BibT_eX]

[DOI]

BIT, 1982

On a Covering Relation for Context-Free Grammars.

[BibT_eX]

[DOI]

Acta Informatica, 1982

Practical Error Recovery in LR Parsing.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

Proceedings of the ACM Symposium on Principles of Database Systems, 1982

1981

LALR(k) Testing is PSPACE-Complete

[BibT_eX]

[DOI]

Proceedings of the 13th Annual ACM Symposium on Theory of Computing, 1981

On Structural Similarity of Context-Free Grammars.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 1981, Strbske Pleso, Czechoslovakia, August 31, 1981

On LALR(1) Testing.

[BibT_eX]

[DOI]

Proceedings of the Automata, 1981

1980

On Comparing LL(k) and LR(k) Grammars.

[BibT_eX]

[DOI]

Math. Syst. Theory, 1980

On the Space Optimizing Effect of Eliminating Single Productions from <i> LR </i> Parsers.

[BibT_eX]

[DOI]

Acta Informatica, 1980

Characterizations of the LL(k) Property.

[BibT_eX]

[DOI]

Proceedings of the Automata, 1980

1979

On the Covering Problem for Left-Recursive Grammars.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1979

A Method for Transforming Grammars into LL(k) Form.

[BibT_eX]

[DOI]

Acta Informatica, 1979

Ch(k) Grammars: A Characterization of LL(k) Languages.

[BibT_eX]

[DOI]

Anton Nijholt

Proceedings of the Mathematical Foundations of Computer Science 1979, 1979

Con Constructing LL(k) Parsers.

[BibT_eX]

[DOI]

Proceedings of the Automata, 1979

1977

Elimination of Single Productions from LR Parsers in Conjunction with the Use of Default Reductions.

[BibT_eX]

[DOI]

Proceedings of the Conference Record of the Fourth ACM Symposium on Principles of Programming Languages, 1977

On Defining Error Recovery in Context-Free Parsing.

[BibT_eX]

[DOI]

Proceedings of the Automata, 1977

1976

A Characterization of LL(k) Languages.

[BibT_eX]