Petteri Kaski

Mateusz Michalek

CoRR, 2024

Chromatic number in 1.9999n time? Fast deterministic set partitioning under the asymptotic rank conjecture.

[BibT_eX]

[DOI]

CoRR, 2024

The Asymptotic Rank Conjecture and the Set Cover Conjecture Are Not Both True.

[BibT_eX]

[DOI]

Proceedings of the 56th Annual ACM Symposium on Theory of Computing, 2024

Another Hamiltonian Cycle in Bipartite Pfaffian Graphs.

[BibT_eX]

[DOI]

Jesper Nederlof

Proceedings of the 51st International Colloquium on Automata, Languages, and Programming, 2024

2022

Tensor Network Complexity of Multilinear Maps.

[BibT_eX]

[DOI]

Per Austrin

Kaie Kubjas

Adv. Math. Commun., 2022

The shortest even cycle problem is tractable.

[BibT_eX]

[DOI]

Thore Husfeldt

Proceedings of the STOC '22: 54th Annual ACM SIGACT Symposium on Theory of Computing, Rome, Italy, June 20, 2022

Trustworthy Monte Carlo.

[BibT_eX]

[DOI]

Juha Harviainen

Proceedings of the Advances in Neural Information Processing Systems 35: Annual Conference on Neural Information Processing Systems 2022, 2022

2021

The Fine-Grained Complexity of Computing the Tutte Polynomial of a Linear Matroid.

[BibT_eX]

[DOI]

Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms, 2021

Counting Short Vector Pairs by Inner Product and Relations to the Permanent.

[BibT_eX]

[DOI]

Proceedings of the 48th International Colloquium on Automata, Languages, and Programming, 2021

2020

An adaptive prefix-assignment technique for symmetry reduction.

[BibT_eX]

[DOI]

J. Symb. Comput., 2020

Explicit Correlation Amplifiers for Finding Outlier Correlations in Deterministic Subquadratic Time.

[BibT_eX]

[DOI]

Algorithmica, 2020

Error-Correcting and Verifiable Parallel Inference in Graphical Models.

[BibT_eX]

[DOI]

Negin Karimi

Proceedings of the Thirty-Fourth AAAI Conference on Artificial Intelligence, 2020

2019

Parameterized Single-Exponential Time Polynomial Space Algorithm for Steiner Tree.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2019

Algebraic methods in the congested clique.

[BibT_eX]

[DOI]

Distributed Comput., 2019

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

[BibT_eX]

[DOI]

Matti Karppa

CoRR, 2019

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

[BibT_eX]

[DOI]

Ryan Williams

Algorithmica, 2019

Probabilistic Tensors and Opportunistic Boolean Matrix Multiplication.

[BibT_eX]

[DOI]

Matti Karppa

Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2019

Solving Systems of Polynomial Equations over GF(2) by a Parity-Counting Self-Reduction.

[BibT_eX]

[DOI]

Ryan Williams

Proceedings of the 46th International Colloquium on Automata, Languages, and Programming, 2019

2018

Sharper Upper Bounds for Unbalanced Uniquely Decodable Code Pairs.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2018

A Faster Subquadratic Algorithm for Finding Outlier Correlations.

[BibT_eX]

[DOI]

Matti Karppa

Jukka Kohonen

ACM Trans. Algorithms, 2018

On the Number of Connected Sets in Bounded Degree Graphs.

[BibT_eX]

[DOI]

Electron. J. Comb., 2018

Engineering Motif Search for Large Motifs.

[BibT_eX]

[DOI]

Juho Lauri

Suhas Thejaswi

Proceedings of the 17th International Symposium on Experimental Algorithms, 2018

Counting Connected Subgraphs with Maximum-Degree-Aware Sieving.

[BibT_eX]

[DOI]

Proceedings of the 29th International Symposium on Algorithms and Computation, 2018

Engineering a Delegatable and Error-Tolerant Algorithm for Counting Small Subgraphs.

[BibT_eX]

