Petteri Kaski

According to our database1, Petteri Kaski authored at least 94 papers between 2002 and 2020.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2020
An adaptive prefix-assignment technique for symmetry reduction.
J. Symb. Comput., 2020

2019
Parameterized Single-Exponential Time Polynomial Space Algorithm for Steiner Tree.
SIAM J. Discrete Math., 2019

Algebraic methods in the congested clique.
Distributed Computing, 2019

Engineering Boolean Matrix Multiplication for Multiple-Accelerator Shared-Memory Architectures.
CoRR, 2019

Generalized Kakeya sets for polynomial evaluation and faster computation of fermionants.
Algorithmica, 2019

Probabilistic Tensors and Opportunistic Boolean Matrix Multiplication.
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2019

Tensor Network Complexity of Multilinear Maps.
Proceedings of the 10th Innovations in Theoretical Computer Science Conference, 2019

Solving Systems of Polynomial Equations over GF(2) by a Parity-Counting Self-Reduction.
Proceedings of the 46th International Colloquium on Automata, Languages, and Programming, 2019

2018
Sharper Upper Bounds for Unbalanced Uniquely Decodable Code Pairs.
IEEE Trans. Information Theory, 2018

A Faster Subquadratic Algorithm for Finding Outlier Correlations.
ACM Trans. Algorithms, 2018

On the Number of Connected Sets in Bounded Degree Graphs.
Electr. J. Comb., 2018

Engineering Motif Search for Large Motifs.
Proceedings of the 17th International Symposium on Experimental Algorithms, 2018

Counting Connected Subgraphs with Maximum-Degree-Aware Sieving.
Proceedings of the 29th International Symposium on Algorithms and Computation, 2018

Engineering a Delegatable and Error-Tolerant Algorithm for Counting Small Subgraphs.
Proceedings of the Twentieth Workshop on Algorithm Engineering and Experiments, 2018

2017
Counting Thin Subgraphs via Packings Faster than Meet-in-the-Middle Time.
ACM Trans. Algorithms, 2017

Narrow sieves for parameterized paths and packings.
J. Comput. Syst. Sci., 2017

Directed Hamiltonicity and Out-Branchings via Generalized Laplacians.
Proceedings of the 44th International Colloquium on Automata, Languages, and Programming, 2017

2016
Fast Subset Convolution.
Encyclopedia of Algorithms, 2016

Fast Zeta Transforms for Lattices with Few Irreducibles.
ACM Trans. Algorithms, 2016

Separating OR, SUM, and XOR circuits.
J. Comput. Syst. Sci., 2016

How proofs are prepared at Camelot.
CoRR, 2016

Fast Möbius Inversion in Semimodular Lattices and ER-labelable Posets.
Electr. J. Comb., 2016

Constrained Multilinear Detection and Generalized Graph Motifs.
Algorithmica, 2016

Dense Subset Sum May Be the Hardest.
Proceedings of the 33rd Symposium on Theoretical Aspects of Computer Science, 2016

How Proofs are Prepared at Camelot: Extended Abstract.
Proceedings of the 2016 ACM Symposium on Principles of Distributed Computing, 2016

The First Parameterized Algorithms and Computational Experiments Challenge.
Proceedings of the 11th International Symposium on Parameterized and Exact Computation, 2016

Explicit Correlation Amplifiers for Finding Outlier Correlations in Deterministic Subquadratic Time.
Proceedings of the 24th Annual European Symposium on Algorithms, 2016

2015
Enumeration of Steiner triple systems with subsystems.
Math. Comput., 2015

Subset Sum in the Absence of Concentration.
Proceedings of the 32nd International Symposium on Theoretical Aspects of Computer Science, 2015

Engineering Motif Search for Large Graphs.
Proceedings of the Seventeenth Workshop on Algorithm Engineering and Experiments, 2015

2014
Fast monotone summation over disjoint sets.
Inf. Process. Lett., 2014

Switching in One-Factorisations of Complete Graphs.
Electr. J. Comb., 2014

Fast Witness Extraction Using a Decision Oracle.
Proceedings of the Algorithms - ESA 2014, 2014

2013
Counting closed trails.
Inf. Process. Lett., 2013

Exact exponential algorithms.
Commun. ACM, 2013

Probably Optimal Graph Motifs.
Proceedings of the 30th International Symposium on Theoretical Aspects of Computer Science, 2013

Space-Time Tradeoffs for Subset Sum: An Improved Worst Case Algorithm.
Proceedings of the Automata, Languages, and Programming - 40th International Colloquium, 2013

2012
The traveling salesman problem in bounded degree graphs.
ACM Trans. Algorithms, 2012

Steiner triple systems satisfying the 4-vertex condition.
Des. Codes Cryptogr., 2012

Finding Efficient Circuits for Ensemble Computation.
Proceedings of the Theory and Applications of Satisfiability Testing - SAT 2012, 2012

Homomorphic Hashing for Sparse Coefficient Extraction.
Proceedings of the Parameterized and Exact Computation - 7th International Symposium, 2012

Fast Monotone Summation over Disjoint Sets.
Proceedings of the Parameterized and Exact Computation - 7th International Symposium, 2012

2011
Local Approximability of Max-Min and Min-Max Linear Programs.
Theory Comput. Syst., 2011

The number of Latin squares of order 11.
Math. Comput., 2011

Covering and packing in linear space.
Inf. Process. Lett., 2011

The Cycle Switching Graph of the Steiner Triple Systems of Order 19 is Connected.
Graphs and Combinatorics, 2011

Nearly Kirkman triple systems of order 18 and Hanani triple systems of order 19.
Discret. Math., 2011

