Pekka Orponen

According to our database, Pekka Orponen authored at least 70 papers between 1983 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2024

Automated Rendering of Multi-stranded DNA Complexes with Pseudoknots.

Malgorzata Nowicka, Vinay Kumar Gautam, Pekka Orponen

Proceedings of the Unconventional Computation and Natural Computation, 2024

A General Design Method for Scaffold-Free DNA Wireframe Nanostructures.

Antti Elonen, Abdulmelik Mohammed, Pekka Orponen

Proceedings of the Unconventional Computation and Natural Computation, 2024

Designing 3D RNA Origami Nanostructures with a Minimum Number of Kissing Loops.

Antti Elonen, Pekka Orponen

Proceedings of the 30th International Conference on DNA Computing and Molecular Programming, 2024

2023

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., June, 2023

2022

RNA secondary structure prediction with convolutional neural networks.

Mehdi Saman Booy, Alexander Ilin, Pekka Orponen

BMC Bioinform., 2022

2021

Cotranscriptional Kinetic Folding of RNA Secondary Structures Including Pseudoknots.

Vo Hong Thanh, Dani Korpela, Pekka Orponen

J. Comput. Biol., 2021

2020

RuleDSD: A Rule-based Modelling and Simulation Tool for DNA Strand Displacement Systems.

Vinay Gautam, Shiting Long, Pekka Orponen

Proceedings of the 13th International Joint Conference on Biomedical Engineering Systems and Technologies (BIOSTEC 2020), 2020

2018

Design methods for 3D wireframe DNA nanostructures.

Pekka Orponen

Nat. Comput., 2018

Algorithmic Design of Cotranscriptionally Folding 2D RNA Origami Structures.

Abdulmelik Mohammed, Pekka Orponen, Sachith Pai

Proceedings of the Unconventional Computation and Natural Computation, 2018

2015

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

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

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

2013

Online bin packing with delay and holding costs.

Lauri Ahlroth, André Schumacher, Pekka Orponen

Oper. Res. Lett., 2013

Witness of unsatisfiability for a random 3-satisfiability formula

Lu-lu Wu, Hai-Jun Zhou, Mikko Alava, Erik Aurell, Pekka Orponen

CoRR, 2013

Yield Optimization Strategies for (DNA) Staged Tile Assembly Systems.

Eugen Czeizler, Pekka Orponen

Proceedings of the Theory and Practice of Natural Computing, 2013

2012

Unordered Constraint Satisfaction Games.

Lauri Ahlroth, Pekka Orponen

Proceedings of the Mathematical Foundations of Computer Science 2012, 2012

2011

Synthesizing Small and Reliable Tile Sets for Patterned DNA Self-assembly.

Tuomo Lempiäinen, Eugen Czeizler, Pekka Orponen

Proceedings of the DNA Computing and Molecular Programming - 17th International Conference, 2011

2010

Distributed algorithms for lifetime maximization in sensor networks via Min-Max spanning subgraphs.

Harri Haanpää, André Schumacher, Pekka Orponen

Wirel. Networks, 2010

Synthesizing Minimal Tile Sets for Patterned DNA Self-assembly.

Mika Göös, Pekka Orponen

Proceedings of the DNA Computing and Molecular Programming - 16th International Conference, 2010

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

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

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

CoRR, 2008

Lifetime Maximization in Wireless Sensor Networks by Distributed Binary Search.

André Schumacher, Pekka Orponen, Thorn Thaler, Harri Haanpää

Proceedings of the Wireless Sensor Networks, 5th European Conference, 2008

2007

Distributed Computation of Maximum Lifetime Spanning Subgraphs in Sensor Networks.

Harri Haanpää, André Schumacher, Thorn Thaler, Pekka Orponen

Proceedings of the Mobile Ad-Hoc and Sensor Networks, Third International Conference, 2007

Balanced Multipath Source Routing.

