MOODS: fast search for position weight matrix matches in DNA sequences. - Janne H. Korhonen; Petri Martinmäki; Cinzia Pizzi; Pasi Rastas; Esko Ukkonen (Bioinform., 2009)

Fast Monotone Summation over Disjoint Sets. - Petteri Kaski; Mikko Koivisto; Janne H. Korhonen (IPEC, 2012)

Finding Efficient Circuits for Ensemble Computation. - Matti Järvisalo; Petteri Kaski; Mikko Koivisto; Janne H. Korhonen (SAT, 2012)

Exact Learning of Bounded Tree-width Bayesian Networks. - Janne H. Korhonen; Pekka Parviainen (AISTATS, 2013)

On the Parameterized Complexity of Cutting a Few Vertices from a Graph. - Fedor V. Fomin; Petr A. Golovach; Janne H. Korhonen (MFCS, 2013)

Synchronous Counting and Computational Algorithm Design. - Danny Dolev; Janne H. Korhonen; Christoph Lenzen 001; Joel Rybicki; Jukka Suomela (SSS, 2013)

Conditional Lower Bounds for Failed Literals and Related Techniques. - Matti Järvisalo; Janne H. Korhonen (SAT, 2014)

Fast monotone summation over disjoint sets. - Petteri Kaski; Mikko Koivisto; Janne H. Korhonen; Igor S. Sergeev (Inf. Process. Lett., 2014)

Tractable Bayesian Network Structure Learning with Bounded Vertex Cover Number. - Janne H. Korhonen; Pekka Parviainen (NIPS, 2015)

Deterministic MST Sparsification in the Congested Clique. - Janne H. Korhonen (CoRR, 2016)

Synchronous counting and computational algorithm design. - Danny Dolev; Keijo Heljanko; Matti Järvisalo; Janne H. Korhonen; Christoph Lenzen 001; Joel Rybicki; Jukka Suomela; Siert Wieringa (J. Comput. Syst. Sci., 2016)

Separating OR, SUM, and XOR circuits. - Magnus Find; Mika Göös; Matti Järvisalo; Petteri Kaski; Mikko Koivisto; Janne H. Korhonen (J. Comput. Syst. Sci., 2016)

Bayesian Network Structure Learning with Integer Programming: Polytopes, Facets and Complexity (Extended Abstract). - James Cussens; Matti Järvisalo; Janne H. Korhonen; Mark Bartlett (IJCAI, 2017)

Deterministic Subgraph Detection in Broadcast CONGEST. - Janne H. Korhonen; Joel Rybicki (OPODIS, 2017)

LCL Problems on Grids. - Sebastian Brandt 002; Juho Hirvonen; Janne H. Korhonen; Tuomo Lempiäinen; Patric R. J. Östergård; Christopher Purcell; Joel Rybicki; Jukka Suomela; Przemyslaw Uznanski (PODC, 2017)

Brief Announcement: Towards a Complexity Theory for the Congested Clique. - Janne H. Korhonen; Jukka Suomela (DISC, 2017)

Fast motif matching revisited: high-order PWMs, SNPs and indels. - Janne H. Korhonen; Kimmo Palin; Jussi Taipale; Esko Ukkonen (Bioinform., 2017)

Distributed Colour Reduction Revisited. - Jukka Kohonen; Janne H. Korhonen; Christopher Purcell; Jukka Suomela; Przemyslaw Uznanski (CoRR, 2017)

Bayesian Network Structure Learning with Integer Programming: Polytopes, Facets and Complexity. - James Cussens; Matti Järvisalo; Janne H. Korhonen; Mark Bartlett (J. Artif. Intell. Res., 2017)

Towards a Complexity Theory for the Congested Clique. - Janne H. Korhonen; Jukka Suomela (SPAA, 2018)

New classes of distributed time complexity. - Alkida Balliu; Juho Hirvonen; Janne H. Korhonen; Tuomo Lempiäinen; Dennis Olivetti; Jukka Suomela (STOC, 2018)

On the Number of Connected Sets in Bounded Degree Graphs. - Kustaa Kangas; Petteri Kaski; Janne H. Korhonen; Mikko Koivisto (Electron. J. Comb., 2018)

