Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDPetteri Kaski
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[c56]Andreas Björklund, Petteri Kaski, Jesper Nederlof:
Another Hamiltonian Cycle in Bipartite Pfaffian Graphs. ICALP 2024: 26:1-26:20- [c55]Andreas Björklund
, Petteri Kaski:
The Asymptotic Rank Conjecture and the Set Cover Conjecture Are Not Both True. STOC 2024: 859-870 - [i38]Andreas Björklund, Radu Curticapean, Thore Husfeldt, Petteri Kaski, Kevin Pratt:
Chromatic number in 1.9999n time? Fast deterministic set partitioning under the asymptotic rank conjecture. CoRR abs/2404.04987 (2024) - [i37]Petteri Kaski, Mateusz Michalek:
A universal sequence of tensors for the asymptotic rank conjecture. CoRR abs/2404.06427 (2024) - 2023
- [i36]Andreas Björklund, Petteri Kaski, Jesper Nederlof:
Another Hamiltonian Cycle in Bipartite Pfaffian Graphs. CoRR abs/2308.01574 (2023) - [i35]Andreas Björklund, Petteri Kaski:
The Asymptotic Rank Conjecture and the Set Cover Conjecture are not Both True. CoRR abs/2310.11926 (2023) - 2022
- [j49]Per Austrin, Petteri Kaski, Kaie Kubjas:
Tensor Network Complexity of Multilinear Maps. Theory Comput. 18: 1-54 (2022) - [c54]Juha Harviainen, Mikko Koivisto, Petteri Kaski:
Trustworthy Monte Carlo. NeurIPS 2022 - [c53]Andreas Björklund, Thore Husfeldt, Petteri Kaski:
The shortest even cycle problem is tractable. STOC 2022: 117-130 - 2021
- [c52]Andreas Björklund, Petteri Kaski:
Counting Short Vector Pairs by Inner Product and Relations to the Permanent. ICALP 2021: 29:1-29:21 - [c51]Andreas Björklund, Petteri Kaski:
The Fine-Grained Complexity of Computing the Tutte Polynomial of a Linear Matroid. SODA 2021: 2333-2345 - [i34]Andreas Björklund, Thore Husfeldt, Petteri Kaski:
The Shortest Even Cycle Problem is Tractable. CoRR abs/2111.02992 (2021) - 2020
- [j48]Matti Karppa, Petteri Kaski, Jukka Kohonen, Padraig Ó Catháin:
Explicit Correlation Amplifiers for Finding Outlier Correlations in Deterministic Subquadratic Time. Algorithmica 82(11): 3306-3337 (2020) - [j47]Tommi A. Junttila, Matti Karppa, Petteri Kaski, Jukka Kohonen:
An adaptive prefix-assignment technique for symmetry reduction. J. Symb. Comput. 99: 21-49 (2020) - [c50]Negin Karimi, Petteri Kaski, Mikko Koivisto:
Error-Correcting and Verifiable Parallel Inference in Graphical Models. AAAI 2020: 10194-10201 - [i33]Andreas Björklund, Petteri Kaski:
The Fine-Grained Complexity of Computing the Tutte Polynomial of a Linear Matroid. CoRR abs/2003.03595 (2020) - [i32]Andreas Björklund, Petteri Kaski:
Counting Short Vector Pairs by Inner Product and Relations to the Permanent. CoRR abs/2007.14092 (2020)
2010 – 2019
- 2019
- [j46]Andreas Björklund, Petteri Kaski, Ryan Williams:
Generalized Kakeya sets for polynomial evaluation and faster computation of fermionants. Algorithmica 81(10): 4010-4028 (2019) - [j45]Keren Censor-Hillel, Petteri Kaski, Janne H. Korhonen, Christoph Lenzen, Ami Paz, Jukka Suomela:
Algebraic methods in the congested clique. Distributed Comput. 32(6): 461-478 (2019) - [j44]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): 327-345 (2019) - [c49]Andreas Björklund, Petteri Kaski, Ryan Williams:
Solving Systems of Polynomial Equations over GF(2) by a Parity-Counting Self-Reduction. ICALP 2019: 26:1-26:13 - [c48]Per Austrin, Petteri Kaski, Kaie Kubjas:
Tensor Network Complexity of Multilinear Maps. ITCS 2019: 7:1-7:21 - [c47]Matti Karppa, Petteri Kaski:
Probabilistic Tensors and Opportunistic Boolean Matrix Multiplication. SODA 2019: 496-515 - [i31]Matti Karppa, Petteri Kaski:
Engineering Boolean Matrix Multiplication for Multiple-Accelerator Shared-Memory Architectures. CoRR abs/1909.01554 (2019) - 2018
- [j43]Kustaa Kangas, Petteri Kaski, Janne H. Korhonen, Mikko Koivisto:
On the Number of Connected Sets in Bounded Degree Graphs. Electron. J. Comb. 25(4): 4 (2018) - [j42]Matti Karppa, Petteri Kaski, Jukka Kohonen:
A Faster Subquadratic Algorithm for Finding Outlier Correlations. ACM Trans. Algorithms 14(3): 31:1-31:26 (2018) - [j41]Per Austrin, Petteri Kaski, Mikko Koivisto, Jesper Nederlof:
Sharper Upper Bounds for Unbalanced Uniquely Decodable Code Pairs. IEEE Trans. Inf. Theory 64(2): 1368-1373 (2018) - [c46]Petteri Kaski:
Engineering a Delegatable and Error-Tolerant Algorithm for Counting Small Subgraphs. ALENEX 2018: 184-198 - [c45]Andreas Björklund, Thore Husfeldt, Petteri Kaski, Mikko Koivisto:
Counting Connected Subgraphs with Maximum-Degree-Aware Sieving. ISAAC 2018: 17:1-17:12 - [c44]Petteri Kaski, Juho Lauri, Suhas Thejaswi:
Engineering Motif Search for Large Motifs. SEA 2018: 28:1-28:19 - 2017
- [j40]Andreas Björklund, Thore Husfeldt, Petteri Kaski, Mikko Koivisto:
Narrow sieves for parameterized paths and packings. J. Comput. Syst. Sci. 87: 119-139 (2017) - [j39]Andreas Björklund, Petteri Kaski, Lukasz Kowalik:
Counting Thin Subgraphs via Packings Faster than Meet-in-the-Middle Time. ACM Trans. Algorithms 13(4): 48:1-48:26 (2017) - [c43]Andreas Björklund, Petteri Kaski, Ioannis Koutis:
Directed Hamiltonicity and Out-Branchings via Generalized Laplacians. ICALP 2017: 91:1-91:14 - [c42]Andreas Björklund, Petteri Kaski, R. Ryan Williams:
Generalized Kakeya Sets for Polynomial Evaluation and Faster Computation of Fermionants. IPEC 2017: 6:1-6:13 - [c41]Tommi A. Junttila, Matti Karppa, Petteri Kaski, Jukka Kohonen:
An Adaptive Prefix-Assignment Technique for Symmetry Reduction. SAT 2017: 101-118 - [i30]Tommi A. Junttila, Matti Karppa, Petteri Kaski, Jukka Kohonen:
An adaptive prefix-assignment technique for symmetry reduction. CoRR abs/1706.08325 (2017) - [i29]Per Austrin, Petteri Kaski, Kaie Kubjas:
Tensor network complexity of multilinear maps. CoRR abs/1712.09630 (2017) - 2016
- [j38]Andreas Björklund, Petteri Kaski, Lukasz Kowalik:
Constrained Multilinear Detection and Generalized Graph Motifs. Algorithmica 74(2): 947-967 (2016) - [j37]Petteri Kaski, Jukka Kohonen, Thomas Westerbäck:
Fast Möbius Inversion in Semimodular Lattices and ER-labelable Posets. Electron. J. Comb. 23(3): 3 (2016) - [j36]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): 793-801 (2016) - [j35]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): 4:1-4:19 (2016) - [c40]Matti Karppa, Petteri Kaski, Jukka Kohonen, Padraig Ó Catháin:
Explicit Correlation Amplifiers for Finding Outlier Correlations in Deterministic Subquadratic Time. ESA 2016: 52:1-52:17 - [c39]Per Austrin, Petteri Kaski, Mikko Koivisto, Jesper Nederlof:
Sharper upper bounds for unbalanced Uniquely Decodable Code Pairs. ISIT 2016: 335-339 - [c38]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: 30:1-30:9 - [c37]Andreas Björklund, Petteri Kaski:
How Proofs are Prepared at Camelot: Extended Abstract. PODC 2016: 391-400 - [c36]Matti Karppa, Petteri Kaski, Jukka Kohonen:
A Faster Subquadratic Algorithm for Finding Outlier Correlations. SODA 2016: 1288-1305 - [c35]Per Austrin, Petteri Kaski, Mikko Koivisto, Jesper Nederlof:
Dense Subset Sum May Be the Hardest. STACS 2016: 13:1-13:14 - [r1]Petteri Kaski:
Fast Subset Convolution. Encyclopedia of Algorithms 2016: 735-738 - [i28]Andreas Björklund, Petteri Kaski:
How proofs are prepared at Camelot. CoRR abs/1602.01295 (2016) - [i27]Per Austrin, Petteri Kaski, Mikko Koivisto, Jesper Nederlof:
Sharper Upper Bounds for Unbalanced Uniquely Decodable Code Pairs. CoRR abs/1605.00462 (2016) - [i26]Matti Karppa, Petteri Kaski, Jukka Kohonen, Padraig Ó Catháin:
Explicit correlation amplifiers for finding outlier correlations in deterministic subquadratic time. CoRR abs/1606.05608 (2016) - 2015
- [j34]Petteri Kaski, Patric R. J. Östergård, Alexandru Popa:
Enumeration of Steiner triple systems with subsystems. Math. Comput. 84(296): 3051-3067 (2015) - [c34]Andreas Björklund, Petteri Kaski, Lukasz Kowalik, Juho Lauri:
Engineering Motif Search for Large Graphs. ALENEX 2015: 104-118 - [c33]Fedor V. Fomin, Petteri Kaski, Daniel Lokshtanov, Fahad Panolan, Saket Saurabh:
Parameterized Single-Exponential Time Polynomial Space Algorithm for Steiner Tree. ICALP (1) 2015: 494-505 - [c32]Keren Censor-Hillel, Petteri Kaski, Janne H. Korhonen, Christoph Lenzen, Ami Paz, Jukka Suomela:
Algebraic Methods in the Congested Clique. PODC 2015: 143-152 - [c31]Per Austrin, Petteri Kaski, Mikko Koivisto, Jesper Nederlof:
Subset Sum in the Absence of Concentration. STACS 2015: 48-61 - [i25]Keren Censor-Hillel, Petteri Kaski, Janne H. Korhonen, Christoph Lenzen, Ami Paz, Jukka Suomela:
Algebraic Methods in the Congested Clique. CoRR abs/1503.04963 (2015) - [i24]Andreas Björklund, Petteri Kaski, Lukasz Kowalik:
Fast Witness Extraction Using a Decision Oracle. CoRR abs/1508.03572 (2015) - [i23]Per Austrin, Mikko Koivisto, Petteri Kaski, Jesper Nederlof:
Dense Subset Sum may be the hardest. CoRR abs/1508.06019 (2015) - [i22]Matti Karppa, Petteri Kaski, Jukka Kohonen:
A faster subquadratic algorithm for finding outlier correlations. CoRR abs/1510.03895 (2015) - 2014
- [j33]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): 2 (2014) - [j32]Petteri Kaski, Mikko Koivisto, Janne H. Korhonen, Igor S. Sergeev:
Fast monotone summation over disjoint sets. Inf. Process. Lett. 114(5): 264-267 (2014) - [c30]Andreas Björklund, Petteri Kaski, Lukasz Kowalik:
Fast Witness Extraction Using a Decision Oracle. ESA 2014: 149-160 - [c29]Andreas Björklund, Petteri Kaski, Lukasz Kowalik:
Counting Thin Subgraphs via Packings Faster Than Meet-in-the-Middle Time. SODA 2014: 594-603 - [c28]Kustaa Kangas, Petteri Kaski, Mikko Koivisto, Janne H. Korhonen:
On the Number of Connected Sets in Bounded Degree Graphs. WG 2014: 336-347 - 2013
- [j31]Fedor V. Fomin, Petteri Kaski:
Exact exponential algorithms. Commun. ACM 56(3): 80-88 (2013) - [j30]Andreas Björklund, Petteri Kaski:
Counting closed trails. Inf. Process. Lett. 113(1-2): 1-3 (2013) - [c27]Per Austrin, Petteri Kaski, Mikko Koivisto, Jussi Määttä:
Space-Time Tradeoffs for Subset Sum: An Improved Worst Case Algorithm. ICALP (1) 2013: 45-56 - [c26]Andreas Björklund, Petteri Kaski, Lukasz Kowalik:
Probably Optimal Graph Motifs. STACS 2013: 20-31 - [i21]Per Austrin, Petteri Kaski, Mikko Koivisto, Jussi Määttä:
Space--Time Tradeoffs for Subset Sum: An Improved Worst Case Algorithm. CoRR abs/1303.0609 (2013) - [i20]Magnus Find, Mika Göös, Matti Järvisalo, Petteri Kaski, Mikko Koivisto, Janne H. Korhonen:
Separating OR, SUM, and XOR Circuits. CoRR abs/1304.0513 (2013) - [i19]Andreas Björklund, Petteri Kaski, Lukasz Kowalik:
Counting thin subgraphs via packings faster than meet-in-the-middle time. CoRR abs/1306.4111 (2013) - 2012
- [j29]Petteri Kaski, Mahdad Khatirinejad, Patric R. J. Östergård:
Steiner triple systems satisfying the 4-vertex condition. Des. Codes Cryptogr. 62(3): 323-330 (2012) - [j28]Andreas Björklund, Thore Husfeldt, Petteri Kaski, Mikko Koivisto:
The traveling salesman problem in bounded degree graphs. ACM Trans. Algorithms 8(2): 18:1-18:13 (2012) - [c25]Petteri Kaski, Mikko Koivisto, Jesper Nederlof:
Homomorphic Hashing for Sparse Coefficient Extraction. IPEC 2012: 147-158 - [c24]Petteri Kaski, Mikko Koivisto, Janne H. Korhonen:
Fast Monotone Summation over Disjoint Sets. IPEC 2012: 159-170 - [c23]Matti Järvisalo, Petteri Kaski, Mikko Koivisto, Janne H. Korhonen:
Finding Efficient Circuits for Ensemble Computation. SAT 2012: 369-382 - [c22]Andreas Björklund, Mikko Koivisto, Thore Husfeldt, Jesper Nederlof, Petteri Kaski, Pekka Parviainen:
Fast zeta transforms for lattices with few irreducibles. SODA 2012: 1436-1444 - [e1]Fedor V. Fomin, Petteri Kaski:
Algorithm Theory - SWAT 2012 - 13th Scandinavian Symposium and Workshops, Helsinki, Finland, July 4-6, 2012. Proceedings. Lecture Notes in Computer Science 7357, Springer 2012, ISBN 978-3-642-31154-3 [contents] - [i18]Petteri Kaski, Mikko Koivisto, Jesper Nederlof:
Homomorphic Hashing for Sparse Coefficient Extraction. CoRR abs/1203.4063 (2012) - [i17]Petteri Kaski, Mikko Koivisto, Janne H. Korhonen:
Fast Monotone Summation over Disjoint Sets. CoRR abs/1208.0554 (2012) - [i16]Andreas Björklund, Petteri Kaski, Lukasz Kowalik:
Probably Optimal Graph Motifs. CoRR abs/1209.1082 (2012) - 2011
- [j27]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): 827-834 (2011) - [j26]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): 539-546 (2011) - [j25]Andreas Björklund, Thore Husfeldt, Petteri Kaski, Mikko Koivisto:
Covering and packing in linear space. Inf. Process. Lett. 111(21-22): 1033-1036 (2011) - [j24]Alexander Hulpke, Petteri Kaski, Patric R. J. Östergård:
The number of Latin squares of order 11. Math. Comput. 80(274): 1197-1219 (2011) - [j23]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): 672-697 (2011) - [c21]Esa Junttila, Petteri Kaski:
Segmented nestedness in binary data. SDM 2011: 235-246 - [c20]Niko Vuokko, Petteri Kaski:
Significance of Patterns in Time Series Collections. SDM 2011: 676-686 - [c19]Tommi A. Junttila, Petteri Kaski:
Conflict Propagation and Component Recursion for Canonical Labeling. TAPAS 2011: 151-162 - 2010
- [j22]Patrik Floréen, Petteri Kaski, Valentin Polishchuk, Jukka Suomela:
Almost Stable Matchings by Truncating the Gale-Shapley Algorithm. Algorithmica 58(1): 102-118 (2010) - [j21]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) - [j20]Andreas Björklund, Thore Husfeldt, Petteri Kaski, Mikko Koivisto:
Evaluation of permanents in rings and semirings. Inf. Process. Lett. 110(20): 867-870 (2010) - [j19]Andreas Björklund, Thore Husfeldt, Petteri Kaski, Mikko Koivisto:
Trimmed Moebius Inversion and Graphs of Bounded Degree. Theory Comput. Syst. 47(3): 637-654 (2010) - [c18]Tommi A. Junttila, Petteri Kaski:
Exact Cover via Satisfiability: An Empirical Study. CP 2010: 297-304 - [c17]Andreas Björklund, Thore Husfeldt, Petteri Kaski, Mikko Koivisto:
Covering and Packing in Linear Space. ICALP (1) 2010: 727-737 - [c16]Niko Vuokko, Petteri Kaski:
Testing the Significance of Patterns in Data with Cluster Structure. ICDM 2010: 1097-1102 - [c15]Patrik Floréen, Petteri Kaski, Valentin Polishchuk, Jukka Suomela:
Brief announcement: distributed almost stable marriage. PODC 2010: 281-282 - [i15]Andreas Björklund, Thore Husfeldt, Petteri Kaski, Mikko Koivisto:
Narrow sieves for parameterized paths and packings. CoRR abs/1007.1161 (2010)
2000 – 2009
- 2009
- [c14]Andreas Björklund, Thore Husfeldt, Petteri Kaski, Mikko Koivisto:
Counting Paths and Packings in Halves. ESA 2009: 578-586 - [c13]Patrik Floréen, Joel Kaasinen, Petteri Kaski, Jukka Suomela:
An optimal local approximation algorithm for max-min linear programs. SPAA 2009: 260-269 - [i14]Andreas Björklund, Thore Husfeldt, Petteri Kaski, Mikko Koivisto:
Counting Paths and Packings in Halves. CoRR abs/0904.3093 (2009) - [i13]Andreas Björklund, Thore Husfeldt, Petteri Kaski, Mikko Koivisto:
On evaluation of permanents. CoRR abs/0904.3251 (2009) - 2008
- [j18]Petteri Kaski, Aleksi Penttinen, Jukka Suomela:
Coordinating Concurrent Transmissions: A Constant-Factor Approximation of Maximum-Weight Independent Set in Local Conflict Graphs. Ad Hoc Sens. Wirel. Networks 6(3-4): 239-263 (2008) - [j17]Petteri Kaski, Patric R. J. Östergård, Svetlana Topalova, Rosen Zlatarski:
Steiner triple systems of order 19 and 21 with subsystems of order 7. Discret. Math. 308(13): 2732-2741 (2008) - [j16]Mikko Alava, John Ardelius, Erik Aurell, Petteri Kaski, Supriya Krishnamurthy, Pekka Orponen, Sakari Seitz:
Circumspect descent prevails in solving random constraint satisfaction problems. Proc. Natl. Acad. Sci. USA 105(40): 15253-15257 (2008) - [c12]Patrik Floréen, Marja Hassinen, Petteri Kaski, Jukka Suomela:
Tight Local Approximation Results for Max-Min Linear Programs. ALGOSENSORS 2008: 2-17 - [c11]Andreas Björklund, Thore Husfeldt, Petteri Kaski, Mikko Koivisto:
Computing the Tutte Polynomial in Vertex-Exponential Time. FOCS 2008: 677-686 - [c10]Andreas Björklund, Thore Husfeldt, Petteri Kaski, Mikko Koivisto:
The Travelling Salesman Problem in Bounded Degree Graphs. ICALP (1) 2008: 198-209 - [c9]Patrik Floréen, Petteri Kaski, Topi Musto, Jukka Suomela:
Approximating max-min linear programs with local algorithms. IPDPS 2008: 1-10 - [c8]Andreas Björklund, Thore Husfeldt, Petteri Kaski, Mikko Koivisto:
Trimmed Moebius Inversion and Graphs of Bounded Degree. STACS 2008: 85-96 - [i12]Fedor V. Fomin, Kazuo Iwama, Dieter Kratsch, Petteri Kaski, Mikko Koivisto, Lukasz Kowalik, Yoshio Okamoto, Johan M. M. van Rooij, Ryan Williams:
08431 Open Problems - Moderately Exponential Time Algorithms. Moderately Exponential Time Algorithms 2008 - [i11]Andreas Björklund, Thore Husfeldt, Petteri Kaski, Mikko Koivisto:
Trimmed Moebius Inversion and Graphs of Bounded Degree. CoRR abs/0802.2834 (2008) - [i10]Patrik Floréen, Marja Hassinen, Petteri Kaski, Jukka Suomela:
Tight local approximation results for max-min linear programs. CoRR abs/0804.4815 (2008) - [i9]Patrik Floréen, Marja Hassinen, Petteri Kaski, Jukka Suomela:
Local approximation algorithms for a class of 0/1 max-min linear programs. CoRR abs/0806.0282 (2008) - [i8]Patrik Floréen, Joel Kaasinen, Petteri Kaski, Jukka Suomela:
An optimal local approximation algorithm for max-min linear programs. CoRR abs/0809.1489 (2008) - [i7]Andreas Björklund, Thore Husfeldt, Petteri Kaski, Mikko Koivisto:
The fast intersection transform with applications to counting paths. CoRR abs/0809.2489 (2008) - [i6]Patrik Floréen, Petteri Kaski, Valentin Polishchuk, Jukka Suomela:
Almost stable matchings in constant time. CoRR abs/0812.4893 (2008) - 2007
- [j15]Petteri Kaski, Patric R. J. Östergård:
There exists no symmetric configuration with 33 points and line size 6. Australas. J Comb. 38: 273-278 (2007) - [c7]Petteri Kaski, Aleksi Penttinen, Jukka Suomela:
Coordinating Concurrent Transmissions: A Constant-Factor Approximation of Maximum-Weight Independent Set in Local Conflict Graphs. ADHOC-NOW 2007: 74-86 - [c6]Tommi A. Junttila, Petteri Kaski:
Engineering an Efficient Canonical Labeling Tool for Large and Sparse Graphs. ALENEX 2007 - [c5]Patrik Floréen, Petteri Kaski, Topi Musto, Jukka Suomela:
Local Approximation Algorithms for Scheduling Problems in Sensor Networks. ALGOSENSORS 2007: 99-113 - [c4]Patrik Floréen, Petteri Kaski, Jukka Suomela:
A distributed approximation scheme for sleep sceduling in sensor networks. SECON 2007: 152-161 - [c3]Andreas Björklund, Thore Husfeldt, Petteri Kaski, Mikko Koivisto:
Fourier meets möbius: fast subset convolution. STOC 2007: 67-74 - [i5]Patrik Floréen, Petteri Kaski, Topi Musto, Jukka Suomela:
Approximating max-min linear programs with local algorithms. CoRR abs/0710.1499 (2007)