Petteri Kaski

    • Aalto SCI Computer Science Konemiehentie 2

    20012022

    Research activity per year

    Personal profile

    Education/Academic qualification

    Doctoral degree, Engineering and Technology, Helsinki University of Technology

    Award Date: 22 Aug 2005

    Licentiate degree, Engineering and Technology, Helsinki University of Technology

    Award Date: 19 Dec 2002

    Master's degree, Engineering and Technology, Helsinki University of Technology

    Award Date: 24 Sept 2001

    Keywords

    • algorithm theory
    • exact and parameterized algorithms
    • algebraic algorithms
    • algorithm engineering
    • theoretical computer science

    Fingerprint

    Dive into the research topics where Petteri Kaski is active. These topic labels come from the works of this person. Together they form a unique fingerprint.
    • 1 Similar Profiles

    Collaborations and top research areas from the last five years

    Recent external collaboration on country/territory level. Dive into details by clicking on the dots or
    • Tensor Network Complexity of Multilinear Maps

      Austrin, P., Kaski, P. & Kubjas, K., 18 Jun 2022, In: THEORY OF COMPUTING. 18, p. 1-54 54 p., 16.

      Research output: Contribution to journalArticleScientificpeer-review

      Open Access
      File
      100 Downloads (Pure)
    • The shortest even cycle problem is tractable

      Björklund, A., Husfeldt, T. & Kaski, P., 6 Sept 2022, STOC 2022 - Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing. Leonardi, S. & Gupta, A. (eds.). ACM, p. 117-130 14 p. (Proceedings of the Annual ACM Symposium on Theory of Computing).

      Research output: Chapter in Book/Report/Conference proceedingConference article in proceedingsScientificpeer-review

      Open Access
      File
      1 Citation (Scopus)
      58 Downloads (Pure)
    • Trustworthy Monte Carlo

      Harviainen, J., Kaski, P. & Koivisto, M., 2022, Advances in Neural Information Processing Systems 35 (NeurIPS 2022). Koyejo, S., Mohamed, S., Agarwal, A., Belgrave, D., Cho, K. & Oh, A. (eds.). Curran Associates Inc., 12 p. (Advances in Neural Information Processing Systems; vol. 35).

      Research output: Chapter in Book/Report/Conference proceedingConference article in proceedingsScientificpeer-review

      Open Access
    • Counting short vector pairs by inner product and relations to the permanent

      Björklund, A. & Kaski, P., 1 Jul 2021, 48th International Colloquium on Automata, Languages, and Programming, ICALP 2021. Bansal, N., Merelli, E. & Worrell, J. (eds.). Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 21 p. 29. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 198).

      Research output: Chapter in Book/Report/Conference proceedingConference article in proceedingsScientificpeer-review

      Open Access
      File
      38 Downloads (Pure)
    • The fine-grained complexity of computing the Tutte polynomial of a linear matroid

      Björklund, A. & Kaski, P., 2021, Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms (SODA). Marx, D. (ed.). Society for Industrial and Applied Mathematics, p. 2333-2345

      Research output: Chapter in Book/Report/Conference proceedingConference article in proceedingsScientificpeer-review

      Open Access