2009 |
|
35 | Harri Haanpää. Kokemuksia ICPC-ohjelmointikilpailusta. Tietojenkäsittelytiede, 2009. In Finnish. To appear. |
|
|
34 | Harri Haanpää, André Schumacher, and Pekka Orponen. Distributed algorithms for lifetime maximization in sensor networks via min-max spanning subgraphs. Wireless Networks, 2009. To appear. |
|
|
33 | André Schumacher and Harri Haanpää. Distributed sleep scheduling in wireless sensor networks via fractional domatic partitioning. In R. Guerraoui and F. Petit, editors, Proceedings of SSS'09, number 5873 in LNCS, pages 640–654. Springer-Verlag Berlin Heidelberg, 2009. to appear. |
|
2008 |
|
32 | Harri Haanpää, editor. Annual Report for the Year 2007. Teknillinen korkeakoulu, Tietojenkäsittelyteorian laboratorio (Helsinki University of Technology, Laboratory for Theoretical Computer Science), Espoo, Finland, September 2008. |
|
|
31 | Harri Haanpää, Patric Östergård, and Sándor Szabó. Small  -groups with full-rank factorization. International Journal of Algebra and Computation, 18(6):1019–1034, 2008. |
|
|
30 | Shreyas Prasad, André Schumacher, Harri Haanpää, and Pekka Orponen. Balanced multipath source routing. In T. Vazão, M. M. Freire, and I. Chong, editors, Information Networking, Towards Ubiquitous Networking and Services, volume 5200 of Lecture Notes in Computer Science, pages 315–324, 2008. |
|
|
29 | André Schumacher and Harri Haanpää. Distributed network utility maximization in wireless networks with a bounded number of paths. In Proc. 3rd ACM International Workshop on Performance Monitoring, Measurement, and Evaluation of Heterogeneous Wireless and Wired Networks, pages 96–103, 2008. |
|
|
28 | André Schumacher, Pekka Orponen, Thorn Thaler, and Harri Haanpää. Lifetime maximization in wireless sensor networks by distributed binary search. In Roberto Verdone, editor, Wireless Sensor Networks, volume 4913 of Lecture Notes in Computer Science, pages 237–252. Springer-Verlag, 2008. |
|
2007 |
|
27 | Harri Haanpää, editor. Annual Report for the Year 2006. Teknillinen korkeakoulu, Tietojenkäsittelyteorian laboratorio (Helsinki University of Technology, Laboratory for Theoretical Computer Science), Espoo, Finland, October 2007. |
|
|
26 | Harri Haanpää and Patric R. J. Östergård. Sets in Abelian groups with distinct sums of pairs. Journal of Number Theory, 123:144–153, 2007. |
|
|
25 | Harri Haanpää, André Schumacher, Thorn Thaler, and Pekka Orponen. Distributed computation of maximum lifetime spanning subgraphs in sensor networks. In Hongke Zhang, Stephan Olariu, Jiannong Cao, and David B. Johnson, editors, Proceedings of The 3rd International Conference on Mobile Ad-hoc and Sensor Networks (MSN 2007), volume 4864 of Lecture Notes in Computer Science, pages 445–456, Berlin / Heidelberg, 2007. Springer. |
|
2006 |
|
24 | Harri Haanpää, editor. Annual Report for the Year 2005. Teknillinen korkeakoulu, Tietojenkäsittelyteorian laboratorio (Helsinki University of Technology, Laboratory for Theoretical Computer Science), Espoo, Finland, October 2006. |
|
|
23 | Malcolm Greig, Harri Haanpää, and Petteri Kaski. On the coexistence of conference matrices and near resolvable 2-(2k+1, k, k-1) designs. Journal of Combinatorial Theory, Series A, 113(4):703–711, May 2006. |
|
|
22 | Harri Haanpää and Patric R. J. Östergård. Steinerin kolmikkojärjestelmistä sudokuun. Arkhimedes, 2006(2):18–21, 2006. In Finnish. |
|
|
21 | Harri Haanpää, Matti Järvisalo, Petteri Kaski, and Ilkka Niemelä. Hard satisfiable clause sets for benchmarking equivalence reasoning techniques. Journal on Satisfiability, Boolean Modeling and Computation, 2:27–46, 2006. |
|
|
20 | André Schumacher, Harri Haanpää, Satu Elisa Schaeffer, and Pekka Orponen. Load balancing by distributed optimisation in ad hoc networks. In J. Cao, I. Stojmenovic, X. Jia, and S. K. Das, editors, Mobile Ad-hoc and Sensor Networks, volume 4325 of Lecture Notes in Computer Science, pages 873–884, Berlin / Heidelberg, 2006. Springer-Verlag. |
|
2005 |
|
19 | Harri Haanpää and Petteri Kaski. The near resolvable 2-(13, 4, 3) designs and thirteen-player whist tournaments. Designs, Codes and Cryptography, 35(3):271–285, June 2005. |
|
|
18 | Harri Haanpää, Matti Järvisalo, Petteri Kaski, and Ilkka Niemelä. SAT benchmarks based on 3-regular graphs, May 2005. SAT Competition 2005 benchmark description. Benchmark set available at http://www.tcs.hut.fi/%7Emjj/benchmarks/. SAT Competition 2005 results available through http://www.satcompetition.org/2005/. |
|
|
17 | Harri Haanpää. No 17-player triplewhist tournament has nontrivial automorphisms. Journal of Combinatorial Designs, 13:345–348, 2005. |
|
2004 |
|
16 | Harri Haanpää. Kyselytutkimus opiskelijoiden ajankäytöstä tietojenkäsittelyteorian peruskurssilla. Presentation at Peda-forum, Kuusamo, Finland, November 2004. |
|
|
15 | Malcolm Greig, Harri Haanpää, and Petteri Kaski. On the existence of conference matrices and near resolvable 2-(2k+1, k, k-1) designs. In Lars Døvling Andersen and Olav Geil, editors, Proceedings of the 8th Nordic Combinatorial Conference, pages 65–69, Aalborg, Denmark, October 2004. Department of Mathematical Sciences, Aalborg University. Extended summary. |
|
|
14 | Harri Haanpää, editor. Annual Report for the Year 2003. Teknillinen korkeakoulu, Tietojenkäsittelyteorian laboratorio (Helsinki University of Technology, Laboratory for Theoretical Computer Science), Espoo, Finland, June 2004. |
|
|
13 | Harri Haanpää. Constructing certain combinatorial structures by computational methods. Research Report A89, Helsinki University of Technology, Laboratory for Theoretical Computer Science, Espoo, Finland, February 2004. Doctoral thesis. |
|
|
12 | Harri Haanpää. Constructing Certain Combinatorial Structures by Computational Methods. Electronic version of doctoral thesis, Helsinki University of Technology, February 2004. http://lib.hut.fi/Diss/2004/isbn9512269422/. |
|
|
11 | Harri Haanpää. Minimum sum and difference covers of Abelian groups. Research Report A88, Helsinki University of Technology, Laboratory for Theoretical Computer Science, Espoo, Finland, February 2004. |
|
|
10 | Harri Haanpää and Patric R. J. Östergård. Sets in Abelian groups with distinct sums of pairs. Research Report A87, Helsinki University of Technology, Laboratory for Theoretical Computer Science, Espoo, Finland, February 2004. |
|
|
9 | Harri Haanpää. Minimum sum and difference covers of Abelian groups. Journal of Integer Sequences, 7(2):article 04.1.8, 2004. |
|
|
8 | Harri Haanpää, Antti Huima, and Patric R. J. Östergård. Sets in  with distinct sums of pairs. Discrete Applied Mathematics, 138:99–106, 2004. |
|
2003 |
|
7 | Harri Haanpää and Patric R. J. Östergård. Classification of whist tournaments with up to 12 players. Discrete Applied Mathematics, 129:399–407, 2003. |
|
2000 |
|
6 | Harri Haanpää. Computational methods for Ramsey numbers. Reseach Report A65, Helsinki University of Technology, Laboratory for Theoretical Computer Science, Espoo, Finland, November 2000. |
|
|
5 | Harri Haanpää. Computational Methods for Ramsey Numbers. Licentiate thesis, Helsinki University of Technology, Department of Computer Science and Engineering, June 2000. |
|
|
4 | Harri Haanpää. A lower bound for a Ramsey number. Congressus Numerantium, 144:189–191, 2000. |
|
1997 |
|
3 | Harri Haanpää. Päätöksenteon tuen ja visualisoinnin mahdollisuudet WWW:ssä. In Raimo P. Hämäläinen, editor, Monitavoitteisen päätöksenteon mallit vesistön säännöstelyssä, number B21 in Research Reports, Series B, pages 54–57. Helsinki University of Technology, Systems Analysis Laboratory, 1997. |
|
1996 |
|
2 | Harri Haanpää. MMP — a modular matrix package. Master's thesis, Helsinki University of Technology, Department of Engineering Physics and Mathematics, December 1996. |
|
|
1 | Harri Haanpää, Juha Mäntysaari, and Risto Lahdelma. Simulation of stochastic multi-agent real-time target assignment. Presentation at Simulation, Gaming, Training and Business Process Reengineering, Riga, 1996. |
|
