Janne H. Korhonen

59 papers A* 9A 5B 10C 1Journal 31Unranked 3

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