default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMatti Nykänen
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2016
[j11]Matti Nykänen, Raul Hakli
, Satu Eloranta, Olli Niinivaara:
How to deal with unbelievable assertions. Ann. Math. Artif. Intell. 78(3-4): 323-360 (2016)- 2015
- [j10]Jouni Pääkkönen, Niina Päivinen, Matti Nykänen, Timo Paavonen:
An automated gland segmentation and classification method in prostate biopsies: an image source-independent approach. Mach. Vis. Appl. 26(1): 103-113 (2015) - 2011
- [j9]Matti Nykänen:
A note on the genuine Sieve of Eratosthenes. J. Funct. Program. 21(6): 563-572 (2011) - [c11]Matti Nykänen, Satu Eloranta, Olli Niinivaara, Raul Hakli:
Cooperative Replies to Unbelievable Assertions - A Dialogue Protocol based on Logical Interpolation. ICAART (2) 2011: 245-250
2000 – 2009
- 2008
- [c10]Wilhelmiina Hämäläinen, Matti Nykänen:
Efficient Discovery of Statistically Significant Association Rules. ICDM 2008: 203-212 - [c9]Satu Eloranta, Raul Hakli, Olli Niinivaara, Matti Nykänen:
Accommodative Belief Revision. JELIA 2008: 180-191 - 2006
- [j8]Hellis Tamm, Matti Nykänen, Esko Ukkonen:
On size reduction techniques for multitape automata. Theor. Comput. Sci. 363(2): 234-246 (2006) - 2005
- [j7]Matti Nykänen:
Point-and-Click Logic. Informatics Educ. 4(1): 87-100 (2005) - [c8]Hellis Tamm, Matti Nykänen, Esko Ukkonen:
Size Reduction of Multitape Automata. CIAA 2005: 307-318 - 2004
- [j6]Matti Nykänen:
An incremental algorithm for DLO quantifier elimination via constraint propagation. Artif. Intell. 160(1-2): 173-190 (2004) - [c7]Hellis Tamm, Matti Nykänen, Esko Ukkonen:
Size Reduction of Multitape Automata. CIAA 2004: 329-330 - 2003
- [j5]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
- [j4]Matti Nykänen, Esko Ukkonen:
The Exact Path Length Problem. J. Algorithms 42(1): 41-53 (2002) - 2001
- [j3]Matti Nykänen:
Using acceptors as transducers. Theor. Comput. Sci. 267(1-2): 83-104 (2001) - 2000
- [c6]Raul Hakli, Matti Nykänen, Hellis Tamm:
Adding String Processing Capabilities to Data Management Systems. SPIRE 2000: 122-131
1990 – 1999
- 1999
- [j2]Gösta Grahne, Matti Nykänen, Esko Ukkonen:
Reasoning about Strings in Databases. J. Comput. Syst. Sci. 59(1): 116-162 (1999) - [c5]Raul Hakli, Matti Nykänen, Hellis Tamm, Esko Ukkonen:
Implementing a Declarative String Query Language with String Restructuring. PADL 1999: 179-195 - [c4]Matti Nykänen, Esko Ukkonen:
Finding Paths with the Right Cost. STACS 1999: 345-355 - 1998
- [c3]Matti Nykänen:
Using Acceptors as Transducers. Workshop on Implementing Automata 1998: 133-148 - 1997
- [c2]Gösta Grahne, Matti Nykänen:
Safety, Translation and Evaluation of Alignment Calculus. ADBIS 1997: 295-304 - 1994
- [j1]Matti Nykänen, Esko Ukkonen:
Finding Lowest Common Ancestors in Arbitrarily Directed Trees. Inf. Process. Lett. 50(6): 307-310 (1994) - [c1]Gösta Grahne, Matti Nykänen, Esko Ukkonen:
Reasoning about Strings in Databases. PODS 1994: 303-312
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 23:05 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
