Janne H. Korhonen

According to our database, Janne H. Korhonen authored at least 40 papers between 2009 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2024

Low-Bandwidth Matrix Multiplication: Faster Algorithms and More General Forms of Sparsity.

Chetan Gupta, Janne H. Korhonen, Jan Studený, Jukka Suomela, Hossein Vahidi

CoRR, 2024

Brief Announcement: Low-Bandwidth Matrix Multiplication: Faster Algorithms and More General Forms of Sparsity.

Chetan Gupta, Janne H. Korhonen, Jan Studený, Jukka Suomela, Hossein Vahidi

Proceedings of the 36th ACM Symposium on Parallelism in Algorithms and Architectures, 2024

2023

Demand-Aware Network Design with Steiner Nodes and a Connection to Virtual Network Embedding.

Aleksander Figiel, Janne H. Korhonen, Neil Olver, Stefan Schmid

CoRR, 2023

Sinkless Orientation Made Simple.

Alkida Balliu, Janne H. Korhonen, Fabian Kuhn, Henrik Lievonen, Dennis Olivetti, Shreyas Pai, Ami Paz, Joel Rybicki, Stefan Schmid, Jan Studený, Jukka Suomela, Jara Uitto

Proceedings of the 2023 Symposium on Simplicity in Algorithms, 2023

2022

Sparse Matrix Multiplication in the Low-Bandwidth Model.

Chetan Gupta, Juho Hirvonen, Janne H. Korhonen, Jan Studený, Jukka Suomela

Proceedings of the SPAA '22: 34th ACM Symposium on Parallelism in Algorithms and Architectures, Philadelphia, PA, USA, July 11, 2022

2021

Input-Dynamic Distributed Algorithms for Communication Networks.

Klaus-Tycho Foerster, Janne H. Korhonen, Ami Paz, Joel Rybicki, Stefan Schmid

Proc. ACM Meas. Anal. Comput. Syst., 2021

Fast approximate shortest paths in the congested clique.

Keren Censor-Hillel, Michal Dory, Janne H. Korhonen, Dean Leitersdorf

Distributed Comput., 2021

Sinkless orientation is hard also in the supported LOCAL model.

Janne H. Korhonen, Ami Paz, Joel Rybicki, Stefan Schmid, Jukka Suomela

CoRR, 2021

Brief Announcement: Sinkless Orientation Is Hard Also in the Supported LOCAL Model.

Janne H. Korhonen, Ami Paz, Joel Rybicki, Stefan Schmid, Jukka Suomela

Proceedings of the 35th International Symposium on Distributed Computing, 2021

Beyond Distributed Subgraph Detection: Induced Subgraphs, Multicolored Problems and Graph Parameters.

Amir Nikabadi, Janne H. Korhonen

Proceedings of the 25th International Conference on Principles of Distributed Systems, 2021

Towards Tight Communication Lower Bounds for Distributed Optimisation.

Janne H. Korhonen, Dan Alistarh

Proceedings of the Advances in Neural Information Processing Systems 34: Annual Conference on Neural Information Processing Systems 2021, 2021

2020

Improved Communication Lower Bounds for Distributed Optimisation.

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

CoRR, 2020

Relaxed Scheduling for Scalable Belief Propagation.

Vitaly Aksenov, Dan Alistarh, Janne H. Korhonen

CoRR, 2020

Scalable Belief Propagation via Relaxed Scheduling.

Vitaly Aksenov, Dan Alistarh, Janne H. Korhonen

Proceedings of the Advances in Neural Information Processing Systems 33: Annual Conference on Neural Information Processing Systems 2020, 2020

2019

Algebraic methods in the congested clique.

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

Distributed Comput., 2019

Brief Announcement: Does Preprocessing Help under Congestion?

Klaus-Tycho Foerster, Janne H. Korhonen, Joel Rybicki, Stefan Schmid

CoRR, 2019

Does Preprocessing Help under Congestion?

Klaus-Tycho Foerster, Janne H. Korhonen, Joel Rybicki, Stefan Schmid

Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing, 2019

2018

On the Number of Connected Sets in Bounded Degree Graphs.

