to appear |
|
29 | Harri Haanpää, André Schumacher, and Pekka Orponen. Distributed algorithms for lifetime maximization in sensor networks via min-max spanning subgraphs. Wireless Networks, to appear. Published online 8 April 2009. |
|
2009 |
|
28 | Mika Göös and Pekka Orponen. Synthesizing minimal tile sets for patterned DNA self-assembly. Technical Report cs.DS/0911.2924, arXiv.org, November 2009. |
|
2008 |
|
27 | Mikko Alava, John Ardelius, Erik Aurell, Petteri Kaski, Supriya Krishnamurthy, and Pekka Orponen. Circumspect descent prevails in solving random constraint satisfaction problems. Proceedings of the National Academy of Sciences (USA), 105(40):15253–15257, October 2008. |
|
|
26 | Pekka Orponen, Satu Elisa Schaeffer, and Vanesa Avalos Gaytán. Locally computable approximations for spectral clustering and absorption times of random walks. Technical Report cs.DM/0810.4061, arXiv.org, October 2008. |
|
|
25 | Shreyas Prasad, André Schumacher, Harri Haanpää, and Pekka Orponen. Balanced multipath source routing. In T. Vazão, M. M. Freire, and I. Chong, editors, Proceedings of the 21st International Conference on Information Networking (ICOIN'07, Estoril, Portugal, January 2007), volume 5200 of Lecture Notes in Computer Science, pages 315–324, Berlin Heidelberg, 2008. Springer-Verlag. |
|
|
24 | André Schumacher, Pekka Orponen, Thorn Thaler, and Harri Haanpää. Lifetime maximisation in wireless sensor networks by distributed binary search. In R. Verdone, editor, Proceedings of the 5th European Conference on Wireless Sensor Networks (EWSN'08, Bologna, Italy, January 2008), volume 4913 of Lecture Notes in Computer Science, pages 237–252, Berlin Heidelberg, 2008. Springer-Verlag. |
|
2007 |
|
23 | Maarit Hietalahti, Mikko Särelä, Antti Tuominen, and Pekka Orponen. Security topics and mobility management in hierarchical ad hoc networks (Samoyed): Final report. Technical Report B22, Helsinki University of Technology, Laboratory for Theoretical Computer Science, Espoo, Finland, December 2007. |
|
|
22 | Mikko Alava, John Ardelius, Erik Aurell, Petteri Kaski, Supriya Krishnamurthy, Pekka Orponen, and Sakari Seitz. Circumspect descent prevails in solving random constraint satisfaction problems. Technical Report 0711.4902, arXiv.org, November 2007. |
|
|
21 | Pekka Orponen. "P = NP" -ongelma ja laskennan vaativuusteoria. Tietojenkäsittelytiede, 26:54–67, 2007. |
|
|
20 | Harri Haanpää, André Schumacher, Thorn Thaler, and Pekka Orponen. Distributed computation of maximum lifetime spanning subgraphs in sensor networks. In H. Zhang, S. Olariu, J. Cao, and D. B. Johnson, editors, Proceedings of the 3rd International Conference on Mobile Ad-Hoc and Sensor Networks (MSN'07, Beijing, China, December 2007), volume 4864 of Lecture Notes in Computer Science, pages 445–456, Berlin Heidelberg, 2007. Springer-Verlag. |
|
2006 |
|
19 | 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, Proceedings of the 2nd International Conference on Mobile Ad-Hoc and Sensor Networks (MSN'06, Hong Kong, China, December 2006), volume 4325 of Lecture Notes in Computer Science, pages 873–884, Berlin Heidelberg, 2006. Springer-Verlag. |
|
2005 |
|
18 | Patrik Floréen, Petteri Kaski, Jukka Kohonen, and Pekka Orponen. Exact and approximate balanced data gathering in energy-constrained sensor networks. Theoretical Computer Science, 344(1):30–46, November 2005. |
|
|
17 | Sakari Seitz, Mikko Alava, and Pekka Orponen. Focused local search for random 3-satisfiability. Journal of Statistical Mechanics: Theory and Experiment, P06006:1–27, June 2005. |
|
|
16 | Evan Griffiths and Pekka Orponen. Optimization, block designs and No Free Lunch theorems. Information Processing Letters, 94(2):55–61, April 2005. |
|
|
15 | Patrik Floréen, Petteri Kaski, Jukka Kohonen, and Pekka Orponen. Lifetime maximization for multicasting in energy-constrained wireless networks. IEEE Journal on Selected Areas in Communications, 23(1):117–126, January 2005. |
|
|
14 | Pekka Orponen and Satu Elisa Schaeffer. Local clustering of large graphs by approximate Fiedler vectors. In S. Nikoletseas, editor, Proceedings of the 4th International Workshop on Efficient and Experimental Algorithms (WEA'05, Santorini, Greece, May 2005), volume 3503 of Lecture Notes in Computer Science, pages 524–533, Berlin Heidelberg, 2005. Springer-Verlag. |
|
|
13 | Sakari Seitz, Mikko Alava, and Pekka Orponen. Threshold behaviour of WalkSAT and focused Metropolis search on random 3-satisfiability. In F. Bacchus and T. Walsh, editors, Proceedings of the 8th International Conference on Theory and Applications of Satisfiability Testing (SAT'05, St. Andrews, Scotland, June 2005), volume 3569 of Lecture Notes in Computer Science, pages 475–481, Berlin Heidelberg, 2005. Springer-Verlag. |
|
2004 |
|
12 | Pekka Orponen and Satu Elisa Schaeffer. Efficient algorithms for sampling and clustering of large nonuniform networks. Technical Report cond-mat/0406048, arXiv.org, June 2004. |
|
|
11 | Emil Falck, Patrik Floréen, Petteri Kaski, Jukka Kohonen, and Pekka Orponen. Balanced data gathering in energy-constrained sensor networks. In S. Nikoletseas and J. D. P. Rolim, editors, Algorithmic Aspects of Wireless Sensor Networks: First International Workshop (ALGOSENSORS 2004, Turku, Finland, July 2004), volume 3121 of Lecture Notes in Computer Science, pages 59–70, Berlin Heidelberg, 2004. Springer-Verlag. |
|
2003 |
|
10 | Jiří Šíma and Pekka Orponen. General purpose computation with neural networks: A survey of complexity theoretic results. Neural Computation, 15(12):2727–2778, December 2003. |
|
|
9 | Pekka Orponen. Tietotekniikkaa ennen tietokoneita — Alan Turing ja tietotekniikan kiehtovat alkuvaiheet. Tietoa, pages 4–6, November 2003. |
|
|
8 | Jiří Šíma and Pekka Orponen. Exponential transients in continuous-time Liapunov systems. Theoretical Computer Science, 306(1–3):353–372, September 2003. |
|
|
7 | Jiří Šíma and Pekka Orponen. Continuous-time symmetric Hopfield nets are computationally universal. Neural Computation, 15(3):693–733, March 2003. |
|
|
6 | Tommi Ronkainen, Hannu Oja, and Pekka Orponen. Computation of the multivariate Oja median. In R. Dutter, P. Filzmoser, U. Gather, and P. J. Rousseeuw, editors, Developments in Robust Statistics: Proceedings of the International Conference on Robust Statistics (ICORS'01, Stift Vorau, Austria, July 2001), pages 344–359, Berlin Heidelberg, 2003. Springer-Verlag. |
|
|
5 | Sakari Seitz and Pekka Orponen. An efficient local search method for random 3-satisfiability. In Lefteris M. Kirousis and Evangelos Kranakis, editors, Proceedings of the IEEE LICS'03 Workshop on Typical Case Complexity and Phase Transitions (Ottawa, Canada, June 2003), volume 16 of Electronic Notes in Discrete Mathematics, Amsterdam, 2003. Elsevier. |
|
|
4 | Pekka Orponen. Mitä tietojenkäsittelyteoriaan kuuluu?. Tietojenkäsittelytiede, 19:15–28, 2003. |
|
|
3 | Patrik Floréen, Petteri Kaski, Jukka Kohonen, and Pekka Orponen. Multicast time maximization in energy constrained wireless networks. In Andrea Richa and Jennifer Welch, editors, Proceedings of the 2003 Joint Workshop on Foundations of Mobile Computing (DIALM-POMC'03, San Diego CA, September 2003), pages 50–58, New York NY, 2003. Association for Computing Machinery. |
|
2001 |
|
2 | Jiří Šíma and Pekka Orponen. Computing with continuous-time Liapunov systems. In J. S. Vitter, P. Spirakis, and M. Yannakakis, editors, Proceedings of the 33rd Annual ACM Symposium on Theory of Computing (STOC'01, Crete, July 2001), pages 722–731, New York NY, 2001. Association for Computing Machinery. |
|
|
1 | Jiří Šíma and Pekka Orponen. Exponential transients in continuous-time symmetric Hopfield nets. In G. Dorffner, H. Bischof, and K. Hornik, editors, Proceedings of Artificial Neural Networks – ICANN 2001 (Vienna, August 2001), volume 2130 of Lecture Notes in Computer Science, pages 806–813, Berlin Heidelberg, 2001. Springer-Verlag. |
|
