| 2026 | ESA | Partition Rank and Algebraic Circuit Lower Bounds. | Cornelius Brand, Petteri Kaski, Jiaheng Wang |
| 2026 | ESA | Optimal Union Probability Interval Is NP-Hard. | Petteri Kaski, Heikki Mannila, Chandra Kanta Mohapatra |
| 2026 | ICALP | Kronecker Scaling of Tensors with Applications to Arithmetic Circuits and Algorithms. | Andreas Bjrklund, Petteri Kaski, Tomohiro Koana, Jesper Nederlof |
| 2025 | SODA | Fast Deterministic Chromatic Number under the Asymptotic Rank Conjecture. | Andreas Bjrklund, Radu Curticapean, Thore Husfeldt, Petteri Kaski, Kevin Pratt |
| 2024 | ICALP | Another Hamiltonian Cycle in Bipartite Pfaffian Graphs. | Andreas Bjrklund, Petteri Kaski, Jesper Nederlof |
| 2024 | STOC | The Asymptotic Rank Conjecture and the Set Cover Conjecture Are Not Both True. | Andreas Bjrklund, Petteri Kaski |
| 2022 | STOC | The shortest even cycle problem is tractable. | Andreas Bjrklund, Thore Husfeldt, Petteri Kaski |
| 2021 | ICALP | Counting Short Vector Pairs by Inner Product and Relations to the Permanent. | Andreas Bjrklund, Petteri Kaski |
| 2021 | SODA | The Fine-Grained Complexity of Computing the Tutte Polynomial of a Linear Matroid. | Andreas Bjrklund, Petteri Kaski |
| 2020 | AAAI | Error-Correcting and Verifiable Parallel Inference in Graphical Models. | Negin Karimi, Petteri Kaski, Mikko Koivisto |
| 2019 | ICALP | Solving Systems of Polynomial Equations over GF(2) by a Parity-Counting Self-Reduction. | Andreas Bjrklund, Petteri Kaski, Ryan Williams |
| 2019 | SODA | Probabilistic Tensors and Opportunistic Boolean Matrix Multiplication. | Matti Karppa, Petteri Kaski |
| 2018 | ALENEX | Engineering a Delegatable and Error-Tolerant Algorithm for Counting Small Subgraphs. | Petteri Kaski |
| 2018 | ISAAC | Counting Connected Subgraphs with Maximum-Degree-Aware Sieving. | Andreas Bjrklund, Thore Husfeldt, Petteri Kaski, Mikko Koivisto |
| 2017 | ICALP | Directed Hamiltonicity and Out-Branchings via Generalized Laplacians. | Andreas Bjrklund, Petteri Kaski, Ioannis Koutis |
| 2017 | SAT | An Adaptive Prefix-Assignment Technique for Symmetry Reduction. | Tommi A. Junttila, Matti Karppa, Petteri Kaski, Jukka Kohonen |
| 2016 | ESA | Explicit Correlation Amplifiers for Finding Outlier Correlations in Deterministic Subquadratic Time. | Matti Karppa, Petteri Kaski, Jukka Kohonen, Padraig Cathin |
| 2016 | ISIT | Sharper upper bounds for unbalanced Uniquely Decodable Code Pairs. | Per Austrin, Petteri Kaski, Mikko Koivisto, Jesper Nederlof |
| 2016 | PODC | How Proofs are Prepared at Camelot: Extended Abstract. | Andreas Bjrklund, Petteri Kaski |
| 2016 | SODA | A Faster Subquadratic Algorithm for Finding Outlier Correlations. | Matti Karppa, Petteri Kaski, Jukka Kohonen |
| 2016 | STACS | Dense Subset Sum May Be the Hardest. | Per Austrin, Petteri Kaski, Mikko Koivisto, Jesper Nederlof |
| 2015 | ALENEX | Engineering Motif Search for Large Graphs. | Andreas Bjrklund, Petteri Kaski, Lukasz Kowalik, Juho Lauri |
| 2015 | ICALP | Parameterized Single-Exponential Time Polynomial Space Algorithm for Steiner Tree. | Fedor V. Fomin, Petteri Kaski, Daniel Lokshtanov, Fahad Panolan, Saket Saurabh |
| 2015 | PODC | Algebraic Methods in the Congested Clique. | Keren Censor-Hillel, Petteri Kaski, Janne H. Korhonen, Christoph Lenzen, Ami Paz, Jukka Suomela |
| 2015 | STACS | Subset Sum in the Absence of Concentration. | Per Austrin, Petteri Kaski, Mikko Koivisto, Jesper Nederlof |
| 2014 | ESA | Fast Witness Extraction Using a Decision Oracle. | Andreas Bjrklund, Petteri Kaski, Lukasz Kowalik |
| 2014 | SODA | Counting Thin Subgraphs via Packings Faster Than Meet-in-the-Middle Time. | Andreas Bjrklund, Petteri Kaski, Lukasz Kowalik |
| 2014 | WG | On the Number of Connected Sets in Bounded Degree Graphs. | Kustaa Kangas, Petteri Kaski, Mikko Koivisto, Janne H. Korhonen |
| 2013 | ICALP | Space-Time Tradeoffs for Subset Sum: An Improved Worst Case Algorithm. | Per Austrin, Petteri Kaski, Mikko Koivisto, Jussi Mtt |
| 2013 | STACS | Probably Optimal Graph Motifs. | Andreas Bjrklund, Petteri Kaski, Lukasz Kowalik |
| 2012 | SODA | Fast zeta transforms for lattices with few irreducibles. | Andreas Bjrklund, Mikko Koivisto, Thore Husfeldt, Jesper Nederlof, Petteri Kaski, Pekka Parviainen |
| 2012 | SAT | Finding Efficient Circuits for Ensemble Computation. | Matti Jrvisalo, Petteri Kaski, Mikko Koivisto, Janne H. Korhonen |
| 2011 | SDM | Segmented nestedness in binary data. | Esa Junttila, Petteri Kaski |
| 2011 | SDM | Significance of Patterns in Time Series Collections. | Niko Vuokko, Petteri Kaski |
| 2010 | CP | Exact Cover via Satisfiability: An Empirical Study. | Tommi A. Junttila, Petteri Kaski |
| 2010 | ICALP | Covering and Packing in Linear Space. | Andreas Bjrklund, Thore Husfeldt, Petteri Kaski, Mikko Koivisto |
| 2010 | ICDM | Testing the Significance of Patterns in Data with Cluster Structure. | Niko Vuokko, Petteri Kaski |
| 2010 | PODC | Brief announcement: distributed almost stable marriage. | Patrik Floren, Petteri Kaski, Valentin Polishchuk, Jukka Suomela |
| 2009 | ESA | Counting Paths and Packings in Halves. | Andreas Bjrklund, Thore Husfeldt, Petteri Kaski, Mikko Koivisto |
| 2009 | SPAA | An optimal local approximation algorithm for max-min linear programs. | Patrik Floren, Joel Kaasinen, Petteri Kaski, Jukka Suomela |
| 2008 | Algosensors | Tight Local Approximation Results for Max-Min Linear Programs. | Patrik Floren, Marja Hassinen, Petteri Kaski, Jukka Suomela |
| 2008 | FOCS | Computing the Tutte Polynomial in Vertex-Exponential Time. | Andreas Bjrklund, Thore Husfeldt, Petteri Kaski, Mikko Koivisto |
| 2008 | ICALP | The Travelling Salesman Problem in Bounded Degree Graphs. | Andreas Bjrklund, Thore Husfeldt, Petteri Kaski, Mikko Koivisto |
| 2008 | STACS | Trimmed Moebius Inversion and Graphs of Bounded Degree. | Andreas Bjrklund, Thore Husfeldt, Petteri Kaski, Mikko Koivisto |
| 2007 | ALENEX | Engineering an Efficient Canonical Labeling Tool for Large and Sparse Graphs. | Tommi A. Junttila, Petteri Kaski |
| 2007 | Algosensors | Local Approximation Algorithms for Scheduling Problems in Sensor Networks. | Patrik Floren, Petteri Kaski, Topi Musto, Jukka Suomela |
| 2007 | STOC | Fourier meets mbius: fast subset convolution. | Andreas Bjrklund, Thore Husfeldt, Petteri Kaski, Mikko Koivisto |
| 2007 | SECON | A distributed approximation scheme for sleep sceduling in sensor networks. | Patrik Floren, Petteri Kaski, Jukka Suomela |
| 2004 | Algosensors | Balanced Data Gathering in Energy-Constrained Sensor Networks. | Emil Falck, Patrik Floren, Petteri Kaski, Jukka Kohonen, Pekka Orponen |