Shreyas Prasad, André Schumacher, Harri Haanpää, Pekka Orponen

Proceedings of the Information Networking. Towards Ubiquitous Networking and Services, 2007

2006

Load Balancing by Distributed Optimisation in Ad Hoc Networks.

André Schumacher, Harri Haanpää, Satu Elisa Schaeffer, Pekka Orponen

Proceedings of the Mobile Ad-hoc and Sensor Networks, Second International Conference, 2006

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

Lifetime maximization for multicasting in energy-constrained wireless networks.

Patrik Floréen, Petteri Kaski, Jukka Kohonen, Pekka Orponen

IEEE J. Sel. Areas Commun., 2005

Optimization, block designs and No Free Lunch theorems.

Evan J. Griffiths, Pekka Orponen

Inf. Process. Lett., 2005

Focused Local Search for Random 3-Satisfiability

Sakari Seitz, Mikko Alava, Pekka Orponen

CoRR, 2005

Local Clustering of Large Graphs by Approximate Fiedler Vectors.

Pekka Orponen, Satu Elisa Schaeffer

Proceedings of the Experimental and Efficient Algorithms, 4th InternationalWorkshop, 2005

Threshold Behaviour of WalkSAT and Focused Metropolis Search on Random 3-Satisfiability.

Sakari Seitz, Mikko Alava, Pekka Orponen

Proceedings of the Theory and Applications of Satisfiability Testing, 2005

2004

Balanced Data Gathering in Energy-Constrained Sensor Networks.

Emil Falck, Patrik Floréen, Petteri Kaski, Jukka Kohonen, Pekka Orponen

Proceedings of the Algorithmic Aspects of Wireless Sensor Networks: First International Workshop, 2004

2003

Exponential transients in continuous-time Liapunov systems.

Jirí Síma, Pekka Orponen

Theor. Comput. Sci., 2003

General-Purpose Computation with Neural Networks: A Survey of Complexity Theoretic Results.

Jirí Síma, Pekka Orponen

Neural Comput., 2003

Continuous-Time Symmetric Hopfield Nets Are Computationally Universal.

Jirí Síma, Pekka Orponen

Neural Comput., 2003

An efficient local search method for random 3-satisfiability.

Sakari Seitz, Pekka Orponen

Electron. Notes Discret. Math., 2003

Multicast time maximization in energy constrained wireless networks.

Patrik Floréen, Petteri Kaski, Jukka Kohonen, Pekka Orponen

Proceedings of the DIALM-POMC Joint Workshop on Foundations of Mobile Computing, 2003

2001

On the Computational Complexity of Binary and Analog Symmetric Hopfield Nets.

Jirí Síma, Pekka Orponen, Teemu Antti-Poika

Neural Comput., 2001

Computing with continuous-time Liapunov systems.

Jirí Síma, Pekka Orponen

Proceedings of the Proceedings on 33rd Annual ACM Symposium on Theory of Computing, 2001

Exponential Transients in Continuous-Time Symmetric Hopfield Nets.

Jirí Síma, Pekka Orponen

Proceedings of the Artificial Neural Networks, 2001

1999

Some Afterthoughts on Hopfield Networks.

Jirí Síma, Pekka Orponen, Teemu Antti-Poika

Proceedings of the SOFSEM '99, Theory and Practice of Informatics, 26th Conference on Current Trends in Theory and Practice of Informatics, Milovy, Czech Republic, November 27, 1999

1997

Computing with Truly Asynchronous Threshold Logic Networks.

Pekka Orponen

Theor. Comput. Sci., 1997

On the Effect of Analog Noise in Discrete-Time Analog Computations

Wolfgang Maass, Pekka Orponen

Electron. Colloquium Comput. Complex., 1997

The Computational Power of Continuous Time Neural Networks.

Pekka Orponen

Proceedings of the SOFSEM '97: Theory and Practice of Informatics, 1997