[DOI]

Proceedings of the Twentieth Workshop on Algorithm Engineering and Experiments, 2018

2017

Counting Thin Subgraphs via Packings Faster than Meet-in-the-Middle Time.

[BibT_eX]

[DOI]

ACM Trans. Algorithms, 2017

Narrow sieves for parameterized paths and packings.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 2017

Directed Hamiltonicity and Out-Branchings via Generalized Laplacians.

[BibT_eX]

[DOI]

Ioannis Koutis

Proceedings of the 44th International Colloquium on Automata, Languages, and Programming, 2017

2016

Fast Subset Convolution.

[BibT_eX]

[DOI]

Encyclopedia of Algorithms, 2016

Fast Zeta Transforms for Lattices with Few Irreducibles.

[BibT_eX]

[DOI]

ACM Trans. Algorithms, 2016

Separating OR, SUM, and XOR circuits.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 2016

How proofs are prepared at Camelot.

[BibT_eX]

[DOI]

CoRR, 2016

Fast Möbius Inversion in Semimodular Lattices and ER-labelable Posets.

[BibT_eX]

[DOI]

Jukka Kohonen

Thomas Westerbäck

Electron. J. Comb., 2016

Constrained Multilinear Detection and Generalized Graph Motifs.

[BibT_eX]

[DOI]

Algorithmica, 2016

Dense Subset Sum May Be the Hardest.

[BibT_eX]

[DOI]

Proceedings of the 33rd Symposium on Theoretical Aspects of Computer Science, 2016

How Proofs are Prepared at Camelot: Extended Abstract.

[BibT_eX]

[DOI]

Proceedings of the 2016 ACM Symposium on Principles of Distributed Computing, 2016

The First Parameterized Algorithms and Computational Experiments Challenge.

[BibT_eX]

[DOI]

Christian Komusiewicz

Frances A. Rosamond

Proceedings of the 11th International Symposium on Parameterized and Exact Computation, 2016

2015

Enumeration of Steiner triple systems with subsystems.

[BibT_eX]

[DOI]

Alexandru Popa

Math. Comput., 2015

Subset Sum in the Absence of Concentration.

[BibT_eX]

[DOI]

Proceedings of the 32nd International Symposium on Theoretical Aspects of Computer Science, 2015

Engineering Motif Search for Large Graphs.

[BibT_eX]

[DOI]

Proceedings of the Seventeenth Workshop on Algorithm Engineering and Experiments, 2015

2014

Fast monotone summation over disjoint sets.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2014

Switching in One-Factorisations of Complete Graphs.

[BibT_eX]

[DOI]

André de Souza Medeiros

Ian M. Wanless

Electron. J. Comb., 2014

Fast Witness Extraction Using a Decision Oracle.

[BibT_eX]

[DOI]

Proceedings of the Algorithms - ESA 2014, 2014

2013

Counting closed trails.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2013

Exact exponential algorithms.

[BibT_eX]

[DOI]

Fedor V. Fomin

Commun. ACM, 2013

Probably Optimal Graph Motifs.

[BibT_eX]

[DOI]

Proceedings of the 30th International Symposium on Theoretical Aspects of Computer Science, 2013

Space-Time Tradeoffs for Subset Sum: An Improved Worst Case Algorithm.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages, and Programming - 40th International Colloquium, 2013

2012

The traveling salesman problem in bounded degree graphs.

[BibT_eX]

[DOI]

ACM Trans. Algorithms, 2012

Steiner triple systems satisfying the 4-vertex condition.

[BibT_eX]

[DOI]

Mahdad Khatirinejad

Des. Codes Cryptogr., 2012

Finding Efficient Circuits for Ensemble Computation.

[BibT_eX]

[DOI]

Proceedings of the Theory and Applications of Satisfiability Testing - SAT 2012, 2012

Homomorphic Hashing for Sparse Coefficient Extraction.

[BibT_eX]

[DOI]

Jesper Nederlof

