| 2008 |
|---|
| 11 | EE | André Schumacher,
Pekka Orponen,
Thorn Thaler,
Harri Haanpää:
Lifetime Maximization in Wireless Sensor Networks by Distributed Binary Search.
EWSN 2008: 237-252 |
| 10 | EE | André Schumacher,
Harri Haanpää:
Distributed network utility maximization in wireless networks with a bounded number of paths.
PM2HW2N 2008: 96-103 |
| 9 | EE | Harri Haanpää,
Patric R. J. Östergård,
Sándor Szabó:
Small P-Groups with Full-Rank Factorization.
IJAC 18(6): 1019-1034 (2008) |
| 2007 |
|---|
| 8 | EE | Shreyas Prasad,
André Schumacher,
Harri Haanpää,
Pekka Orponen:
Balanced Multipath Source Routing.
ICOIN 2007: 315-324 |
| 7 | EE | Harri Haanpää,
André Schumacher,
Thorn Thaler,
Pekka Orponen:
Distributed Computation of Maximum Lifetime Spanning Subgraphs in Sensor Networks.
MSN 2007: 445-456 |
| 2006 |
|---|
| 6 | EE | André Schumacher,
Harri Haanpää,
Satu Elisa Schaeffer,
Pekka Orponen:
Load Balancing by Distributed Optimisation in Ad Hoc Networks.
MSN 2006: 873-884 |
| 5 | EE | 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) |
| 4 | EE | 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) |
| 2005 |
|---|
| 3 | EE | 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) |
| 2004 |
|---|
| 2 | EE | Harri Haanpää,
Antti Huima,
Patric R. J. Östergård:
Sets in Z nwith distinct sums of pairs.
Discrete Applied Mathematics 138(1-2): 99-106 (2004) |
| 2003 |
|---|
| 1 | EE | Harri Haanpää,
Patric R. J. Östergård:
Classification of whist tournaments with up to 12 players.
Discrete Applied Mathematics 129(2-3): 399-407 (2003) |
