Janne H. Korhonen

PhD, Postdoctoral researcher
Distributed Algorithms research group

Contact

Email: janne.h.korhonen[at]aalto.fi

Research

Research interests: Distributed computing (LOCAL, CONGEST and the congested clique), complexity theory of distributed computing, and algorithms and complexity in general.

I have also worked on exact exponential algorithms and fine-grained complexity, Bayesian networks and bioinformatics.

Publications

Journal papers

  1. Inferring dispersal across a fragmented landscape using reconstructed families in the Glanville fritillary butterfly
    Toby Fountain, Arild Husby, Etsuko Nonaka, Michelle F. DiLeo, Janne H. Korhonen, Pasi Rastas, Torsti Schulz, Marjo Saastamoinen, Ilkka Hanski. Evolutionary Applications, 2017. doi:10.1111/eva.12552.
  2. Bayesian Network Structure Learning with Integer Programming: Polytopes, Facets, and Complexity
    James Cussens, Matti Järvisalo, Janne H. Korhonen and Mark Bartlett. Journal of Artificial Intelligence Research, 58:185-229, 2017.
  3. Fast motif matching revisited: high-order PWMs, SNPs and indels
    Janne H. Korhonen, Kimmo Palin, Jussi Taipale and Esko Ukkonen. Bioinformatics, 33(4):514-521, 2017. doi:10.1093/bioinformatics/btw683.
  4. Separating OR, SUM, and XOR Circuits
    Magnus Find, Mika Göös, Matti Järvisalo, Petteri Kaski, Mikko Koivisto, and Janne H. Korhonen. Journal of Computer and System Sciences, 82(5):793–801, 2016. doi:10.1016/j.jcss.2016.01.001.
  5. Synchronous counting and computational algorithm design
    Danny Dolev, Keijo Heljanko, Matti Järvisalo, Janne H. Korhonen, Christoph Lenzen, Joel Rybicki, Jukka Suomela, and Siert Wieringa. Journal of Computer and System Sciences, 82(2):310–332, 2016. doi:10.1016/j.jcss.2015.09.002.
  6. Fast monotone summation over disjoint sets
    Petteri Kaski, Mikko Koivisto, Janne H. Korhonen, and Igor S. Sergeev. Information Processing Letters, 114(5):264–267, 2014. doi:10.1016/j.ipl.2013.12.003.
  7. MOODS: fast search for position weight matrix matches in DNA sequences
    Janne Korhonen, Petri Martinmäki, Cinzia Pizzi, Pasi Rastas, and Esko Ukkonen. Bioinformatics, 25(23):3181–3182, 2009. doi:10.1093/bioinformatics/btp554.

Conference papers

  1. Deterministic subgraph detection in broadcast CONGEST
    Janne H. Korhonen and Joel Rybicki. In Proc. 21st International Conference on Principles of Distributed Systems (OPODIS 2017), 2017 (to appear).
  2. 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 and Przemysław Uznański. In Proc. 36nd ACM Symposium on Principles of Distributed Computing (PODC 2017), pages 101–110, 2017. doi:10.1145/3087801.3087833.
  3. Brief Announcement: Deterministic MST Sparsification in the Congested Clique
    Janne H. Korhonen. In Proc. 30th International Symposium on Distributed Computing (DISC 2016), pages 468–470, 2016. doi:10.1007/978-3-662-53426-7.
  4. Tractable Bayesian Network Structure Learning with Bounded Vertex Cover Number
    Janne H. Korhonen and Pekka Parviainen. In 29th Annual Conference on Neural Information Processing Systems (NIPS 2015), 2015.
  5. Algebraic methods in the congested clique
    Keren Censor-Hillel, Petteri Kaski, Janne H. Korhonen, Christoph Lenzen, Ami Paz, and Jukka Suomela. In Proc. 34nd ACM Symposium on Principles of Distributed Computing (PODC 2015), pages 143–152, 2015. doi:10.1145/2767386.2767414.
  6. Conditional lower bounds for failed literals and related techniques
    Matti Järvisalo and Janne H. Korhonen. In 17th International Conference on Theory and Applications of Satisfiability Testing (SAT 2014), pages 75–84, 2014. doi:10.1007/978-3-319-09284-3_7.
  7. On the number of connected sets in bounded degree graphs
    Kustaa Kangas, Petteri Kaski, Mikko Koivisto, and Janne H. Korhonen. In 40th International Workshop on Graph-Theoretic Concepts in Computer Science (WG 2014), pages 336–347, 2014. doi:10.1007/978-3-319-12340-0_28.
  8. Synchronous counting and computational algorithm design
    Danny Dolev, Janne H. Korhonen, Christoph Lenzen, Joel Rybicki, and Jukka Suomela. In 15th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS 2013), pages 237–250. Springer, 2013. doi:10.1007/978-3-319-03089-0_ 17.
  9. On the parameterized complexity of cutting a few vertices from a graph
    Fedor V. Fomin, Petr A. Golovach, and Janne H. Korhonen. In 38th International Symposium on Mathematical Foundations of Computer Science (MFCS 2013), pages 421–432. Springer, 2013. doi:10.1007/978-3-642-40313-2_38.
  10. Learning bounded tree-width Bayesian networks
    Janne H. Korhonen and Pekka Parviainen. In 16th International Conference on Artificial Intelligence and Statistics (AISTATS 2013), pages 370–378. JMLR, 2013.
  11. Fast monotone summation over disjoint sets
    Petteri Kaski, Mikko Koivisto, and Janne H. Korhonen. In 7th International Symposium on Parameterized and Exact Computation (IPEC 2012), pages 159–170. Springer, 2012. doi:10.1007/978-3-642-33293-7_16.
  12. Finding efficient circuits for ensemble computation
    Matti Järvisalo, Petteri Kaski, Mikko Koivisto, and Janne H. Korhonen. In 15th International Conference on Theory and Applications of Satisfiability Testing (SAT 2012), pages 369–382. Springer, 2012. doi:10.1007/978-3-642-31612-8_28.

Theses

  1. Graph and Hypergraph Decompositions for Exact Algorithms
    Janne H. Korhonen. PhD Thesis (passed with distinction).
    University of Helsinki Department of Computer Science Series of Publications A, Report A-2014-1.

Manuscripts

  1. Distributed Colour Reduction Revisited
    Jukka Kohonen, Janne H. Korhonen, Christopher Purcell, Jukka Suomela and Przemysław Uznański. arXiv:1709.00901 [cs.DC].
  1. Towards a complexity theory for the congested clique
    Janne H. Korhonen and Jukka Suomela. arXiv:1705.03284 [cs.DC].