Pekka Orponen

Pekka Orponen

Professori
CS
Professori

Pekka Orponen is Professor of Computer Science at the Aalto University School of Science. He received his MSc and PhD degrees in Computer Science at the University of Helsinki in 1983 and 1986, respectively. After a postdoctoral period at the University of Toronto, he held assistant and associate professorships at the University of Helsinki, before moving first to the University of Jyväskylä (1996-2001) and then to the Helsinki University of Technology, now Aalto University (2001-present). He served as the founding Head of the Aalto Department of Information and Computer Science for 2008-2014, and then as Vice-Head for Research of the newly-established Aalto Department of Computer Science for 2015-2016.

His general research area is algorithms and complexity, with specific contributions spanning computational complexity theory, foundations of neural network and analog computation, stochastic algorithms and distributed sensor networks, and the computational theory and algorithmic design of nucleic acid nanostructures. His Nature 2015 article on the algorithmic design of 3D wireframe DNA nanostructures (with co-authors in Aalto and at the Karolinska Institutet) is currently listed as an ISI highly-cited paper, i.e. within the top 1% from its publication year in the areas of biology and biochemistry.

In addition to his academic activities, Pekka Orponen serves on the Supervisory Board of the Finnish Cultural Foundation, which is one of the largest private foundations for arts and science in Europe, and on the Board of Informatics Europe, the association of European Computer Science departments. He is also a member of the Finnish Academy of Science and Letters, and serves as the Chairman of the Academies' joint National Committee for Research Data, representing Finland in CODATA, the Data Committee of the International Science Council. In the latter capacity, he was recently programme committee co-chair of the 14th Plenary Meeting of the Research Data Alliance that took place at Aalto University on 23-25 Oct 2019.

 

Full researcher profile
https://research.aalto.fi/...

Contact information

Phone number
+358500819491

Areas of expertise

Algorithms, Complexity, Self-Organisation, 113 Computer and information sciences, Theoretical computer science

Publications

RuleDSD: A rule-based modelling and simulation tool for DNA strand displacement systems

Vinay Gautam, Shiting Long, Pekka Orponen 2020 Proceedings of the 13th International Joint Conference on Biomedical Engineering Systems and Technologies

A computational framework for DNA sequencing microscopy

Ian T. Hoffecker, Yunshi Yang, Giulio Bernardinelli, Pekka Orponen, Björn Högberg 2019 Proceedings of the National Academy of Sciences

Kohti avointa tiedettä

Pekka Orponen 2019 Kaikenlaista rohkeutta

Effects of design choices on the stiffness of wireframe DNA origami structures

Erik Benson, Abdulmelik Mohammed, Daniel Rayneau-Kirkhope, Andreas Gådin, Pekka Orponen, Björn Högberg 2018 ACS Nano

Algorithmic design of cotranscriptionally folding 2D RNA origami structures

Abdulmelik Mohammed, Pekka Orponen, Sachith Pai 2018 Unconventional Computation and Natural Computation

Design methods for 3D wireframe DNA nanostructures

Pekka Orponen 2018 Natural Computing

Computer-aided production of scaffolded DNA nanostructures from flat sheet meshes

Erik Benson, Abdulmelik Mohammed, Alessandro Bosco, Ana I. Teixeira, Pekka Orponen, Björn Högberg 2016 Angewandte Chemie

DNA rendering of polyhedral meshes at the nanoscale

Erik Benson, Abdulmelik Mohammed, Johan Gardell, Sergej Masich, Eugen Czeizler, Pekka Orponen, Björn Högberg 2015 Nature

Fault tolerant design and analysis of carbon nanotube circuits affixed on DNA origami tiles

Eugen Czeizler, Pekka Orponen 2015 IEEE TRANSACTIONS ON NANOTECHNOLOGY

Search methods for tile sets in patterned DNA self-assembly

Mika Göös, Tuomo Lempiäinen, Eugen Czeizler, Pekka Orponen 2014 JOURNAL OF COMPUTER AND SYSTEM SCIENCES

Special Issue on Algorithms for Sensor Systems, Wireless Ad Hoc Networks and Autonomous Mobile Entities, Theoretical Computer Science, Vol. 553

Amotz Bar-Noy, Thomas Erlebach, Magnus M. Halldorsson, Sotiris Nikoletseas, Pekka Orponen 2014

Editorial for Algorithms for Sensor Systems, Wireless Ad Hoc Networks and Autonomous Mobile Entities

Amotz Bar-Noy, Thomas Erlebach, Magnus M. Halldorsson, Sotiris Nikoletseas, Pekka Orponen 2014 Theoretical Computer Science

Online bin packing with delay and holding costs

Lauri Ahlroth, André Schumacher, Pekka Orponen 2013 Operations Research Letters