A Survey of Continous-Time Computation Theory.

Pekka Orponen

Proceedings of the Advances in Algorithms, Languages, and Complexity, 1997

1996

The Computational Power of Discrete Hopfield Nets with Hidden Units.

Pekka Orponen

Neural Comput., 1996

Random Strings Make Hard Instances.

Harry Buhrman, Pekka Orponen

J. Comput. Syst. Sci., 1996

Probably Approximately Optimal Satisficing Strategies.

Russell Greiner, Pekka Orponen

Artif. Intell., 1996

1994

Neural Networks and Complexity Theory.

Pekka Orponen

Nord. J. Comput., 1994

Instance Complexity.

Pekka Orponen, Ker-I Ko, Uwe Schöning, Osamu Watanabe

J. ACM, 1994

1993

Attraction Radii in Binary Hopfield Nets are Hard to Compute.

Patrik Floréen, Pekka Orponen

Neural Comput., 1993

On the Computational Power of Discrete Hopfield Nets.

Pekka Orponen

Proceedings of the Automata, Languages and Programming, 20nd International Colloquium, 1993

1991

Probably Approximately Optimal Derivation Strategies.

Russell Greiner, Pekka Orponen

Proceedings of the 2nd International Conference on Principles of Knowledge Representation and Reasoning (KR'91). Cambridge, 1991

1990

Compiling Object Declarations into Connectionist Networks.

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

AI Commun., 1990

Dempster's Rule of Combination is #P-Complete.

Pekka Orponen

Artif. Intell., 1990

A neural implementation of conceptual hierarchies with Bayesian reasoning.

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

Proceedings of the IJCNN 1990, 1990

Programming Methods for Neural Computing.

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

Proceedings of the Parallelization in Inference Systems, 1990

On the Sample Complexity of Finding Good Search Strategies.

Pekka Orponen, Russell Greiner

Proceedings of the Third Annual Workshop on Computational Learning Theory, 1990

On the Instance Complexity of NP-Hard Problems.

Pekka Orponen

Proceedings of the Proceedings: Fifth Annual Structure in Complexity Theory Conference, 1990

1989

On the Computational Complexity of Analyzing Hopfield Nets.

Patrik Floréen, Pekka Orponen

Complex Syst., 1989

1988

Lowness Properties of Sets in the Exponential-Time Hierarchy.

Ronald V. Book, Pekka Orponen, David A. Russo, Osamu Watanabe

SIAM J. Comput., 1988

1987

On P-Subset Structures.

David A. Russo, Pekka Orponen

Math. Syst. Theory, 1987

1986

The Density and Complexity of Polynomial Cores for Intractable Sets.

Pekka Orponen, Uwe Schöning

Inf. Control., July, 1986

A Classification of Complexity Core Lattices.

Pekka Orponen

Theor. Comput. Sci., 1986

Optimal Approximations and Polynomially Levelable Sets.

Pekka Orponen, David A. Russo, Uwe Schöning

SIAM J. Comput., 1986

On Exponential Lowness.

Ronald V. Book, Pekka Orponen, David A. Russo, Osamu Watanabe

Proceedings of the Automata, Languages and Programming, 13th International Colloquium, 1986

What Is a Hard Instance of a Computational Problem?.

Ker-I Ko, Pekka Orponen, Uwe Schöning, Osamu Watanabe

Proceedings of the Structure in Complexity Theory, 1986

1985

Polynomial Levelability and Maximal Complexity Cores.

Pekka Orponen, David A. Russo, Uwe Schöning

Proceedings of the Automata, 1985

1984

The Structure of Polynomial Complexity Cores (Extended Abstract).

Pekka Orponen, Uwe Schöning

Proceedings of the Mathematical Foundations of Computer Science 1984, 1984

1983

Complexity Classes of Alternating Machines with Oracles.

Pekka Orponen

Proceedings of the Automata, 1983