Kustaa Kangas, Petteri Kaski, Janne H. Korhonen, Mikko Koivisto

Electron. J. Comb., 2018

New classes of distributed time complexity.

Alkida Balliu, Juho Hirvonen, Janne H. Korhonen, Tuomo Lempiäinen, Dennis Olivetti, Jukka Suomela

Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing, 2018

Towards a Complexity Theory for the Congested Clique.

Janne H. Korhonen, Jukka Suomela

Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures, 2018

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

Distributed Colour Reduction Revisited.

Jukka Kohonen, Janne H. Korhonen, Christopher Purcell, Jukka Suomela, Przemyslaw Uznanski

CoRR, 2017

Fast motif matching revisited: high-order PWMs, SNPs and indels.

Janne H. Korhonen, Kimmo Palin, Jussi Taipale, Esko Ukkonen

Bioinform., 2017

Brief Announcement: Towards a Complexity Theory for the Congested Clique.

Janne H. Korhonen, Jukka Suomela

Proceedings of the 31st International Symposium on Distributed Computing, 2017

LCL Problems on Grids.

Sebastian Brandt, Juho Hirvonen, Janne H. Korhonen, Tuomo Lempiäinen, Patric R. J. Östergård, Christopher Purcell, Joel Rybicki, Jukka Suomela, Przemyslaw Uznanski

Proceedings of the ACM Symposium on Principles of Distributed Computing, 2017

Deterministic Subgraph Detection in Broadcast CONGEST.

Janne H. Korhonen, Joel Rybicki

Proceedings of the 21st International Conference on Principles of Distributed Systems, 2017

Bayesian Network Structure Learning with Integer Programming: Polytopes, Facets and Complexity (Extended Abstract).

James Cussens, Matti Järvisalo, Janne H. Korhonen, Mark Bartlett

Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence, 2017

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

Synchronous counting and computational algorithm design.

Danny Dolev, Keijo Heljanko, Matti Järvisalo, Janne H. Korhonen, Christoph Lenzen, Joel Rybicki, Jukka Suomela, Siert Wieringa

J. Comput. Syst. Sci., 2016

Deterministic MST Sparsification in the Congested Clique.

Janne H. Korhonen

CoRR, 2016

2015

Tractable Bayesian Network Structure Learning with Bounded Vertex Cover Number.

Janne H. Korhonen, Pekka Parviainen

Proceedings of the Advances in Neural Information Processing Systems 28: Annual Conference on Neural Information Processing Systems 2015, 2015

2014

Fast monotone summation over disjoint sets.

Petteri Kaski, Mikko Koivisto, Janne H. Korhonen, Igor S. Sergeev

Inf. Process. Lett., 2014

Conditional Lower Bounds for Failed Literals and Related Techniques.

Matti Järvisalo, Janne H. Korhonen

Proceedings of the Theory and Applications of Satisfiability Testing - SAT 2014, 2014

2013

Synchronous Counting and Computational Algorithm Design.

Danny Dolev, Janne H. Korhonen, Christoph Lenzen, Joel Rybicki, Jukka Suomela

Proceedings of the Stabilization, Safety, and Security of Distributed Systems, 2013

On the Parameterized Complexity of Cutting a Few Vertices from a Graph.

Fedor V. Fomin, Petr A. Golovach, Janne H. Korhonen

Proceedings of the Mathematical Foundations of Computer Science 2013, 2013

Exact Learning of Bounded Tree-width Bayesian Networks.

Janne H. Korhonen, Pekka Parviainen

Proceedings of the Sixteenth International Conference on Artificial Intelligence and Statistics, 2013

2012

Finding Efficient Circuits for Ensemble Computation.

Matti Järvisalo, Petteri Kaski, Mikko Koivisto, Janne H. Korhonen

Proceedings of the Theory and Applications of Satisfiability Testing - SAT 2012, 2012

Fast Monotone Summation over Disjoint Sets.

Petteri Kaski, Mikko Koivisto, Janne H. Korhonen

Proceedings of the Parameterized and Exact Computation - 7th International Symposium, 2012

2009

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