Yield optimization strategies for DNA staged tile assembly systems

Eugen Czeizler, Pekka Orponen 2013 2nd International Conference on the Theory and Practice of Natural Computing (TPNC 2013), Cáceres, Spain, 3-5 December 2013

Witness of unsatisfiability for a random 3-satisfiability formula

Lu-Lu Wu, Hai-Jun Zhou, Mikko Alava, Erik Aurell, Pekka Orponen 2013 Physical Review E

Unordered constraint satisfaction games

Lauri Ahlroth, Pekka Orponen 2012 MFCS 37th International Symposium on Mathematical Foundations of Computer Science (MFCS 2012) MFCS, Bratislava, Slovakia, August 27-31, 2012

A design framework for carbon nanotube circuits affixed on DNA origami tiles

Eugen Czeizler, Tuomo Lempiäinen, Pekka Orponen 2011 FNANO Proceedings of the 8th Annual Conference on Foundations of Nanoscience: Self-Assembled Architectures and Devices (FNANO11) FNANO, Snowbird UT, April 2011

Nano architectures for carbon nanotube circuits: design, analysis, and experimental attempts

Eugen Czeizler, Tuomo Lempiäinen, Pekka Orponen 2011 Proceedings of the Workshop on Language Theory in Biocomputing

Synthesizing minimal tile sets for patterned DNA self-assembly

Mika Göös, Pekka Orponen 2011 The 16th Conference on DNA Computing and Molecular Programming (DNA16) DNA, (Hong Kong, China, June 2010)

Synthesizing small and reliable tile sets for patterned DNA self-assembly

Tuomo Lempiäinen, Eugen Czeizler, Pekka Orponen 2011 DNA Computing and Molecular Programming - 17 th International Conference, DNA 17, Pasadena, CA, USA, September 19-23, 2011. Proceedings

Distributed algorithms for lifetime maximization in sensor networks via min-max spanning subgraphs

Harri Haanpää, André Schumacher, Pekka Orponen 2010 Wireless Networks

Synthesizing minimal tile sets for patterned DNA self-assembly

Mika Göös, Pekka Orponen 2009 arXiv.org

Circumspect descent prevails in solving random constraint satisfaction problems

Mikko Alava, John Ardelius, Erik Aurell, Petteri Kaski, Supriya Krishnamurthy, Pekka Orponen 2008 Proceedings of the National Academy of Sciences of the United States of America

Locally computable approximations for spectral clustering and absorption times of random walks

Pekka Orponen, Satu Elisa Schaeffer, Vanesa Avalos Gaytán 2008

Balanced multipath source routing

