Complexity Classes of Alternating Machines with Oracles. - Pekka Orponen (ICALP, 1983)

The Structure of Polynomial Complexity Cores (Extended Abstract). - Pekka Orponen; Uwe Schöning (MFCS, 1984)

Polynomial Levelability and Maximal Complexity Cores. - Pekka Orponen; David A. Russo; Uwe Schöning (ICALP, 1985)

What Is a Hard Instance of a Computational Problem?. - Ker-I Ko; Pekka Orponen; Uwe Schöning; Osamu Watanabe 001 (SCT, 1986)

On Exponential Lowness. - Ronald V. Book; Pekka Orponen; David A. Russo; Osamu Watanabe 001 (ICALP, 1986)

Optimal Approximations and Polynomially Levelable Sets. - Pekka Orponen; David A. Russo; Uwe Schöning (SIAM J. Comput., 1986)

A Classification of Complexity Core Lattices. - Pekka Orponen (Theor. Comput. Sci., 1986)

The Density and Complexity of Polynomial Cores for Intractable Sets. - Pekka Orponen; Uwe Schöning (Inf. Control., 1986)

On P-Subset Structures. - David A. Russo; Pekka Orponen (Math. Syst. Theory, 1987)

Lowness Properties of Sets in the Exponential-Time Hierarchy. - Ronald V. Book; Pekka Orponen; David A. Russo; Osamu Watanabe 001 (SIAM J. Comput., 1988)

On the Computational Complexity of Analyzing Hopfield Nets. - Patrik Floréen; Pekka Orponen (Complex Syst., 1989)

On the Instance Complexity of NP-Hard Problems. - Pekka Orponen (SCT, 1990)

On the Sample Complexity of Finding Good Search Strategies. - Pekka Orponen; Russell Greiner (COLT, 1990)

Programming Methods for Neural Computing. - Henry Tirri; Petri Myllymäki; Pekka Orponen; Patrik Floréen (Dagstuhl Seminar on Parallelization in Inference Systems, 1990)

A neural implementation of conceptual hierarchies with Bayesian reasoning. - Pekka Orponen; Patrik Floréen; Petri Myllymäki; Henry Tirri (IJCNN, 1990)

Dempster's Rule of Combination is #P-Complete. - Pekka Orponen (Artif. Intell., 1990)

Compiling Object Declarations into Connectionist Networks. - Patrik Floréen; Petri Myllymäki; Pekka Orponen; Henry Tirri (AI Commun., 1990)

Probably Approximately Optimal Derivation Strategies. - Russell Greiner; Pekka Orponen (KR, 1991)

On the Computational Power of Discrete Hopfield Nets. - Pekka Orponen (ICALP, 1993)

Attraction Radii in Binary Hopfield Nets are Hard to Compute. - Patrik Floréen; Pekka Orponen (Neural Comput., 1993)

Instance Complexity. - Pekka Orponen; Ker-I Ko; Uwe Schöning; Osamu Watanabe 001 (J. ACM, 1994)

Neural Networks and Complexity Theory. - Pekka Orponen (Nord. J. Comput., 1994)

Probably Approximately Optimal Satisficing Strategies. - Russell Greiner; Pekka Orponen (Artif. Intell., 1996)

Random Strings Make Hard Instances. - Harry Buhrman; Pekka Orponen (J. Comput. Syst. Sci., 1996)

The Computational Power of Discrete Hopfield Nets with Hidden Units. - Pekka Orponen (Neural Comput., 1996)

A Survey of Continous-Time Computation Theory. - Pekka Orponen (Advances in Algorithms, Languages, and Complexity, 1997)

The Computational Power of Continuous Time Neural Networks. - Pekka Orponen (SOFSEM, 1997)

On the Effect of Analog Noise in Discrete-Time Analog Computations - Wolfgang Maass 001; Pekka Orponen (Electron. Colloquium Comput. Complex., 1997)

