Petteri Kaski

ORCID

Publication Activity (10 Years)

Years Active: 2002-2024
Publications (10 Years): 50

Top Venues

Helsinki University of Technology, Finland (PHD)

Education History

Helsinki University of Technology, Finland

PHD

Publications

Andreas Björklund, Petteri Kaski, Jesper Nederlof
Another Hamiltonian Cycle in Bipartite Pfaffian Graphs. ICALP (2024)
Andreas Björklund, Radu Curticapean, Thore Husfeldt, Petteri Kaski, Kevin Pratt
time? Fast deterministic set partitioning under the asymptotic rank conjecture. CoRR (2024)
Petteri Kaski, Mateusz Michalek
A universal sequence of tensors for the asymptotic rank conjecture. CoRR (2024)
Andreas Björklund, Petteri Kaski
The Asymptotic Rank Conjecture and the Set Cover Conjecture Are Not Both True. STOC (2024)
Andreas Björklund, Petteri Kaski, Jesper Nederlof
Another Hamiltonian Cycle in Bipartite Pfaffian Graphs. CoRR (2023)
Andreas Björklund, Petteri Kaski
The Asymptotic Rank Conjecture and the Set Cover Conjecture are not Both True. CoRR (2023)
Andreas Björklund, Thore Husfeldt, Petteri Kaski
The shortest even cycle problem is tractable. STOC (2022)
Per Austrin, Petteri Kaski, Kaie Kubjas
Tensor Network Complexity of Multilinear Maps. Theory Comput. 18 (2022)
Juha Harviainen, Mikko Koivisto, Petteri Kaski
Trustworthy Monte Carlo. NeurIPS (2022)
Andreas Björklund, Petteri Kaski
Counting Short Vector Pairs by Inner Product and Relations to the Permanent. ICALP (2021)
Andreas Björklund, Thore Husfeldt, Petteri Kaski
The Shortest Even Cycle Problem is Tractable. CoRR (2021)
Andreas Björklund, Petteri Kaski
The Fine-Grained Complexity of Computing the Tutte Polynomial of a Linear Matroid. SODA (2021)
Andreas Björklund, Petteri Kaski
Counting Short Vector Pairs by Inner Product and Relations to the Permanent. CoRR (2020)
Andreas Björklund, Petteri Kaski
The Fine-Grained Complexity of Computing the Tutte Polynomial of a Linear Matroid. CoRR (2020)
Negin Karimi, Petteri Kaski, Mikko Koivisto
Error-Correcting and Verifiable Parallel Inference in Graphical Models. AAAI (2020)
Matti Karppa, Petteri Kaski, Jukka Kohonen, Padraig Ó Catháin
Explicit Correlation Amplifiers for Finding Outlier Correlations in Deterministic Subquadratic Time. Algorithmica 82 (11) (2020)
Tommi A. Junttila, Matti Karppa, Petteri Kaski, Jukka Kohonen
An adaptive prefix-assignment technique for symmetry reduction. J. Symb. Comput. 99 (2020)
Matti Karppa, Petteri Kaski
Engineering Boolean Matrix Multiplication for Multiple-Accelerator Shared-Memory Architectures. CoRR (2019)
Keren Censor-Hillel, Petteri Kaski, Janne H. Korhonen, Christoph Lenzen, Ami Paz, Jukka Suomela
Algebraic methods in the congested clique. Distributed Comput. 32 (6) (2019)
Fedor V. Fomin, Petteri Kaski, Daniel Lokshtanov, Fahad Panolan, Saket Saurabh
Parameterized Single-Exponential Time Polynomial Space Algorithm for Steiner Tree. SIAM J. Discret. Math. 33 (1) (2019)
Andreas Björklund, Petteri Kaski, Ryan Williams
Generalized Kakeya sets for polynomial evaluation and faster computation of fermionants. Algorithmica 81 (10) (2019)
Andreas Björklund, Petteri Kaski, Ryan Williams
Solving Systems of Polynomial Equations over GF(2) by a Parity-Counting Self-Reduction. ICALP (2019)
Matti Karppa, Petteri Kaski
Probabilistic Tensors and Opportunistic Boolean Matrix Multiplication. SODA (2019)
Per Austrin, Petteri Kaski, Kaie Kubjas
Tensor Network Complexity of Multilinear Maps. ITCS (2019)
Matti Karppa, Petteri Kaski, Jukka Kohonen
A Faster Subquadratic Algorithm for Finding Outlier Correlations. ACM Trans. Algorithms 14 (3) (2018)
Petteri Kaski
Engineering a Delegatable and Error-Tolerant Algorithm for Counting Small Subgraphs. ALENEX (2018)
Per Austrin, Petteri Kaski, Mikko Koivisto, Jesper Nederlof
Sharper Upper Bounds for Unbalanced Uniquely Decodable Code Pairs. IEEE Trans. Inf. Theory 64 (2) (2018)
Andreas Björklund, Thore Husfeldt, Petteri Kaski, Mikko Koivisto
Counting Connected Subgraphs with Maximum-Degree-Aware Sieving. ISAAC (2018)
Petteri Kaski, Juho Lauri, Suhas Thejaswi
Engineering Motif Search for Large Motifs. SEA (2018)
Kustaa Kangas, Petteri Kaski, Janne H. Korhonen, Mikko Koivisto
On the Number of Connected Sets in Bounded Degree Graphs. Electron. J. Comb. 25 (4) (2018)
Per Austrin, Petteri Kaski, Kaie Kubjas
Tensor network complexity of multilinear maps. CoRR (2017)
Andreas Björklund, Petteri Kaski, Ioannis Koutis
Directed Hamiltonicity and Out-Branchings via Generalized Laplacians. ICALP (2017)
Tommi A. Junttila, Matti Karppa, Petteri Kaski, Jukka Kohonen
An adaptive prefix-assignment technique for symmetry reduction. CoRR (2017)
Andreas Björklund, Petteri Kaski, Lukasz Kowalik
Counting Thin Subgraphs via Packings Faster than Meet-in-the-Middle Time. ACM Trans. Algorithms 13 (4) (2017)
Andreas Björklund, Petteri Kaski, R. Ryan Williams
Generalized Kakeya Sets for Polynomial Evaluation and Faster Computation of Fermionants. IPEC (2017)
Tommi A. Junttila, Matti Karppa, Petteri Kaski, Jukka Kohonen
An Adaptive Prefix-Assignment Technique for Symmetry Reduction. SAT (2017)
Andreas Björklund, Thore Husfeldt, Petteri Kaski, Mikko Koivisto
Narrow sieves for parameterized paths and packings. J. Comput. Syst. Sci. 87 (2017)
Per Austrin, Petteri Kaski, Mikko Koivisto, Jesper Nederlof
Sharper Upper Bounds for Unbalanced Uniquely Decodable Code Pairs. CoRR (2016)
Matti Karppa, Petteri Kaski, Jukka Kohonen
A Faster Subquadratic Algorithm for Finding Outlier Correlations. SODA (2016)
Matti Karppa, Petteri Kaski, Jukka Kohonen, Padraig Ó Catháin
Explicit correlation amplifiers for finding outlier correlations in deterministic subquadratic time. CoRR (2016)
Holger Dell, Thore Husfeldt, Bart M. P. Jansen, Petteri Kaski, Christian Komusiewicz, Frances A. Rosamond
The First Parameterized Algorithms and Computational Experiments Challenge. IPEC (2016)
Andreas Björklund, Thore Husfeldt, Petteri Kaski, Mikko Koivisto, Jesper Nederlof, Pekka Parviainen
Fast Zeta Transforms for Lattices with Few Irreducibles. ACM Trans. Algorithms 12 (1) (2016)
Petteri Kaski, Jukka Kohonen, Thomas Westerbäck
Fast Möbius Inversion in Semimodular Lattices and ER-labelable Posets. Electron. J. Comb. 23 (3) (2016)
Per Austrin, Petteri Kaski, Mikko Koivisto, Jesper Nederlof
Sharper upper bounds for unbalanced Uniquely Decodable Code Pairs. ISIT (2016)
Matti Karppa, Petteri Kaski, Jukka Kohonen, Padraig Ó Catháin
Explicit Correlation Amplifiers for Finding Outlier Correlations in Deterministic Subquadratic Time. ESA (2016)
Andreas Björklund, Petteri Kaski, Lukasz Kowalik
Constrained Multilinear Detection and Generalized Graph Motifs. Algorithmica 74 (2) (2016)
Andreas Björklund, Petteri Kaski
How Proofs are Prepared at Camelot: Extended Abstract. PODC (2016)
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) (2016)
Andreas Björklund, Petteri Kaski
How proofs are prepared at Camelot. CoRR (2016)
Per Austrin, Petteri Kaski, Mikko Koivisto, Jesper Nederlof
Dense Subset Sum May Be the Hardest. STACS (2016)
Andreas Björklund, Petteri Kaski, Lukasz Kowalik
Fast Witness Extraction Using a Decision Oracle. CoRR (2015)
Fedor V. Fomin, Petteri Kaski, Daniel Lokshtanov, Fahad Panolan, Saket Saurabh
Parameterized Single-Exponential Time Polynomial Space Algorithm for Steiner Tree. ICALP (1) (2015)
Keren Censor-Hillel, Petteri Kaski, Janne H. Korhonen, Christoph Lenzen, Ami Paz, Jukka Suomela
Algebraic Methods in the Congested Clique. PODC (2015)
Andreas Björklund, Petteri Kaski, Lukasz Kowalik, Juho Lauri
Engineering Motif Search for Large Graphs. ALENEX (2015)
Per Austrin, Petteri Kaski, Mikko Koivisto, Jesper Nederlof
Subset Sum in the Absence of Concentration. STACS (2015)
Keren Censor-Hillel, Petteri Kaski, Janne H. Korhonen, Christoph Lenzen, Ami Paz, Jukka Suomela
Algebraic Methods in the Congested Clique. CoRR (2015)
Petteri Kaski, Patric R. J. Östergård, Alexandru Popa
Enumeration of Steiner triple systems with subsystems. Math. Comput. 84 (296) (2015)
Matti Karppa, Petteri Kaski, Jukka Kohonen
A faster subquadratic algorithm for finding outlier correlations. CoRR (2015)
Per Austrin, Mikko Koivisto, Petteri Kaski, Jesper Nederlof
Dense Subset Sum may be the hardest. CoRR (2015)
Petteri Kaski, André de Souza Medeiros, Patric R. J. Östergård, Ian M. Wanless
Switching in One-Factorisations of Complete Graphs. Electron. J. Comb. 21 (2) (2014)
Andreas Björklund, Petteri Kaski, Lukasz Kowalik
Counting Thin Subgraphs via Packings Faster Than Meet-in-the-Middle Time. SODA (2014)
Andreas Björklund, Petteri Kaski, Lukasz Kowalik
Fast Witness Extraction Using a Decision Oracle. ESA (2014)
Petteri Kaski, Mikko Koivisto, Janne H. Korhonen, Igor S. Sergeev
Fast monotone summation over disjoint sets. Inf. Process. Lett. 114 (5) (2014)
Kustaa Kangas, Petteri Kaski, Mikko Koivisto, Janne H. Korhonen
On the Number of Connected Sets in Bounded Degree Graphs. WG (2014)
Per Austrin, Petteri Kaski, Mikko Koivisto, Jussi Määttä
Space--Time Tradeoffs for Subset Sum: An Improved Worst Case Algorithm CoRR (2013)
Andreas Björklund, Petteri Kaski, Lukasz Kowalik
Probably Optimal Graph Motifs. STACS (2013)
Fedor V. Fomin, Petteri Kaski
Exact exponential algorithms. Commun. ACM 56 (3) (2013)
Magnus Find, Mika Göös, Matti Järvisalo, Petteri Kaski, Mikko Koivisto, Janne H. Korhonen
Separating OR, SUM, and XOR Circuits CoRR (2013)
Andreas Björklund, Petteri Kaski, Lukasz Kowalik
Counting thin subgraphs via packings faster than meet-in-the-middle time. CoRR (2013)
Andreas Björklund, Petteri Kaski
Counting closed trails. Inf. Process. Lett. 113 (1-2) (2013)
Per Austrin, Petteri Kaski, Mikko Koivisto, Jussi Määttä
Space-Time Tradeoffs for Subset Sum: An Improved Worst Case Algorithm. ICALP (1) (2013)
Petteri Kaski, Mikko Koivisto, Jesper Nederlof
Homomorphic Hashing for Sparse Coefficient Extraction. IPEC (2012)
Andreas Björklund, Petteri Kaski, Lukasz Kowalik
Probably Optimal Graph Motifs CoRR (2012)
Petteri Kaski, Mikko Koivisto, Janne H. Korhonen
Fast Monotone Summation over Disjoint Sets CoRR (2012)
Petteri Kaski, Mikko Koivisto, Janne H. Korhonen
Fast Monotone Summation over Disjoint Sets. IPEC (2012)
Matti Järvisalo, Petteri Kaski, Mikko Koivisto, Janne H. Korhonen
Finding Efficient Circuits for Ensemble Computation. SAT (2012)
Andreas Björklund, Thore Husfeldt, Petteri Kaski, Mikko Koivisto
The traveling salesman problem in bounded degree graphs. ACM Trans. Algorithms 8 (2) (2012)
Petteri Kaski, Mikko Koivisto, Jesper Nederlof
Homomorphic Hashing for Sparse Coefficient Extraction CoRR (2012)
Andreas Björklund, Mikko Koivisto, Thore Husfeldt, Jesper Nederlof, Petteri Kaski, Pekka Parviainen
Fast zeta transforms for lattices with few irreducibles. SODA (2012)
Petteri Kaski, Mahdad Khatirinejad, Patric R. J. Östergård
Steiner triple systems satisfying the 4-vertex condition. Des. Codes Cryptogr. 62 (3) (2012)
Charles J. Colbourn, Petteri Kaski, Patric R. J. Östergård, David A. Pike, Olli Pottonen
Nearly Kirkman triple systems of order 18 and Hanani triple systems of order 19. Discret. Math. 311 (10-11) (2011)
Niko Vuokko, Petteri Kaski
Significance of Patterns in Time Series Collections. SDM (2011)
Patrik Floréen, Marja Hassinen, Joel Kaasinen, Petteri Kaski, Topi Musto, Jukka Suomela
Local Approximability of Max-Min and Min-Max Linear Programs. Theory Comput. Syst. 49 (4) (2011)
Petteri Kaski, Veli Mäkinen, Patric R. J. Östergård
The Cycle Switching Graph of the Steiner Triple Systems of Order 19 is Connected. Graphs Comb. 27 (4) (2011)
Andreas Björklund, Thore Husfeldt, Petteri Kaski, Mikko Koivisto
Covering and packing in linear space. Inf. Process. Lett. 111 (21-22) (2011)
Tommi A. Junttila, Petteri Kaski
Conflict Propagation and Component Recursion for Canonical Labeling. TAPAS (2011)
Alexander Hulpke, Petteri Kaski, Patric R. J. Östergård
The number of Latin squares of order 11. Math. Comput. 80 (274) (2011)
Esa Junttila, Petteri Kaski
Segmented nestedness in binary data. SDM (2011)
Andreas Björklund, Thore Husfeldt, Petteri Kaski, Mikko Koivisto
Evaluation of permanents in rings and semirings. Inf. Process. Lett. 110 (20) (2010)
Patrik Floréen, Petteri Kaski, Valentin Polishchuk, Jukka Suomela
Almost Stable Matchings by Truncating the Gale-Shapley Algorithm. Algorithmica 58 (1) (2010)
Patrik Floréen, Petteri Kaski, Valentin Polishchuk, Jukka Suomela
Brief announcement: distributed almost stable marriage. PODC (2010)
Andreas Björklund, Thore Husfeldt, Petteri Kaski, Mikko Koivisto
Covering and Packing in Linear Space. ICALP (1) (2010)
Andreas Björklund, Thore Husfeldt, Petteri Kaski, Mikko Koivisto
Narrow sieves for parameterized paths and packings CoRR (2010)
Tommi A. Junttila, Petteri Kaski
Exact Cover via Satisfiability: An Empirical Study. CP (2010)
Niko Vuokko, Petteri Kaski
Testing the Significance of Patterns in Data with Cluster Structure. ICDM (2010)
Andreas Björklund, Thore Husfeldt, Petteri Kaski, Mikko Koivisto
Trimmed Moebius Inversion and Graphs of Bounded Degree. Theory Comput. Syst. 47 (3) (2010)
Charles J. Colbourn, Anthony D. Forbes, Mike J. Grannell, Terry S. Griggs, Petteri Kaski, Patric R. J. Östergård, David A. Pike, Olli Pottonen
Properties of the Steiner Triple Systems of Order 19. Electron. J. Comb. 17 (1) (2010)
Andreas Björklund, Thore Husfeldt, Petteri Kaski, Mikko Koivisto
Counting Paths and Packings in Halves. ESA (2009)
Patrik Floréen, Joel Kaasinen, Petteri Kaski, Jukka Suomela
An optimal local approximation algorithm for max-min linear programs. SPAA (2009)
Andreas Björklund, Thore Husfeldt, Petteri Kaski, Mikko Koivisto
Counting Paths and Packings in Halves CoRR (2009)

Petteri Kaski.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Petteri Kaski