Does Preprocessing Help under Congestion? - Klaus-Tycho Foerster; Janne H. Korhonen; Joel Rybicki; Stefan Schmid 001 (PODC, 2019)

Brief Announcement: Does Preprocessing Help under Congestion? - Klaus-Tycho Foerster; Janne H. Korhonen; Joel Rybicki; Stefan Schmid 001 (CoRR, 2019)

Algebraic methods in the congested clique. - Keren Censor-Hillel; Petteri Kaski; Janne H. Korhonen; Christoph Lenzen 001; Ami Paz; Jukka Suomela (Distributed Comput., 2019)

Scalable Belief Propagation via Relaxed Scheduling. - Vitaly Aksenov; Dan Alistarh; Janne H. Korhonen (NeurIPS, 2020)

Relaxed Scheduling for Scalable Belief Propagation. - Vitaly Aksenov; Dan Alistarh; Janne H. Korhonen (CoRR, 2020)

Input-dynamic distributed graph algorithms for congested networks. - Klaus-Tycho Foerster; Janne H. Korhonen; Ami Paz; Joel Rybicki; Stefan Schmid 001 (CoRR, 2020)

Improved Communication Lower Bounds for Distributed Optimisation. - Dan Alistarh; Janne H. Korhonen (CoRR, 2020)

Towards Tight Communication Lower Bounds for Distributed Optimisation. - Janne H. Korhonen; Dan Alistarh (NeurIPS, 2021)

Beyond Distributed Subgraph Detection: Induced Subgraphs, Multicolored Problems and Graph Parameters. - Amir Nikabadi; Janne H. Korhonen (OPODIS, 2021)

Brief Announcement: Sinkless Orientation Is Hard Also in the Supported LOCAL Model. - Janne H. Korhonen; Ami Paz; Joel Rybicki; Stefan Schmid 001; Jukka Suomela (DISC, 2021)

Sinkless orientation is hard also in the supported LOCAL model. - Janne H. Korhonen; Ami Paz; Joel Rybicki; Stefan Schmid 001; Jukka Suomela (CoRR, 2021)

Fast approximate shortest paths in the congested clique. - Keren Censor-Hillel; Michal Dory; Janne H. Korhonen; Dean Leitersdorf (Distributed Comput., 2021)

Input-Dynamic Distributed Algorithms for Communication Networks. - Klaus-Tycho Foerster; Janne H. Korhonen; Ami Paz; Joel Rybicki; Stefan Schmid 001 (Proc. ACM Meas. Anal. Comput. Syst., 2021)

Sparse Matrix Multiplication in the Low-Bandwidth Model. - Chetan Gupta 002; Juho Hirvonen; Janne H. Korhonen; Jan Studený; Jukka Suomela (SPAA, 2022)

Sinkless Orientation Made Simple. - Alkida Balliu; Janne H. Korhonen; Fabian Kuhn; Henrik Lievonen; Dennis Olivetti; Shreyas Pai; Ami Paz; Joel Rybicki; Stefan Schmid 001; Jan Studený; Jukka Suomela; Jara Uitto (SOSA, 2023)

Demand-Aware Network Design with Steiner Nodes and a Connection to Virtual Network Embedding. - Aleksander Figiel; Janne H. Korhonen; Neil Olver; Stefan Schmid 001 (CoRR, 2023)

Efficient Algorithms for Demand-Aware Networks and a Connection to Virtual Network Embedding. - Aleksander Figiel; Janne H. Korhonen; Neil Olver; Stefan Schmid 001 (OPODIS, 2024)

Brief Announcement: Low-Bandwidth Matrix Multiplication: Faster Algorithms and More General Forms of Sparsity. - Chetan Gupta 002; Janne H. Korhonen; Jan Studený; Jukka Suomela; Hossein Vahidi 001 (SPAA, 2024)

Low-Bandwidth Matrix Multiplication: Faster Algorithms and More General Forms of Sparsity. - Chetan Gupta 002; Janne H. Korhonen; Jan Studený; Jukka Suomela; Hossein Vahidi 001 (SIROCCO, 2025)