| 2011 |
|---|
| 20 | Inclusion of Unambiguous RE#s is NP-Hard. Pekka Kilpeläinen. CoRR (abs/1111.0422) (2011). Web SearchBibTeXDownload |
| 19 | Checking determinism of XML Schema content models in optimal time. Pekka Kilpeläinen. Inf. Syst. (36): 596-617 (2011). Web SearchBibTeXDownload |
| 2007 |
|---|
| 18 | One-unambiguity of regular expressions with numeric occurrence indicators. Pekka Kilpeläinen, Rauno Tuhkanen. Inf. Comput. (205): 890-916 (2007). Web SearchBibTeXDownload |
| 17 | Efficient implementation of Aho-Corasick pattern matching automata using Unicode. Janne Nieminen, Pekka Kilpeläinen. Softw., Pract. Exper. (37): 669-690 (2007). Web SearchBibTeXDownload |
| 2004 |
|---|
| 16 | Towards efficient implementation of XML schema content models. Pekka Kilpeläinen, Rauno Tuhkanen. ACM Symposium on Document Engineering 2004, 239-241. Web SearchBibTeXDownload |
| 2003 |
|---|
| 15 | Regular Expressions with Numerical Occurrence Indicators - preliminary results. Pekka Kilpeläinen, Rauno Tuhkanen. SPLST 2003, 163-173. Web SearchBibTeX |
| 2001 |
|---|
| 14 | SGML and XML Document Grammars and Exceptions. Pekka Kilpeläinen, Derick Wood. Inf. Comput. (169): 230-251 (2001). Web SearchBibTeXDownload |
| 1999 |
|---|
| 13 | SGML & XML Content Models. Pekka Kilpeläinen. Markup Languages (1): 53-76 (1999). Web SearchBibTeX |
| 1998 |
|---|
| 12 | Design and Implementation of a Document Assembly Workbench. Helena Ahonen, Barbara Heikkinen, Oskari Heinonen, Jani Jaakkola, Pekka Kilpeläinen, Greger Lindén. EP 1998, 476-486. Web SearchBibTeXDownload |
| 1997 |
|---|
| 11 | Assembling Documents from Digital Libraries. Helena Ahonen, Barbara Heikkinen, Oskari Heinonen, Pekka Kilpeläinen. DEXA 1997, 419-429. Web SearchBibTeXDownload |
| 1996 |
|---|
| 10 | SGML and Exceptions. Pekka Kilpeläinen, Derick Wood. PODP 1996, 39-49. Web SearchBibTeXDownload |
| 1995 |
|---|
| 9 | Recognizing Renamable Generalized Propositional Horn Formulas Is NP-complete. Thomas Eiter, Pekka Kilpeläinen, Heikki Mannila. Discrete Applied Mathematics (59): 23-31 (1995). Cited by 7Web SearchBibTeXDownload |
| 8 | MDL learning of unions of simple pattern languages from positive examples. Pekka Kilpeläinen, Heikki Mannila, Esko Ukkonen. EuroCOLT 1995, 252-260. Cited by 24Web SearchBibTeXDownload |
| 7 | Ordered and Unordered Tree Inclusion. Pekka Kilpeläinen, Heikki Mannila. SIAM J. Comput. (24): 340-356 (1995). Cited by 129Web SearchBibTeXDownload |
| 1994 |
|---|
| 6 | Text / Relational Database Management Systems: Harmonizing SQL and SGML. G. Elizabeth Blake, Mariano P. Consens, Pekka Kilpeläinen, Per-Åke Larson, T. Snider, Frank Wm. Tompa. ADB 1994, 267-280. Cited by 70Web SearchBibTeXDownload |
| 5 | Query Primitives for Tree-Structured Data. Pekka Kilpeläinen, Heikki Mannila. CPM 1994, 213-225. Cited by 13Web SearchBibTeXDownload |
| 1993 |
|---|
| 4 | Retrieval from Hierarchical Texts by Partial Patterns. Pekka Kilpeläinen, Heikki Mannila. SIGIR 1993, 214-222. Cited by 82Web SearchBibTeX |
| 1992 |
|---|
| 3 | Grammatical Tree Matching. Pekka Kilpeläinen, Heikki Mannila. CPM 1992, 162-174. Cited by 18Web SearchBibTeXDownload |
| 1991 |
|---|
| 2 | The Tree Inclusion Problem. Pekka Kilpeläinen, Heikki Mannila. TAPSOFT, Vol.1 1991, 202-214. Cited by 21Web SearchBibTeXDownload |
| 1990 |
|---|
| 1 | Generation of test cases for simple prolog programs. Pekka Kilpeläinen, Heikki Mannila. Acta Cybern. (9): 235-246 (1990). Cited by 2Web SearchBibTeX |
