Pekka Kilpeläinen

According to our database1, Pekka Kilpeläinen authored at least 25 papers between 1990 and 2023.

Collaborative distances:

Timeline

1990
1995
2000
2005
2010
2015
2020
0
1
2
3
4
1
1
2
1
2
1
1
2
1
1
1
1
1
1
1
1
1
2
1
1
1

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023

2016
Practically efficient array initialization.
Softw. Pract. Exp., 2016

2012
Using XQuery for problem solving.
Softw. Pract. Exp., 2012

2011
Checking determinism of XML Schema content models in optimal time.
Inf. Syst., 2011

Inclusion of Unambiguous RE#s is NP-Hard
CoRR, 2011

2010
Do all roads lead to Rome? (<i>Or</i> reductions for dummy travelers).
Comput. Sci. Educ., 2010

Wireless Sensor Networks for infrastructure and industrial monitoring applications.
Proceedings of the International Conference on Information and Communication Technology Convergence, 2010

2007
Efficient implementation of Aho-Corasick pattern matching automata using Unicode.
Softw. Pract. Exp., 2007

One-unambiguity of regular expressions with numeric occurrence indicators.
Inf. Comput., 2007

2004
Towards efficient implementation of XML schema content models.
Proceedings of the 2004 ACM Symposium on Document Engineering, 2004

2003
Regular Expressions with Numerical Occurrence Indicators - preliminary results.
Proceedings of the Eighth Symposium on Programming Languages and Software Tools, 2003

2001
SGML and XML Document Grammars and Exceptions.
Inf. Comput., 2001

1999
SGML & XML Content Models.
Markup Lang., 1999

1998
Design and Implementation of a Document Assembly Workbench.
Proceedings of the Electronic Publishing, 1998

1997
Assembling Documents from Digital Libraries.
Proceedings of the Database and Expert Systems Applications, 8th International Conference, 1997

1996
SGML and Exceptions.
Proceedings of the Principles of Document Processing, Third International Workshop, 1996

1995
Ordered and Unordered Tree Inclusion.
SIAM J. Comput., 1995

Recognizing Renamable Generalized Propositional Horn Formulas Is NP-complete.
Discret. Appl. Math., 1995

MDL learning of unions of simple pattern languages from positive examples.
Proceedings of the Computational Learning Theory, Second European Conference, 1995

1994
Query Primitives for Tree-Structured Data.
Proceedings of the Combinatorial Pattern Matching, 5th Annual Symposium, 1994

Text / Relational Database Management Systems: Harmonizing SQL and SGML.
Proceedings of the Applications of Databases, First International Conference, 1994

1993
Retrieval from Hierarchical Texts by Partial Patterns.
Proceedings of the 16th Annual International ACM-SIGIR Conference on Research and Development in Information Retrieval. Pittsburgh, PA, USA, June 27, 1993

1992
Grammatical Tree Matching.
Proceedings of the Combinatorial Pattern Matching, Third Annual Symposium, 1992

1991
The Tree Inclusion Problem.
Proceedings of the TAPSOFT'91: Proceedings of the International Joint Conference on Theory and Practice of Software Development, 1991

1990
Generation of test cases for simple prolog programs.
Acta Cybern., 1990


  Loading...