Janne H. Korhonen

Publication Activity (10 Years)

Years Active: 2009-2024
Publications (10 Years): 43

Top Topics

Bayesian Network Structure Learning

Integer Program

Top Venues

J. Comput. Syst. Sci.

Publications

Chetan Gupta, Janne H. Korhonen, Jan Studený, Jukka Suomela, Hossein Vahidi
Low-Bandwidth Matrix Multiplication: Faster Algorithms and More General Forms of Sparsity. CoRR (2024)
Chetan Gupta, Janne H. Korhonen, Jan Studený, Jukka Suomela, Hossein Vahidi
Brief Announcement: Low-Bandwidth Matrix Multiplication: Faster Algorithms and More General Forms of Sparsity. SPAA (2024)
Aleksander Figiel, Janne H. Korhonen, Neil Olver, Stefan Schmid
Demand-Aware Network Design with Steiner Nodes and a Connection to Virtual Network Embedding. CoRR (2023)
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
Sinkless Orientation Made Simple. SOSA (2023)
Chetan Gupta, Juho Hirvonen, Janne H. Korhonen, Jan Studený, Jukka Suomela
Sparse Matrix Multiplication in the Low-Bandwidth Model. SPAA (2022)
Janne H. Korhonen, Ami Paz, Joel Rybicki, Stefan Schmid, Jukka Suomela
Brief Announcement: Sinkless Orientation Is Hard Also in the Supported LOCAL Model. DISC (2021)
Keren Censor-Hillel, Michal Dory, Janne H. Korhonen, Dean Leitersdorf
Fast approximate shortest paths in the congested clique. Distributed Comput. 34 (6) (2021)
Janne H. Korhonen, Dan Alistarh
Towards Tight Communication Lower Bounds for Distributed Optimisation. NeurIPS (2021)
Amir Nikabadi, Janne H. Korhonen
Beyond Distributed Subgraph Detection: Induced Subgraphs, Multicolored Problems and Graph Parameters. OPODIS (2021)
Klaus-Tycho Foerster, Janne H. Korhonen, Ami Paz, Joel Rybicki, Stefan Schmid
Input-Dynamic Distributed Algorithms for Communication Networks. Proc. ACM Meas. Anal. Comput. Syst. 5 (1) (2021)
Janne H. Korhonen, Amir Nikabadi
Beyond Distributed Subgraph Detection: Induced Subgraphs, Multicolored Problems and Graph Parameters. CoRR (2021)
Janne H. Korhonen, Ami Paz, Joel Rybicki, Stefan Schmid, Jukka Suomela
Sinkless orientation is hard also in the supported LOCAL model. CoRR (2021)
Klaus-Tycho Foerster, Janne H. Korhonen, Ami Paz, Joel Rybicki, Stefan Schmid
Input-Dynamic Distributed Algorithms for Communication Networks. SIGMETRICS (Abstracts) (2021)
Klaus-Tycho Foerster, Janne H. Korhonen, Ami Paz, Joel Rybicki, Stefan Schmid
Input-dynamic distributed graph algorithms for congested networks. CoRR (2020)
Vitaly Aksenov, Dan Alistarh, Janne H. Korhonen
Scalable Belief Propagation via Relaxed Scheduling. NeurIPS (2020)
Vitaly Aksenov, Dan Alistarh, Janne H. Korhonen
Relaxed Scheduling for Scalable Belief Propagation. CoRR (2020)
Dan Alistarh, Janne H. Korhonen
Improved Communication Lower Bounds for Distributed Optimisation. CoRR (2020)
Klaus-Tycho Foerster, Janne H. Korhonen, Joel Rybicki, Stefan Schmid
Does Preprocessing Help under Congestion? PODC (2019)
Keren Censor-Hillel, Petteri Kaski, Janne H. Korhonen, Christoph Lenzen, Ami Paz, Jukka Suomela
Algebraic methods in the congested clique. Distributed Comput. 32 (6) (2019)
Klaus-Tycho Foerster, Janne H. Korhonen, Joel Rybicki, Stefan Schmid
Brief Announcement: Does Preprocessing Help under Congestion? CoRR (2019)
Keren Censor-Hillel, Michal Dory, Janne H. Korhonen, Dean Leitersdorf
Fast Approximate Shortest Paths in the Congested Clique. PODC (2019)
Keren Censor-Hillel, Michal Dory, Janne H. Korhonen, Dean Leitersdorf
Fast Approximate Shortest Paths in the Congested Clique. CoRR (2019)
Janne H. Korhonen, Jukka Suomela
Towards a Complexity Theory for the Congested Clique. SPAA (2018)
Alkida Balliu, Juho Hirvonen, Janne H. Korhonen, Tuomo Lempiäinen, Dennis Olivetti, Jukka Suomela
New classes of distributed time complexity. STOC (2018)
Kustaa Kangas, Petteri Kaski, Janne H. Korhonen, Mikko Koivisto
On the Number of Connected Sets in Bounded Degree Graphs. Electron. J. Comb. 25 (4) (2018)
Janne H. Korhonen, Kimmo Palin, Jussi Taipale, Esko Ukkonen
Fast motif matching revisited: high-order PWMs, SNPs and indels. Bioinform. 33 (4) (2017)
James Cussens, Matti Järvisalo, Janne H. Korhonen, Mark Bartlett
Bayesian Network Structure Learning with Integer Programming: Polytopes, Facets and Complexity (Extended Abstract). IJCAI (2017)
Janne H. Korhonen, Joel Rybicki
Deterministic Subgraph Detection in Broadcast CONGEST. OPODIS (2017)
Alkida Balliu, Juho Hirvonen, Janne H. Korhonen, Tuomo Lempiäinen, Dennis Olivetti, Jukka Suomela
New Classes of Distributed Time Complexity. CoRR (2017)
Janne H. Korhonen, Joel Rybicki
Deterministic subgraph detection in broadcast CONGEST. CoRR (2017)
Jukka Kohonen, Janne H. Korhonen, Christopher Purcell, Jukka Suomela, Przemyslaw Uznanski
Distributed Colour Reduction Revisited. CoRR (2017)
Sebastian Brandt, Juho Hirvonen, Janne H. Korhonen, Tuomo Lempiäinen, Patric R. J. Östergård, Christopher Purcell, Joel Rybicki, Jukka Suomela, Przemyslaw Uznanski
LCL Problems on Grids. PODC (2017)
Janne H. Korhonen, Jukka Suomela
Brief Announcement: Towards a Complexity Theory for the Congested Clique. DISC (2017)
Janne H. Korhonen, Jukka Suomela
Towards a complexity theory for the congested clique. CoRR (2017)
Sebastian Brandt, Juho Hirvonen, Janne H. Korhonen, Tuomo Lempiäinen, Patric R. J. Östergård, Christopher Purcell, Joel Rybicki, Jukka Suomela, Przemyslaw Uznanski
LCL problems on grids. CoRR (2017)
James Cussens, Matti Järvisalo, Janne H. Korhonen, Mark Bartlett
Bayesian Network Structure Learning with Integer Programming: Polytopes, Facets and Complexity. J. Artif. Intell. Res. 58 (2017)
Danny Dolev, Keijo Heljanko, Matti Järvisalo, Janne H. Korhonen, Christoph Lenzen, Joel Rybicki, Jukka Suomela, Siert Wieringa
Synchronous counting and computational algorithm design. J. Comput. Syst. Sci. 82 (2) (2016)
Janne H. Korhonen
Deterministic MST Sparsification in the Congested Clique. CoRR (2016)
Magnus Find, Mika Göös, Matti Järvisalo, Petteri Kaski, Mikko Koivisto, Janne H. Korhonen
Separating OR, SUM, and XOR circuits. J. Comput. Syst. Sci. 82 (5) (2016)
James Cussens, Matti Järvisalo, Janne H. Korhonen, Mark Bartlett
Bayesian Network Structure Learning with Integer Programming: Polytopes, Facets, and Complexity. CoRR (2016)
Keren Censor-Hillel, Petteri Kaski, Janne H. Korhonen, Christoph Lenzen, Ami Paz, Jukka Suomela
Algebraic Methods in the Congested Clique. PODC (2015)
Keren Censor-Hillel, Petteri Kaski, Janne H. Korhonen, Christoph Lenzen, Ami Paz, Jukka Suomela
Algebraic Methods in the Congested Clique. CoRR (2015)
Janne H. Korhonen, Pekka Parviainen
Tractable Bayesian Network Structure Learning with Bounded Vertex Cover Number. NIPS (2015)
Matti Järvisalo, Janne H. Korhonen
Conditional Lower Bounds for Failed Literals and Related Techniques. SAT (2014)
Petteri Kaski, Mikko Koivisto, Janne H. Korhonen, Igor S. Sergeev
Fast monotone summation over disjoint sets. Inf. Process. Lett. 114 (5) (2014)
Kustaa Kangas, Petteri Kaski, Mikko Koivisto, Janne H. Korhonen
On the Number of Connected Sets in Bounded Degree Graphs. WG (2014)
Fedor V. Fomin, Petr A. Golovach, Janne H. Korhonen
On the Parameterized Complexity of Cutting a Few Vertices from a Graph. MFCS (2013)
Magnus Find, Mika Göös, Matti Järvisalo, Petteri Kaski, Mikko Koivisto, Janne H. Korhonen
Separating OR, SUM, and XOR Circuits CoRR (2013)
Danny Dolev, Janne H. Korhonen, Christoph Lenzen, Joel Rybicki, Jukka Suomela
Synchronous Counting and Computational Algorithm Design CoRR (2013)
Fedor V. Fomin, Petr A. Golovach, Janne H. Korhonen
On the parameterized complexity of cutting a few vertices from a graph CoRR (2013)
Janne H. Korhonen, Pekka Parviainen
Exact Learning of Bounded Tree-width Bayesian Networks. AISTATS (2013)
Danny Dolev, Janne H. Korhonen, Christoph Lenzen, Joel Rybicki, Jukka Suomela
Synchronous Counting and Computational Algorithm Design. SSS (2013)
Petteri Kaski, Mikko Koivisto, Janne H. Korhonen
Fast Monotone Summation over Disjoint Sets CoRR (2012)
Petteri Kaski, Mikko Koivisto, Janne H. Korhonen
Fast Monotone Summation over Disjoint Sets. IPEC (2012)
Matti Järvisalo, Petteri Kaski, Mikko Koivisto, Janne H. Korhonen
Finding Efficient Circuits for Ensemble Computation. SAT (2012)
Janne H. Korhonen, Petri Martinmäki, Cinzia Pizzi, Pasi Rastas, Esko Ukkonen
MOODS: fast search for position weight matrix matches in DNA sequences. Bioinform. 25 (23) (2009)