Conflict Propagation and Component Recursion for Canonical Labeling.
Proceedings of the Theory and Practice of Algorithms in (Computer) Systems, 2011

Significance of Patterns in Time Series Collections.
Proceedings of the Eleventh SIAM International Conference on Data Mining, 2011

Segmented nestedness in binary data.
Proceedings of the Eleventh SIAM International Conference on Data Mining, 2011

2010
Trimmed Moebius Inversion and Graphs of Bounded Degree.
Theory Comput. Syst., 2010

Evaluation of permanents in rings and semirings.
Inf. Process. Lett., 2010

Properties of the Steiner Triple Systems of Order 19.
Electr. J. Comb., 2010

Almost Stable Matchings by Truncating the Gale-Shapley Algorithm.
Algorithmica, 2010

Brief announcement: distributed almost stable marriage.
Proceedings of the 29th Annual ACM Symposium on Principles of Distributed Computing, 2010

Testing the Significance of Patterns in Data with Cluster Structure.
Proceedings of the ICDM 2010, 2010

Exact Cover via Satisfiability: An Empirical Study.
Proceedings of the Principles and Practice of Constraint Programming - CP 2010, 2010

2009
On evaluation of permanents
CoRR, 2009

An optimal local approximation algorithm for max-min linear programs.
Proceedings of the SPAA 2009: Proceedings of the 21st Annual ACM Symposium on Parallelism in Algorithms and Architectures, 2009

Counting Paths and Packings in Halves.
Proceedings of the Algorithms, 2009

2008
Circumspect descent prevails in solving random constraint satisfaction problems.
Proc. Natl. Acad. Sci. U.S.A., 2008

Steiner triple systems of order 19 and 21 with subsystems of order 7.
Discret. Math., 2008

Almost stable matchings in constant time
CoRR, 2008

The fast intersection transform with applications to counting paths
CoRR, 2008

Local approximation algorithms for a class of 0/1 max-min linear programs
CoRR, 2008

Coordinating Concurrent Transmissions: A Constant-Factor Approximation of Maximum-Weight Independent Set in Local Conflict Graphs.
Ad Hoc & Sensor Wireless Networks, 2008

Approximating max-min linear programs with local algorithms.
Proceedings of the 22nd IEEE International Symposium on Parallel and Distributed Processing, 2008

The Travelling Salesman Problem in Bounded Degree Graphs.
Proceedings of the Automata, Languages and Programming, 35th International Colloquium, 2008

Computing the Tutte Polynomial in Vertex-Exponential Time.
Proceedings of the 49th Annual IEEE Symposium on Foundations of Computer Science, 2008

08431 Open Problems - Moderately Exponential Time Algorithms.
Proceedings of the Moderately Exponential Time Algorithms, 19.10. - 24.10.2008, 2008

Tight Local Approximation Results for Max-Min Linear Programs.
Proceedings of the Algorithmic Aspects of Wireless Sensor Networks, 2008

2007
There exists no symmetric configuration with 33 points and line size 6.
Australasian J. Combinatorics, 2007

Fourier meets möbius: fast subset convolution.
Proceedings of the 39th Annual ACM Symposium on Theory of Computing, 2007

A distributed approximation scheme for sleep sceduling in sensor networks.
Proceedings of the Fourth Annual IEEE Communications Society Conference on Sensor, 2007

Local Approximation Algorithms for Scheduling Problems in Sensor Networks.
Proceedings of the Algorithmic Aspects of Wireless Sensor Networks, 2007

Engineering an Efficient Canonical Labeling Tool for Large and Sparse Graphs.
Proceedings of the Nine Workshop on Algorithm Engineering and Experiments, 2007

2006
Hard Satisfiable Clause Sets for Benchmarking Equivalence Reasoning Techniques.
J. Satisf. Boolean Model. Comput., 2006

The Steiner quadruple systems of order 16.
J. Comb. Theory, Ser. A, 2006

On the coexistence of conference matrices and near resolvable 2-(2k+1, k, k-1) designs.
J. Comb. Theory, Ser. A, 2006

There are exactly five biplanes with k=11.
Electron. Notes Discret. Math., 2006

Barriers and local minima in energy landscapes of stochastic local search
CoRR, 2006

2005
Algorithms for classification of combinatorial objects.
PhD thesis, 2005

Exact and approximate balanced data gathering in energy-constrained sensor networks.
Theor. Comput. Sci., 2005

Isomorph-Free Exhaustive Generation of Designs with Prescribed Groups of Automorphisms.
SIAM J. Discrete Math., 2005

Lifetime maximization for multicasting in energy-constrained wireless networks.
IEEE Journal on Selected Areas in Communications, 2005

The Near Resolvable 2-(13, 4, 3) Designs and Thirteen-Player Whist Tournaments.
Des. Codes Cryptogr., 2005

One-Factorizations of Regular Graphs of Order 12.
Electr. J. Comb., 2005

2004
The Steiner triple systems of order 19.
Math. Comput., 2004

Packing Steiner trees with identical terminal sets.
Inf. Process. Lett., 2004

Miscellaneous classification results for 2-designs.
Discret. Math., 2004

Enumeration of balanced ternary designs.
Discret. Appl. Math., 2004

Balanced Data Gathering in Energy-Constrained Sensor Networks.
Proceedings of the Algorithmic Aspects of Wireless Sensor Networks: First International Workshop, 2004

2003
Multicast time maximization in energy constrained wireless networks.
Proceedings of the DIALM-POMC Joint Workshop on Foundations of Mobile Computing, 2003

2002
Enumeration of 2-(9, 3, lambda) Designs and Their Resolutions.
Des. Codes Cryptogr., 2002


  Loading...