Proceedings of the Parameterized and Exact Computation - 7th International Symposium, 2012

Fast Monotone Summation over Disjoint Sets.

[BibT_eX]

[DOI]

Janne H. Korhonen

Proceedings of the Parameterized and Exact Computation - 7th International Symposium, 2012

2011

Local Approximability of Max-Min and Min-Max Linear Programs.

[BibT_eX]

[DOI]

Theory Comput. Syst., 2011

The number of Latin squares of order 11.

[BibT_eX]

[DOI]

Alexander Hulpke

Math. Comput., 2011

Covering and packing in linear space.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2011

The Cycle Switching Graph of the Steiner Triple Systems of Order 19 is Connected.

[BibT_eX]

[DOI]

Veli Mäkinen

Graphs Comb., 2011

Nearly Kirkman triple systems of order 18 and Hanani triple systems of order 19.

[BibT_eX]

[DOI]

Charles J. Colbourn

David A. Pike

Olli Pottonen

Discret. Math., 2011

Conflict Propagation and Component Recursion for Canonical Labeling.

[BibT_eX]

[DOI]

Tommi A. Junttila

Proceedings of the Theory and Practice of Algorithms in (Computer) Systems, 2011

Significance of Patterns in Time Series Collections.

[BibT_eX]

[DOI]

Niko Vuokko

Proceedings of the Eleventh SIAM International Conference on Data Mining, 2011

Segmented nestedness in binary data.

[BibT_eX]

[DOI]

Esa Junttila

Proceedings of the Eleventh SIAM International Conference on Data Mining, 2011

2010

Trimmed Moebius Inversion and Graphs of Bounded Degree.

[BibT_eX]

[DOI]

Theory Comput. Syst., 2010

Evaluation of permanents in rings and semirings.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2010

Properties of the Steiner Triple Systems of Order 19.

[BibT_eX]

[DOI]

David A. Pike

Olli Pottonen

Electron. J. Comb., 2010

Almost Stable Matchings by Truncating the Gale-Shapley Algorithm.

[BibT_eX]

[DOI]

Algorithmica, 2010

Brief announcement: distributed almost stable marriage.

[BibT_eX]

[DOI]

Proceedings of the 29th Annual ACM Symposium on Principles of Distributed Computing, 2010

Testing the Significance of Patterns in Data with Cluster Structure.

[BibT_eX]

[DOI]

Niko Vuokko

Proceedings of the ICDM 2010, 2010

Exact Cover via Satisfiability: An Empirical Study.

[BibT_eX]

[DOI]

Tommi A. Junttila

Proceedings of the Principles and Practice of Constraint Programming - CP 2010, 2010

2009

On evaluation of permanents

[BibT_eX]

[DOI]

CoRR, 2009

An optimal local approximation algorithm for max-min linear programs.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

Proceedings of the Algorithms, 2009

2008

Circumspect descent prevails in solving random constraint satisfaction problems.

[BibT_eX]

[DOI]

Supriya Krishnamurthy

Pekka Orponen

Sakari Seitz

Proc. Natl. Acad. Sci. USA, 2008

Steiner triple systems of order 19 and 21 with subsystems of order 7.

[BibT_eX]

[DOI]

Svetlana Topalova

Rosen Zlatarski

Discret. Math., 2008

Almost stable matchings in constant time

[BibT_eX]

[DOI]

CoRR, 2008

The fast intersection transform with applications to counting paths

[BibT_eX]

[DOI]

CoRR, 2008

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

[BibT_eX]

[DOI]

CoRR, 2008

Coordinating Concurrent Transmissions: A Constant-Factor Approximation of Maximum-Weight Independent Set in Local Conflict Graphs.

[BibT_eX]

[DOI]

Aleksi Penttinen

Jukka Suomela

Ad Hoc Sens. Wirel. Networks, 2008

Approximating max-min linear programs with local algorithms.

[BibT_eX]

[DOI]

Proceedings of the 22nd IEEE International Symposium on Parallel and Distributed Processing, 2008

