default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJanne H. Korhonen
Person information
- affiliation: IST, Austria
- affiliation (former): Aalto University, Department of Computer Science Distributed Algorithms, Finland
- affiliation (former): Reykjavík University, School of Computer Science
- affiliation (former): University of Helsinki, Department of Computer Science
- affiliation (former): Helsinki Institute for Information Technology HIIT, Finland
Other persons with the same name
- Janne Korhonen 0002 — Tampere University Hospital, Department of Radiology, Finland
Other persons with a similar name
- Janne J. Korhonen — Aalto University School of Science, Espoo, Finland
- Janne M. Korhonen — Aalto Design Factory, School of Economics, Espoo, Finland (and 1 more)
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c25]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: 305-307- [i22]Chetan Gupta, Janne H. Korhonen, Jan Studený, Jukka Suomela, Hossein Vahidi:
Low-Bandwidth Matrix Multiplication: Faster Algorithms and More General Forms of Sparsity. CoRR abs/2404.15559 (2024) - 2023
- [c24]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: 175-191 - [i21]Aleksander Figiel, Janne H. Korhonen, Neil Olver, Stefan Schmid:
Demand-Aware Network Design with Steiner Nodes and a Connection to Virtual Network Embedding. CoRR abs/2308.10579 (2023) - 2022
- [c23]Chetan Gupta, Juho Hirvonen, Janne H. Korhonen, Jan Studený, Jukka Suomela:
Sparse Matrix Multiplication in the Low-Bandwidth Model. SPAA 2022: 435-444 - [i20]Chetan Gupta, Juho Hirvonen, Janne Korhonen, Jan Studený, Jukka Suomela:
Sparse matrix multiplication in the low-bandwidth model. CoRR abs/2203.01297 (2022) - 2021
- [j10]Keren Censor-Hillel, Michal Dory, Janne H. Korhonen, Dean Leitersdorf:
Fast approximate shortest paths in the congested clique. Distributed Comput. 34(6): 463-487 (2021) - [j9]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): 06:1-06:33 (2021) - [c22]Janne H. Korhonen, Dan Alistarh:
Towards Tight Communication Lower Bounds for Distributed Optimisation. NeurIPS 2021: 7254-7266 - [c21]Amir Nikabadi, Janne H. Korhonen:
Beyond Distributed Subgraph Detection: Induced Subgraphs, Multicolored Problems and Graph Parameters. OPODIS 2021: 15:1-15:18 - [c20]Klaus-Tycho Foerster, Janne H. Korhonen, Ami Paz, Joel Rybicki, Stefan Schmid:
Input-Dynamic Distributed Algorithms for Communication Networks. SIGMETRICS (Abstracts) 2021: 71-72 - [c19]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: 58:1-58:4 - [e1]Avery Miller, Keren Censor-Hillel, Janne H. Korhonen:
PODC '21: ACM Symposium on Principles of Distributed Computing, Virtual Event, Italy, July 26-30, 2021. ACM 2021, ISBN 978-1-4503-8548-0 [contents] - [i19]Janne H. Korhonen, Ami Paz, Joel Rybicki, Stefan Schmid, Jukka Suomela:
Sinkless orientation is hard also in the supported LOCAL model. CoRR abs/2108.02655 (2021) - [i18]Janne H. Korhonen, Amir Nikabadi:
Beyond Distributed Subgraph Detection: Induced Subgraphs, Multicolored Problems and Graph Parameters. CoRR abs/2109.06561 (2021) - 2020
- [c18]Vitaly Aksenov, Dan Alistarh, Janne H. Korhonen:
Scalable Belief Propagation via Relaxed Scheduling. NeurIPS 2020 - [i17]Vitaly Aksenov, Dan Alistarh, Janne H. Korhonen:
Relaxed Scheduling for Scalable Belief Propagation. CoRR abs/2002.11505 (2020) - [i16]Klaus-Tycho Foerster, Janne H. Korhonen, Ami Paz, Joel Rybicki, Stefan Schmid:
Input-dynamic distributed graph algorithms for congested networks. CoRR abs/2005.07637 (2020) - [i15]Dan Alistarh, Janne H. Korhonen:
Improved Communication Lower Bounds for Distributed Optimisation. CoRR abs/2010.08222 (2020)
2010 – 2019
- 2019
- [j8]Keren Censor-Hillel, Petteri Kaski, Janne H. Korhonen, Christoph Lenzen, Ami Paz, Jukka Suomela:
Algebraic methods in the congested clique. Distributed Comput. 32(6): 461-478 (2019) - [c17]Keren Censor-Hillel, Michal Dory, Janne H. Korhonen, Dean Leitersdorf:
Fast Approximate Shortest Paths in the Congested Clique. PODC 2019: 74-83 - [c16]Klaus-Tycho Foerster, Janne H. Korhonen, Joel Rybicki, Stefan Schmid:
Does Preprocessing Help under Congestion? PODC 2019: 259-261 - [i14]Keren Censor-Hillel, Michal Dory, Janne H. Korhonen, Dean Leitersdorf:
Fast Approximate Shortest Paths in the Congested Clique. CoRR abs/1903.05956 (2019) - [i13]Klaus-Tycho Foerster, Janne H. Korhonen, Joel Rybicki, Stefan Schmid:
Brief Announcement: Does Preprocessing Help under Congestion? CoRR abs/1905.03012 (2019) - 2018
- [j7]Kustaa Kangas, Petteri Kaski, Janne H. Korhonen, Mikko Koivisto:
On the Number of Connected Sets in Bounded Degree Graphs. Electron. J. Comb. 25(4): 4 (2018) - [c15]Janne H. Korhonen, Jukka Suomela:
Towards a Complexity Theory for the Congested Clique. SPAA 2018: 163-172 - [c14]Alkida Balliu, Juho Hirvonen, Janne H. Korhonen, Tuomo Lempiäinen, Dennis Olivetti, Jukka Suomela:
New classes of distributed time complexity. STOC 2018: 1307-1318 - 2017
- [j6]Janne H. Korhonen, Kimmo Palin, Jussi Taipale, Esko Ukkonen:
Fast motif matching revisited: high-order PWMs, SNPs and indels. Bioinform. 33(4): 514-521 (2017) - [j5]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: 185-229 (2017) - [c13]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: 4990-4994 - [c12]Janne H. Korhonen, Joel Rybicki:
Deterministic Subgraph Detection in Broadcast CONGEST. OPODIS 2017: 4:1-4:16 - [c11]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: 101-110 - [c10]Janne H. Korhonen, Jukka Suomela:
Brief Announcement: Towards a Complexity Theory for the Congested Clique. DISC 2017: 55:1-55:3 - [i12]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 abs/1702.05456 (2017) - [i11]Janne H. Korhonen, Jukka Suomela:
Towards a complexity theory for the congested clique. CoRR abs/1705.03284 (2017) - [i10]Janne H. Korhonen, Joel Rybicki:
Deterministic subgraph detection in broadcast CONGEST. CoRR abs/1705.10195 (2017) - [i9]Jukka Kohonen, Janne H. Korhonen, Christopher Purcell, Jukka Suomela, Przemyslaw Uznanski:
Distributed Colour Reduction Revisited. CoRR abs/1709.00901 (2017) - [i8]Alkida Balliu, Juho Hirvonen, Janne H. Korhonen, Tuomo Lempiäinen, Dennis Olivetti, Jukka Suomela:
New Classes of Distributed Time Complexity. CoRR abs/1711.01871 (2017) - 2016
- [j4]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): 310-332 (2016) - [j3]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): 793-801 (2016) - [i7]Janne H. Korhonen:
Deterministic MST Sparsification in the Congested Clique. CoRR abs/1605.02022 (2016) - [i6]James Cussens, Matti Järvisalo, Janne H. Korhonen, Mark Bartlett:
Bayesian Network Structure Learning with Integer Programming: Polytopes, Facets, and Complexity. CoRR abs/1605.04071 (2016) - 2015
- [c9]Janne H. Korhonen, Pekka Parviainen:
Tractable Bayesian Network Structure Learning with Bounded Vertex Cover Number. NIPS 2015: 622-630 - [c8]Keren Censor-Hillel, Petteri Kaski, Janne H. Korhonen, Christoph Lenzen, Ami Paz, Jukka Suomela:
Algebraic Methods in the Congested Clique. PODC 2015: 143-152 - [i5]Keren Censor-Hillel, Petteri Kaski, Janne H. Korhonen, Christoph Lenzen, Ami Paz, Jukka Suomela:
Algebraic Methods in the Congested Clique. CoRR abs/1503.04963 (2015) - 2014
- [j2]Petteri Kaski, Mikko Koivisto, Janne H. Korhonen, Igor S. Sergeev:
Fast monotone summation over disjoint sets. Inf. Process. Lett. 114(5): 264-267 (2014) - [c7]Matti Järvisalo, Janne H. Korhonen:
Conditional Lower Bounds for Failed Literals and Related Techniques. SAT 2014: 75-84 - [c6]Kustaa Kangas, Petteri Kaski, Mikko Koivisto, Janne H. Korhonen:
On the Number of Connected Sets in Bounded Degree Graphs. WG 2014: 336-347 - 2013
- [c5]Janne H. Korhonen, Pekka Parviainen:
Exact Learning of Bounded Tree-width Bayesian Networks. AISTATS 2013: 370-378 - [c4]Fedor V. Fomin, Petr A. Golovach, Janne H. Korhonen:
On the Parameterized Complexity of Cutting a Few Vertices from a Graph. MFCS 2013: 421-432 - [c3]Danny Dolev, Janne H. Korhonen, Christoph Lenzen, Joel Rybicki, Jukka Suomela:
Synchronous Counting and Computational Algorithm Design. SSS 2013: 237-250 - [i4]Magnus Find, Mika Göös, Matti Järvisalo, Petteri Kaski, Mikko Koivisto, Janne H. Korhonen:
Separating OR, SUM, and XOR Circuits. CoRR abs/1304.0513 (2013) - [i3]Danny Dolev, Janne H. Korhonen, Christoph Lenzen, Joel Rybicki, Jukka Suomela:
Synchronous Counting and Computational Algorithm Design. CoRR abs/1304.5719 (2013) - [i2]Fedor V. Fomin, Petr A. Golovach, Janne H. Korhonen:
On the parameterized complexity of cutting a few vertices from a graph. CoRR abs/1304.6189 (2013) - 2012
- [c2]Petteri Kaski, Mikko Koivisto, Janne H. Korhonen:
Fast Monotone Summation over Disjoint Sets. IPEC 2012: 159-170 - [c1]Matti Järvisalo, Petteri Kaski, Mikko Koivisto, Janne H. Korhonen:
Finding Efficient Circuits for Ensemble Computation. SAT 2012: 369-382 - [i1]Petteri Kaski, Mikko Koivisto, Janne H. Korhonen:
Fast Monotone Summation over Disjoint Sets. CoRR abs/1208.0554 (2012)
2000 – 2009
- 2009
- [j1]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): 3181-3182 (2009)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 21:19 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