Shreyas Prasad, André Schumacher, Harri Haanpää, Pekka Orponen 2008 The 21st International Conference on Information Networking (ICOIN'07)

Lifetime maximization in wireless sensor networks by distributed binary search

Andre Schumacher, Pekka Orponen, Thorn Thaler, Harri Haanpää 2008 5th European Conference on Wireless Sensor Networks, EWSN 2008, Jan 30-Feb 1 2008

Distributed computation of maximum lifetime spanning subgraphs in sensor networks

Harri Haanpää, André Schumacher, Thorn Thaler, Pekka Orponen 2007 The 3rd International Conference on Mobile Ad-Hoc and Sensor Networks (MSN'07, Beijing, China, December 2007)

Security Topics and Mobility Management in Hierarchical Ad Hoc Networks (Samoyed): Final Report

Maarit Hietalahti, Mikko Särelä, Antti Tuominen, Pekka Orponen 2007

"P = NP" -ongelma ja laskennan vaativuusteoria

Pekka Orponen 2007 Tietojenkäsittelytiede

Load balancing by distributed optimisation in ad hoc networks

André Schumacher, Harri Haanpää, Satu Elisa Schaeffer, Pekka Orponen 2006 Mobile Ad-hoc and Sensor Networks Second International Conference, MSN 2006 Hong Kong, China, December 13-15, 2006

Focused local search for random 3-satisfiability.

Sakari Seitz, Mikko Alava, Pekka Orponen 2005 Journal of Statistical Mechanics: Theory and Experiment

Threshold behaviour of WalkSAT and focused Metropolis search on random 3-satisfiability

Sakari Seitz, Mikko Alava, Pekka Orponen 2005 8th International Conference on Theory and Applications of Satisfiability Testing, St. Andrews, Skotlanti, 20.-23.6.2005

Exact and approximate balanced data gathering in energy-constrained sensor networks

Patrik Floréen, Petteri Kaski, Jukka Kohonen, Pekka Orponen 2005 Theoretical Computer Science

Local clustering of large graphs by approximate Fiedler vectors

Pekka Orponen, Satu Elisa Schaeffer 2005 4th International Workshop on Efficient and Experimental Algorithms, Santorini, Kreikka, 10.-13.5.2005

Optimization, block designs and No Free Lunch theorems

Evan Griffiths, Pekka Orponen 2005 Information Processing Letters

Lifetime maximization for multicasting in energy-constrained wireless networks

Patrik Floréen, Petteri Kaski, Jukka Kohonen, Pekka Orponen 2005 IEEE Journal on Selected Areas in Communications

Balanced data gathering in energy-constrained sensor networks

Emil Falck, Patrik Floréen, Petteri Kaski, Jukka Kohonen, Pekka Orponen 2004 ALGOSENSORS'04, First International Workshop on Algorithmic Aspects of Wireless Sensor Networks, Turku, Suomi, 16.7.2004

An efficient local search method for random 3-satisfiability

Sakari Seitz, Pekka Orponen 2003 ELECTRONIC NOTES IN DISCRETE MATHEMATICS

Continuous-time symmetric Hopfield nets are computationally universal

Jiri Sima, Pekka Orponen 2003 Neural Computation

Exponential transients in continuous-time Liapunov systems

Jiri Sima, Pekka Orponen 2003 Theoretical Computer Science

An efficient local search method for random 3-satisfiability

Sakari Seitz, Pekka Orponen 2003 IEEE LICS'03 Workshop on Typical Case Complexity and Phase Transitions, Ottawa, Canada, June 2003

Mitä tietojenkäsittelyteoriaan kuuluu?

Pekka Orponen 2003 Tietojenkäsittelytiede

Multicast time maximization in energy constrained wireless networks

Patrik Floréen, Petteri Kaski, Jukka Kohonen, Pekka Orponen 2003 DIALM-POMC '03 Joint Workshop on Foundations of Mobile Computing, San Diego, CA, USA, 19.9.2003

Computation of the multivariate Oja median

Tommi Ronkainen, Hannu Oja, Pekka Orponen 2002 International Conference on Robust Statistics ICORS '01, Stift Vorau, Itävalta, heinäkuu 2001

Computing with continuous-time Liapunov systems

Jirí Síma, Pekka Orponen 2001 Proceedings on 33rd Annual ACM Symposium on Theory of Computing, July 6-8, 2001, Heraklion, Crete, Greece

Exponential transients in continuous-time symmetric Hopfield nets

Jirí Síma, Pekka Orponen 2001 Artificial Neural Networks - ICANN 2001, International Conference Vienna, Austria, August 21-25, 2001 Proceedings

Some afterthoughts on Hopfield networks

Jirí Síma, Pekka Orponen, Teemu Antti-Poika 1999 SOFSEM '99, Theory and Practice of Informatics, 26th Conference on Current Trends in Theory and Practice of Informatics, Milovy, Czech Republic, November 27 - December 4, 1999, Proceedings

On the effect of analog noise in discrete-time analog computations

Wolfgang Maass, Pekka Orponen 1998 Neural Computation

The computational power of continuous time neural networks

Pekka Orponen 1997 SOFSEM '97: Theory and Practice of Informatics, 24th Seminar on Current Trends in Theory and Practice of Informatics, Milovy, Czech Republic, November 22-29, 1997, Proceedings

Matematiikka ja tietotekniikka

Pekka Orponen 1997 Arkhimedes

Computing with truly asynchronous threshold logic networks

Pekka Orponen 1997 Theoretical Computer Science

A survey of continuous-time computation theory

Pekka Orponen 1997 Advances in Algorithms, Languages, and Complexity - In Honor of Ronald V. Book

On the effect of analog noise in discrete-time analog computations

Wolfgang Maass, Pekka Orponen 1997 Electronic Colloquium on Computational Complexity

Random strings make hard instances

Harry Buhrman, Pekka Orponen 1996 JOURNAL OF COMPUTER AND SYSTEM SCIENCES

Probably approximately optimal satisficing strategies

Russell Greiner, Pekka Orponen 1996 Artificial Intelligence

On the effect of analog noise in discrete-time analog computations

Wolfgang Maass, Pekka Orponen 1996 Advances in Neural Information Processing Systems 9, NIPS, Denver, CO, USA, December 2-5, 1996

Laskentaongelmien yksittäistapausten vaativuudesta

Pekka Orponen 1996 Logiikka, matematiikka ja tietokone

Parallel programming on Hopfield nets

Pekka Orponen, Frédéric Prost 1996 7th Finnish Artificial Intelligence Conference, Vaasa, Finland, August 20-23, 1996, Proceedings

Universal computation by finite two-dimensional coupled map lattices

Pekka Orponen, Martin Matamala 1996 4th Workshop on Physics and Computation, PhysComp 96, Boston, MA, USA, November 22-24, 1996, Proceedings

Instance complexity

Pekka Orponen, Ker-I Ko, Uwe Schöning, Osamu Watanabe 1994 Journal of the ACM

Computational complexity of neural networks: A survey

Pekka Orponen 1994 Nordic Journal of Computing

Random strings make hard instances

Harry Buhrman, Pekka Orponen 1994 Proceedings of the Ninth Annual Structure in Complexity Theory Conference, Amsterdam, The Netherlands, June 28 - July 1, 1994

Complexity issues in discrete Hopfield networks

Patrik Floreen, Pekka Orponen 1994

Attraction radii in binary Hopfield nets are hard to compute

Patrik Floréen, Pekka Orponen 1993 Neural Computation

On the computational power of discrete Hopfield nets

Pekka Orponen 1993 Automata, Languages and Programming, 20nd International Colloquium, ICALP93, Lund, Sweden, July 5-9, 1993, Proceedings

NEULA: A hybrid neural-symbolic expert system shell

Patrik Floreen, Petri Myllymäki, Pekka Orponen, Henry Tirri 1992 Tietojenkäsittelytiede

Integrating symbolic reasoning with neurally represented background knowledge

Petri Myllymäki, Pekka Orponen, Tomi Silander 1992 5th Finnish Artificial Intelligence Conference, Espoo, Finland, June 9-11, 1992, Proceedings

Neural networks and complexity theory

Pekka Orponen 1992 Mathematical Foundations of Computer Science 1992, 17th International Symposium, MFCS'92, Prague, Czechoslovakia, August 24-28, 1992, Proceedings

Probably approximately optimal derivation strategies

Russell Greiner, Pekka Orponen 1991 Proceedings of the 2nd International Conference on Principles of Knowledge Representation and Reasoning (KR'91). Cambridge, MA, USA, April 22-25, 1991.

On the sample complexity of finding good search strategies

Pekka Orponen, Russell Greiner 1990 Proceedings of the Third Annual Workshop on Computational Learning Theory, COLT 1990, University of Rochester, Rochester, NY, USA, August 6-8, 1990.

Programming methods for neural computing

Henry Tirri, Petri Myllymäki, Pekka Orponen, Patrik Floréen 1990 Parallelization in Inference Systems, International Workshop, Dagstuhl Castle, Germany, December 17-18, 1990, Proceedings

On the instance complexity of NP-hard problems

Pekka Orponen 1990 Proceedings: Fifth Annual Structure in Complexity Theory Conference, Universitat Politècnica de Catalunya, Barcelona, Spain, July 8-11, 1990

Dempster's rule of combination is #P-complete

Pekka Orponen 1990 Artificial Intelligence

Compiling object declarations into connectionist networks

Patrik Floréen, Petri Myllymäki, Pekka Orponen, Henry Tirri 1990 AI Communications

On the computational complexity of analyzing Hopfield nets

Patrik Floreen, Pekka Orponen 1989 Complex Systems

Lowness properties of sets in the exponential-time hierarchy

Ronald V. Book, Pekka Orponen, David A. Russo, Osamu Watanabe 1988 SIAM JOURNAL ON COMPUTING

On P-subset structures

David A. Russo, Pekka Orponen 1987 THEORY OF COMPUTING SYSTEMS

On exponential lowness

Ronald V. Book, Pekka Orponen, David A. Russo, Osamu Watanabe 1986 Automata, Languages and Programming, 13th International Colloquium, ICALP86, Rennes, France, July 15-19, 1986, Proceedings

What Is a hard instance of a computational problem?

Ker-I Ko, Pekka Orponen, Uwe Schöning, Osamu Watanabe 1986 Structure in Complexity Theory, Proceedings of the Conference hold at the University of California, Berkeley, California, June 2-5, 1986

A classification of complexity core lattices

Pekka Orponen 1986 Theoretical Computer Science

Optimal approximations and polynomially levelable sets

Pekka Orponen, David A. Russo, Uwe Schöning 1986 SIAM JOURNAL ON COMPUTING

The density and complexity of polynomial cores for intractable sets

Pekka Orponen, Uwe Schöning 1986 Information and Computation

Polynomial levelability and maximal complexity cores

Pekka Orponen, David A. Russo, Uwe Schöning 1985 Automata, Languages and Programming, 12th Colloquium, Nafplion, Greece, July 15-19, 1985, Proceedings

The structure of polynomial complexity cores (Extended abstract)

Pekka Orponen, Uwe Schöning 1984 Mathematical Foundations of Computer Science 1984, Praha, Czechoslovakia, September 3-7, 1984, Proceedings

Complexity classes of alternating machines with oracles

Pekka Orponen 1983 Automata, Languages and Programming