Computing with Truly Asynchronous Threshold Logic Networks. - Pekka Orponen (Theor. Comput. Sci., 1997)

Some Afterthoughts on Hopfield Networks. - Jirí Síma; Pekka Orponen; Teemu Antti-Poika (SOFSEM, 1999)

Exponential Transients in Continuous-Time Symmetric Hopfield Nets. - Jirí Síma; Pekka Orponen (ICANN, 2001)

Computing with continuous-time Liapunov systems. - Jirí Síma; Pekka Orponen (STOC, 2001)

On the Computational Complexity of Binary and Analog Symmetric Hopfield Nets. - Jirí Síma; Pekka Orponen; Teemu Antti-Poika (Neural Comput., 2001)

Multicast time maximization in energy constrained wireless networks. - Patrik Floréen; Petteri Kaski; Jukka Kohonen; Pekka Orponen (DIALM-POMC, 2003)

An efficient local search method for random 3-satisfiability. - Sakari Seitz; Pekka Orponen (Electron. Notes Discret. Math., 2003)

Continuous-Time Symmetric Hopfield Nets Are Computationally Universal. - Jirí Síma; Pekka Orponen (Neural Comput., 2003)

General-Purpose Computation with Neural Networks: A Survey of Complexity Theoretic Results. - Jirí Síma; Pekka Orponen (Neural Comput., 2003)

Exponential transients in continuous-time Liapunov systems. - Jirí Síma; Pekka Orponen (Theor. Comput. Sci., 2003)

Balanced Data Gathering in Energy-Constrained Sensor Networks. - Emil Falck; Patrik Floréen; Petteri Kaski; Jukka Kohonen; Pekka Orponen (ALGOSENSORS, 2004)

Threshold Behaviour of WalkSAT and Focused Metropolis Search on Random 3-Satisfiability. - Sakari Seitz; Mikko Alava; Pekka Orponen (SAT, 2005)

Local Clustering of Large Graphs by Approximate Fiedler Vectors. - Pekka Orponen; Satu Elisa Schaeffer (WEA, 2005)

Focused Local Search for Random 3-Satisfiability - Sakari Seitz; Mikko Alava; Pekka Orponen (CoRR, 2005)

Optimization, block designs and No Free Lunch theorems. - Evan J. Griffiths; Pekka Orponen (Inf. Process. Lett., 2005)

Lifetime maximization for multicasting in energy-constrained wireless networks. - Patrik Floréen; Petteri Kaski; Jukka Kohonen; Pekka Orponen (IEEE J. Sel. Areas Commun., 2005)

Exact and approximate balanced data gathering in energy-constrained sensor networks. - Patrik Floréen; Petteri Kaski; Jukka Kohonen; Pekka Orponen (Theor. Comput. Sci., 2005)

Load Balancing by Distributed Optimisation in Ad Hoc Networks. - André Schumacher; Harri Haanpää; Satu Elisa Schaeffer; Pekka Orponen (MSN, 2006)

Balanced Multipath Source Routing. - Shreyas Prasad; André Schumacher; Harri Haanpää; Pekka Orponen (ICOIN, 2007)

Distributed Computation of Maximum Lifetime Spanning Subgraphs in Sensor Networks. - Harri Haanpää; André Schumacher; Thorn Thaler; Pekka Orponen (MSN, 2007)

Lifetime Maximization in Wireless Sensor Networks by Distributed Binary Search. - André Schumacher; Pekka Orponen; Thorn Thaler; Harri Haanpää (EWSN, 2008)

Locally computable approximations for spectral clustering and absorption times of random walks - Pekka Orponen; Satu Elisa Schaeffer; Vanesa Avalos Gaytán (CoRR, 2008)

Circumspect descent prevails in solving random constraint satisfaction problems. - Mikko Alava; John Ardelius; Erik Aurell; Petteri Kaski; Supriya Krishnamurthy; Pekka Orponen; Sakari Seitz (Proc. Natl. Acad. Sci. USA, 2008)

