#### Filter Results:

- Full text PDF available (17)

#### Publication Year

2009

2018

- This year (4)
- Last 5 years (23)
- Last 10 years (29)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

- Janne H. Korhonen, Petri MartinmÃ¤ki, Cinzia Pizzi, Pasi Rastas, Esko Ukkonen
- Bioinformatics
- 2009

UNLABELLED
MOODS (MOtif Occurrence Detection Suite) is a software package for matching position weight matrices against DNA sequences. MOODS implements state-of-the-art online matching algorithms,â€¦ (More)

- Janne H. Korhonen, Pekka Parviainen
- AISTATS
- 2013

Inference in Bayesian networks is known to be NP-hard, but if the network has bounded treewidth, then inference becomes tractable. Not surprisingly, learning networks that closely match the givenâ€¦ (More)

- Keren Censor-Hillel, Petteri Kaski, Janne H. Korhonen, Christoph Lenzen, Ami Paz, Jukka Suomela
- Distributed Computing
- 2016

In this work, we use algebraic methods for studying distance computation and subgraph detection tasks in the congested clique model. Specifically, we adapt parallel matrix multiplicationâ€¦ (More)

- Danny Dolev, Janne H. Korhonen, Christoph Lenzen, Joel Rybicki, Jukka Suomela
- J. Comput. Syst. Sci.
- 2016

- Petteri Kaski, Janne H. Korhonen, Christoph Lenzen, Jukka Suomela
- ArXiv
- 2014

While algebrisation constitutes a powerful technique in the design and analysis of centralised algorithms, to date there have been hardly any applications of algebraic techniques in the context ofâ€¦ (More)

Given a Boolean function as input, a fundamental problem is to find a Boolean circuit with the least number of elementary gates (AND, OR, NOT) that computes the function. The problem generalisesâ€¦ (More)

- Janne H. Korhonen
- ArXiv
- 2016

We give a simple deterministic constant-round algorithm in the congested clique model for reducing the number of edges in a graph to n1+Îµ while preserving the minimum spanning forest, where Îµ > 0 isâ€¦ (More)

A number of recent papers â€“ e.g. Brandt et al. (STOC 2016), Chang et al. (FOCS 2016), Ghaffari & Su (SODA 2017), Brandt et al. (PODC 2017), and Chang & Pettie (FOCS 2017) â€“ have advanced ourâ€¦ (More)

- Janne H. Korhonen, Joel Rybicki
- OPODIS
- 2017

We present simple deterministic algorithms for subgraph finding and enumeration in the broadcast CONGEST model of distributed computation: For any constant k, detecting k-paths and trees on k nodesâ€¦ (More)

- Janne H. Korhonen, Jukka Suomela
- DISC
- 2017

The congested clique model of distributed computing has been receiving attention as a model for densely connected distributed systems. While there has been significant progress on the side of upperâ€¦ (More)