| 2013 | ||
|---|---|---|
| j29 | ||
| j28 | ||
| c26 | ||
| i19 | 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) | |
| i18 | 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) | |
| 2012 | ||
| j27 | Petteri Kaski, Mahdad Khatirinejad, Patric R. J. Östergård: Steiner triple systems satisfying the 4-vertex condition. Des. Codes Cryptography 62(3): 323-330 (2012) | |
| j26 | Andreas Björklund, Thore Husfeldt, Petteri Kaski, Mikko Koivisto: The traveling salesman problem in bounded degree graphs. ACM Transactions on Algorithms 8(2): 18 (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 (Eds.): 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 | |
| i17 | Petteri Kaski, Mikko Koivisto, Jesper Nederlof: Homomorphic Hashing for Sparse Coefficient Extraction. CoRR abs/1203.4063 (2012) | |
| i16 | Petteri Kaski, Mikko Koivisto, Janne H. Korhonen: Fast Monotone Summation over Disjoint Sets. CoRR abs/1208.0554 (2012) | |
| i15 | Andreas Björklund, Petteri Kaski, Lukasz Kowalik: Probably Optimal Graph Motifs. CoRR abs/1209.1082 (2012) | |
| 2011 | ||
| j25 | 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. Discrete Mathematics 311(10-11): 827-834 (2011) | |
| j24 | 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 and Combinatorics 27(4): 539-546 (2011) | |
| j23 | Andreas Björklund, Thore Husfeldt, Petteri Kaski, Mikko Koivisto: Covering and packing in linear space. Inf. Process. Lett. 111(21-22): 1033-1036 (2011) | |
| j22 | Alexander Hulpke, Petteri Kaski, Patric R. J. Östergård: The number of Latin squares of order 11. Math. Comput. 80(274): 1197-1219 (2011) | |
| j21 | 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 | ||
| c20 | ||
| c19 | Tommi A. Junttila, Petteri Kaski: Conflict Propagation and Component Recursion for Canonical Labeling. TAPAS 2011: 151-162 | |
| 2010 | ||
| j20 | Patrik Floréen, Petteri Kaski, Valentin Polishchuk, Jukka Suomela: Almost Stable Matchings by Truncating the Gale-Shapley Algorithm. Algorithmica 58(1): 102-118 (2010) | |
| j19 | 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. Electr. J. Comb. 17(1) (2010) | |
| j18 | Andreas Björklund, Thore Husfeldt, Petteri Kaski, Mikko Koivisto: Evaluation of permanents in rings and semirings. Inf. Process. Lett. 110(20): 867-870 (2010) | |
| j17 | 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 | |
| i14 | Andreas Björklund, Thore Husfeldt, Petteri Kaski, Mikko Koivisto: Narrow sieves for parameterized paths and packings. CoRR abs/1007.1161 (2010) | |
| 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 | |
| i13 | Andreas Björklund, Thore Husfeldt, Petteri Kaski, Mikko Koivisto: Counting Paths and Packings in Halves. CoRR abs/0904.3093 (2009) | |
| i12 | Andreas Björklund, Thore Husfeldt, Petteri Kaski, Mikko Koivisto: On evaluation of permanents. CoRR abs/0904.3251 (2009) | |
| 2008 | ||
| j16 | Petteri Kaski, Aleksi Penttinen, Jukka Suomela: Coordinating Concurrent Transmissions: A Constant-Factor Approximation of Maximum-Weight Independent Set in Local Conflict Graphs. Ad Hoc & Sensor Wireless Networks 6(3-4): 239-263 (2008) | |
| j15 | Petteri Kaski, Patric R. J. Östergård, Svetlana Topalova, Rosen Zlatarski: Steiner triple systems of order 19 and 21 with subsystems of order 7. Discrete Mathematics 308(13): 2732-2741 (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 | |
| 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 | ||
| 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) | |
| i4 | Andreas Björklund, Thore Husfeldt, Petteri Kaski, Mikko Koivisto: Computing the Tutte polynomial in vertex-exponential time. CoRR abs/0711.2585 (2007) | |
| i3 | Mikko Alava, John Ardelius, Erik Aurell, Petteri Kaski, Supriya Krishnamurthy, Pekka Orponen, Sakari Seitz: Circumspect descent prevails in solving random constraint satisfaction problems. CoRR abs/0711.4902 (2007) | |
| 2006 | ||
| j14 | Patric R. J. Östergård, Petteri Kaski: There are exactly five biplanes with k=11. Electronic Notes in Discrete Mathematics 27: 75 (2006) | |
| j13 | Malcolm Greig, Harri Haanpää, Petteri Kaski: On the coexistence of conference matrices and near resolvable 2-(2k+1, k, k-1) designs. J. Comb. Theory, Ser. A 113(4): 703-711 (2006) | |
| j12 | Petteri Kaski, Patric R. J. Östergård, Olli Pottonen: The Steiner quadruple systems of order 16. J. Comb. Theory, Ser. A 113(8): 1764-1770 (2006) | |
| j11 | Harri Haanpää, Matti Järvisalo, Petteri Kaski, Ilkka Niemelä: Hard Satisfiable Clause Sets for Benchmarking Equivalence Reasoning Techniques. JSAT 2(1-4): 27-46 (2006) | |
| i2 | Andreas Björklund, Thore Husfeldt, Petteri Kaski, Mikko Koivisto: Fourier meets Möbius: fast subset convolution. CoRR abs/cs/0611101 (2006) | |
| i1 | Petteri Kaski: Barriers and local minima in energy landscapes of stochastic local search. CoRR abs/cs/0611103 (2006) | |
| 2005 | ||
| j10 | Petteri Kaski, Patric R. J. Östergård: One-Factorizations of Regular Graphs of Order 12. Electr. J. Comb. 12 (2005) | |
| j9 | Harri Haanpää, Petteri Kaski: The Near Resolvable 2-(13, 4, 3) Designs and Thirteen-Player Whist Tournaments. Des. Codes Cryptography 35(3): 271-285 (2005) | |
| j8 | Patrik Floréen, Petteri Kaski, Jukka Kohonen, Pekka Orponen: Lifetime maximization for multicasting in energy-constrained wireless networks. IEEE Journal on Selected Areas in Communications 23(1): 117-126 (2005) | |
| j7 | Petteri Kaski: Isomorph-Free Exhaustive Generation of Designs with Prescribed Groups of Automorphisms. SIAM J. Discrete Math. 19(3): 664-690 (2005) | |
| j6 | Patrik Floréen, Petteri Kaski, Jukka Kohonen, Pekka Orponen: Exact and approximate balanced data gathering in energy-constrained sensor networks. Theor. Comput. Sci. 344(1): 30-46 (2005) | |
| 2004 | ||
| j5 | Petteri Kaski, Patric R. J. Östergård: Enumeration of balanced ternary designs. Discrete Applied Mathematics 138(1-2): 133-141 (2004) | |
| j4 | Petteri Kaski, Patric R. J. Östergård: Miscellaneous classification results for 2-designs. Discrete Mathematics 280(1-3): 65-75 (2004) | |
| j3 | Petteri Kaski: Packing Steiner trees with identical terminal sets. Inf. Process. Lett. 91(1): 1-5 (2004) | |
| j2 | Petteri Kaski, Patric R. J. Östergård: The Steiner triple systems of order 19. Math. Comput. 73(248): 2075-2092 (2004) | |
| c2 | Emil Falck, Patrik Floréen, Petteri Kaski, Jukka Kohonen, Pekka Orponen: Balanced Data Gathering in Energy-Constrained Sensor Networks. ALGOSENSORS 2004: 59-70 | |
| 2003 | ||
| c1 | Patrik Floréen, Petteri Kaski, Jukka Kohonen, Pekka Orponen: Multicast time maximization in energy constrained wireless networks. DIALM-POMC 2003: 50-58 | |
| 2002 | ||
| j1 | Patric R. J. Östergård, Petteri Kaski: Enumeration of 2-(9, 3, lambda) Designs and Their Resolutions. Des. Codes Cryptography 27(1-2): 131-137 (2002) | |
Data released under the ODC-BY 1.0 license — See also our legal information page