Synthesizing Minimal Tile Sets for Patterned DNA Self-assembly. - Mika Göös; Pekka Orponen (DNA, 2010)

Distributed algorithms for lifetime maximization in sensor networks via Min-Max spanning subgraphs. - Harri Haanpää; André Schumacher; Pekka Orponen (Wirel. Networks, 2010)

Synthesizing Small and Reliable Tile Sets for Patterned DNA Self-assembly. - Tuomo Lempiäinen; Eugen Czeizler; Pekka Orponen (DNA, 2011)

Unordered Constraint Satisfaction Games. - Lauri Ahlroth; Pekka Orponen (MFCS, 2012)

Yield Optimization Strategies for (DNA) Staged Tile Assembly Systems. - Eugen Czeizler; Pekka Orponen (TPNC, 2013)

Witness of unsatisfiability for a random 3-satisfiability formula - Lu-lu Wu; Hai-Jun Zhou; Mikko Alava; Erik Aurell; Pekka Orponen (CoRR, 2013)

Online bin packing with delay and holding costs. - Lauri Ahlroth; André Schumacher; Pekka Orponen (Oper. Res. Lett., 2013)

Search methods for tile sets in patterned DNA self-assembly. - Mika Göös; Tuomo Lempiäinen; Eugen Czeizler; Pekka Orponen (J. Comput. Syst. Sci., 2014)

Editorial for Algorithms for Sensor Systems, Wireless Ad Hoc Networks and Autonomous Mobile Entities. - Amotz Bar-Noy; Thomas Erlebach; Magnús M. Halldórsson; Sotiris E. Nikoletseas; Pekka Orponen (Theor. Comput. Sci., 2014)

DNA rendering of polyhedral meshes at the nanoscale. - Erik Benson; Abdulmelik Mohammed; Johan Gardell; Sergej Masich; Eugen Czeizler; Pekka Orponen; Björn Högberg (Nat., 2015)

Algorithmic Design of Cotranscriptionally Folding 2D RNA Origami Structures. - Abdulmelik Mohammed; Pekka Orponen; Sachith Pai (UCNC, 2018)

Design methods for 3D wireframe DNA nanostructures. - Pekka Orponen (Nat. Comput., 2018)

RuleDSD: A Rule-based Modelling and Simulation Tool for DNA Strand Displacement Systems. - Vinay Gautam 001; Shiting Long; Pekka Orponen (BIOINFORMATICS, 2020)

Cotranscriptional Kinetic Folding of RNA Secondary Structures Including Pseudoknots. - Vo Hong Thanh; Dani Korpela; Pekka Orponen (J. Comput. Biol., 2021)

RNA secondary structure prediction with convolutional neural networks. - Mehdi Saman Booy; Alexander Ilin; Pekka Orponen (BMC Bioinform., 2022)

OVI-3: A NoSQL visual query system supporting efficient anti-joins. - Sami El-Mahgary; Eljas Soisalon-Soininen; Pekka Orponen; Petri Rönnholm; Hannu Hyyppä (J. Intell. Inf. Syst., 2023)

Designing 3D RNA Origami Nanostructures with a Minimum Number of Kissing Loops. - Antti Elonen; Pekka Orponen (DNA, 2024)

A General Design Method for Scaffold-Free DNA Wireframe Nanostructures. - Antti Elonen; Abdulmelik Mohammed; Pekka Orponen (UCNC, 2024)

Automated Rendering of Multi-stranded DNA Complexes with Pseudoknots. - Malgorzata Nowicka; Vinay Kumar Gautam; Pekka Orponen (UCNC, 2024)

Secondary Structure Design for Cotranscriptional 3D RNA Origami Wireframes. - Pekka Orponen; Shinnosuke Seki 001; Antti Elonen (DNA, 2025)