Janne H. Korhonen
Janne H. Korhonen
Bestätigte E-Mail-Adresse bei - Startseite
Zitiert von
Zitiert von
MOODS: fast search for position weight matrix matches in DNA sequences
J Korhonen, P Martinmäki, C Pizzi, P Rastas, E Ukkonen
Bioinformatics 25 (23), 3181-3182, 2009
Algebraic methods in the congested clique
K Censor-Hillel, P Kaski, JH Korhonen, C Lenzen, A Paz, J Suomela
Distributed Computing 32 (6), 461-478, 2019
LCL problems on grids
S Brandt, J Hirvonen, JH Korhonen, T Lempiäinen, PRJ Östergård, ...
Proceedings of the ACM Symposium on Principles of Distributed Computing, 101-110, 2017
Exact Learning of Bounded Tree-width Bayesian Networks
JH Korhonen, P Parviainen
Artificial Intelligence and Statistics (AISTATS 2013), 370–378, 2013
Fast approximate shortest paths in the congested clique
K Censor-Hillel, M Dory, JH Korhonen, D Leitersdorf
Distributed Computing 34 (6), 463-487, 2021
New classes of distributed time complexity
A Balliu, J Hirvonen, JH Korhonen, T Lempiäinen, D Olivetti, J Suomela
Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing …, 2018
Bayesian network structure learning with integer programming: Polytopes, facets and complexity
J Cussens, M Järvisalo, JH Korhonen, M Bartlett
Journal of Artificial Intelligence Research 58, 185-229, 2017
Deterministic subgraph detection in broadcast CONGEST
JH Korhonen, J Rybicki
arXiv preprint arXiv:1705.10195, 2017
Towards a complexity theory for the congested clique
JH Korhonen, J Suomela
Proceedings of the 30th on Symposium on Parallelism in Algorithms and …, 2018
Synchronous counting and computational algorithm design
D Dolev, K Heljanko, M Järvisalo, JH Korhonen, C Lenzen, J Rybicki, ...
Journal of Computer and System Sciences 82 (2), 310-332, 2016
Fast motif matching revisited: high-order PWMs, SNPs and indels
JH Korhonen, K Palin, J Taipale, E Ukkonen
Bioinformatics 33 (4), 514-521, 2017
Inferring dispersal across a fragmented landscape using reconstructed families in the Glanville fritillary butterfly
T Fountain, A Husby, E Nonaka, MF DiLeo, JH Korhonen, P Rastas, ...
Evolutionary Applications 11 (3), 287-297, 2018
On the parameterized complexity of cutting a few vertices from a graph
FV Fomin, PA Golovach, JH Korhonen
International Symposium on Mathematical Foundations of Computer Science, 421-432, 2013
Brief announcement: Deterministic MST sparsification in the congested clique
JH Korhonen
Proc. of 30th International Symposium on Distributed Computing (DISC 2016), 2016
Finding efficient circuits for ensemble computation
M Järvisalo, P Kaski, M Koivisto, JH Korhonen
International Conference on Theory and Applications of Satisfiability …, 2012
Tractable Bayesian Network Structure Learning with Bounded Vertex Cover Number
JH Korhonen, P Parviainen
Neural Information Processing Systems (NIPS 2015), 2015
On the number of connected sets in bounded degree graphs
K Kangas, P Kaski, JH Korhonen, M Koivisto
The Electronic Journal of Combinatorics 25 (4), 4-34, 2018
Does preprocessing help under congestion?
KT Foerster, JH Korhonen, J Rybicki, S Schmid
Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing …, 2019
Input-dynamic distributed algorithms for communication networks
KT Foerster, JH Korhonen, A Paz, J Rybicki, S Schmid
Proceedings of the ACM on Measurement and Analysis of Computing Systems 5 (1 …, 2021
Conditional Lower Bounds for Failed Literals and Related Techniques
M Järvisalo, JH Korhonen
17th International Conference on Theory and Applications of Satisfiability …, 2014
Das System kann den Vorgang jetzt nicht ausführen. Versuchen Sie es später erneut.
Artikel 1–20