| 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 | 194 | 2009 |
| Algebraic methods in the congested clique K Censor-Hillel, P Kaski, JH Korhonen, C Lenzen, A Paz, J Suomela Proceedings of the 2015 ACM Symposium on Principles of Distributed Computing …, 2015 | 158 | 2015 |
| 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 | 76 | 2017 |
| 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 | 70 | 2017 |
| Fast motif matching revisited: high-order PWMs, SNPs and indels JH Korhonen, K Palin, J Taipale, E Ukkonen Bioinformatics 33 (4), 514-521, 2017 | 63 | 2017 |
| Fast approximate shortest paths in the congested clique K Censor-Hillel, M Dory, JH Korhonen, D Leitersdorf Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing …, 2019 | 62 | 2019 |
| Exact Learning of Bounded Tree-width Bayesian Networks JH Korhonen, P Parviainen Artificial Intelligence and Statistics (AISTATS 2013), 370–378, 2013 | 58 | 2013 |
| 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 | 57 | 2018 |
| Deterministic subgraph detection in broadcast CONGEST JH Korhonen, J Rybicki arXiv preprint arXiv:1705.10195, 2017 | 53 | 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 | 43* | 2018 |
| 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 | 36 | 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 | 31 | 2016 |
| On the parameterized complexity of cutting a few vertices from a graph FV Fomin, PA Golovach, JH Korhonen Mathematical Foundations of Computer Science 2013: 38th International …, 2013 | 29 | 2013 |
| Brief announcement: Deterministic MST sparsification in the congested clique JH Korhonen Proc. of 30th International Symposium on Distributed Computing (DISC 2016), 2016 | 20* | 2016 |
| Tractable Bayesian Network Structure Learning with Bounded Vertex Cover Number JH Korhonen, P Parviainen Neural Information Processing Systems (NIPS 2015), 2015 | 19 | 2015 |
| Finding efficient circuits for ensemble computation M Järvisalo, P Kaski, M Koivisto, JH Korhonen International Conference on Theory and Applications of Satisfiability …, 2012 | 19 | 2012 |
| Scalable belief propagation via relaxed scheduling V Aksenov, D Alistarh, JH Korhonen Advances in Neural Information Processing Systems 33, 22361-22372, 2020 | 18* | 2020 |
| 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 | 14* | 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 | 13 | 2019 |
| Towards tight communication lower bounds for distributed optimisation JH Korhonen, D Alistarh Advances in Neural Information Processing Systems 34, 7254-7266, 2021 | 11* | 2021 |
Jukka SuomelaAalto UniversityVerified email at aalto.fi