2008 |
17 | EE | Wilhelmiina Hämäläinen,
Matti Nykänen:
Efficient Discovery of Statistically Significant Association Rules.
ICDM 2008: 203-212 |
16 | EE | Satu Eloranta,
Raul Hakli,
Olli Niinivaara,
Matti Nykänen:
Accommodative Belief Revision.
JELIA 2008: 180-191 |
2006 |
15 | EE | Hellis Tamm,
Matti Nykänen,
Esko Ukkonen:
On size reduction techniques for multitape automata.
Theor. Comput. Sci. 363(2): 234-246 (2006) |
2005 |
14 | EE | Hellis Tamm,
Matti Nykänen,
Esko Ukkonen:
Size Reduction of Multitape Automata.
CIAA 2005: 307-318 |
2004 |
13 | EE | Hellis Tamm,
Matti Nykänen,
Esko Ukkonen:
Size Reduction of Multitape Automata.
CIAA 2004: 329-330 |
12 | EE | Matti Nykänen:
An incremental algorithm for DLO quantifier elimination via constraint propagation.
Artif. Intell. 160(1-2): 173-190 (2004) |
2003 |
11 | EE | Gösta Grahne,
Raul Hakli,
Matti Nykänen,
Hellis Tamm,
Esko Ukkonen:
Design and implementation of a string database query language.
Inf. Syst. 28(4): 311-337 (2003) |
2002 |
10 | EE | Matti Nykänen,
Esko Ukkonen:
The Exact Path Length Problem.
J. Algorithms 42(1): 41-53 (2002) |
2001 |
9 | EE | Matti Nykänen:
Using acceptors as transducers.
Theor. Comput. Sci. 267(1-2): 83-104 (2001) |
2000 |
8 | EE | Raul Hakli,
Matti Nykänen,
Hellis Tamm:
Adding String Processing Capabilities to Data Management Systems.
SPIRE 2000: 122-131 |
1999 |
7 | EE | Raul Hakli,
Matti Nykänen,
Hellis Tamm,
Esko Ukkonen:
Implementing a Declarative String Query Language with String Restructuring.
PADL 1999: 179-195 |
6 | EE | Matti Nykänen,
Esko Ukkonen:
Finding Paths with the Right Cost.
STACS 1999: 345-355 |
5 | | Gösta Grahne,
Matti Nykänen,
Esko Ukkonen:
Reasoning about Strings in Databases.
J. Comput. Syst. Sci. 59(1): 116-162 (1999) |
1998 |
4 | EE | Matti Nykänen:
Using Acceptors as Transducers.
Workshop on Implementing Automata 1998: 133-148 |
1997 |
3 | EE | Gösta Grahne,
Matti Nykänen:
Safety, Translation and Evaluation of Alignment Calculus.
ADBIS 1997: 295-304 |
1994 |
2 | EE | Gösta Grahne,
Matti Nykänen,
Esko Ukkonen:
Reasoning about Strings in Databases.
PODS 1994: 303-312 |
1 | | Matti Nykänen,
Esko Ukkonen:
Finding Lowest Common Ancestors in Arbitrarily Directed Trees.
Inf. Process. Lett. 50(6): 307-310 (1994) |