The Travelling Salesman Problem in Bounded Degree Graphs.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages and Programming, 35th International Colloquium, 2008

Computing the Tutte Polynomial in Vertex-Exponential Time.

[BibT_eX]

[DOI]

Proceedings of the 49th Annual IEEE Symposium on Foundations of Computer Science, 2008

08431 Open Problems - Moderately Exponential Time Algorithms.

[BibT_eX]

[DOI]

Johan M. M. van Rooij

Ryan Williams

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

Tight Local Approximation Results for Max-Min Linear Programs.

[BibT_eX]

[DOI]

Proceedings of the Algorithmic Aspects of Wireless Sensor Networks, 2008

2007

There exists no symmetric configuration with 33 points and line size 6.

[BibT_eX]

[DOI]

Australas. J Comb., 2007

Fourier meets möbius: fast subset convolution.

[BibT_eX]

[DOI]

Proceedings of the 39th Annual ACM Symposium on Theory of Computing, 2007

A distributed approximation scheme for sleep sceduling in sensor networks.

[BibT_eX]

[DOI]

Patrik Floréen

Jukka Suomela

Proceedings of the Fourth Annual IEEE Communications Society Conference on Sensor, 2007

Local Approximation Algorithms for Scheduling Problems in Sensor Networks.

[BibT_eX]

[DOI]

Proceedings of the Algorithmic Aspects of Wireless Sensor Networks, 2007

Engineering an Efficient Canonical Labeling Tool for Large and Sparse Graphs.

[BibT_eX]

[DOI]

Tommi A. Junttila

Proceedings of the Nine Workshop on Algorithm Engineering and Experiments, 2007

2006

Hard Satisfiable Clause Sets for Benchmarking Equivalence Reasoning Techniques.

[BibT_eX]

[DOI]

J. Satisf. Boolean Model. Comput., 2006

The Steiner quadruple systems of order 16.

[BibT_eX]

[DOI]

Olli Pottonen

J. Comb. Theory A, 2006

On the coexistence of conference matrices and near resolvable 2-(2k+1, k, k-1) designs.

[BibT_eX]

[DOI]

Malcolm Greig

Harri Haanpää

J. Comb. Theory A, 2006

There are exactly five biplanes with k=11.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2006

Barriers and local minima in energy landscapes of stochastic local search

[BibT_eX]

[DOI]

CoRR, 2006

2005

Algorithms for classification of combinatorial objects.

[BibT_eX]

[DOI]

PhD thesis, 2005

Exact and approximate balanced data gathering in energy-constrained sensor networks.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2005

Isomorph-Free Exhaustive Generation of Designs with Prescribed Groups of Automorphisms.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2005

Lifetime maximization for multicasting in energy-constrained wireless networks.

[BibT_eX]

[DOI]

IEEE J. Sel. Areas Commun., 2005

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

[BibT_eX]

[DOI]

Harri Haanpää

Des. Codes Cryptogr., 2005

One-Factorizations of Regular Graphs of Order 12.

[BibT_eX]

[DOI]

Electron. J. Comb., 2005

2004

The Steiner triple systems of order 19.

[BibT_eX]

[DOI]

Math. Comput., 2004

Packing Steiner trees with identical terminal sets.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2004

Miscellaneous classification results for 2-designs.

[BibT_eX]

[DOI]

Discret. Math., 2004

Enumeration of balanced ternary designs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2004

Balanced Data Gathering in Energy-Constrained Sensor Networks.

[BibT_eX]

[DOI]

Proceedings of the Algorithmic Aspects of Wireless Sensor Networks: First International Workshop, 2004

2003

Multicast time maximization in energy constrained wireless networks.

[BibT_eX]

[DOI]

Proceedings of the DIALM-POMC Joint Workshop on Foundations of Mobile Computing, 2003

2002

Enumeration of 2-(9, 3, lambda) Designs and Their Resolutions.

[BibT_eX]