Pekka Orponen

Publication Activity (10 Years)

Years Active: 1983-2024
Publications (10 Years): 9

Top Topics

Secondary Structure

Top Venues

J. Comput. Syst. Sci.

J. Comput. Biol.

Publications

Malgorzata Nowicka, Vinay Kumar Gautam, Pekka Orponen
Automated Rendering of Multi-stranded DNA Complexes with Pseudoknots. UCNC (2024)
Antti Elonen, Abdulmelik Mohammed, Pekka Orponen
A General Design Method for Scaffold-Free DNA Wireframe Nanostructures. UCNC (2024)
Sami El-Mahgary, Eljas Soisalon-Soininen, Pekka Orponen, Petri Rönnholm, Hannu Hyyppä
OVI-3: A NoSQL visual query system supporting efficient anti-joins. J. Intell. Inf. Syst. 60 (3) (2023)
Mehdi Saman Booy, Alexander Ilin, Pekka Orponen
RNA secondary structure prediction with convolutional neural networks. BMC Bioinform. 23 (1) (2022)
Vo Hong Thanh, Dani Korpela, Pekka Orponen
Cotranscriptional Kinetic Folding of RNA Secondary Structures Including Pseudoknots. J. Comput. Biol. 28 (9) (2021)
Vinay Gautam, Shiting Long, Pekka Orponen
RuleDSD: A Rule-based Modelling and Simulation Tool for DNA Strand Displacement Systems. BIOINFORMATICS (2020)
Abdulmelik Mohammed, Pekka Orponen, Sachith Pai
Algorithmic Design of Cotranscriptionally Folding 2D RNA Origami Structures. UCNC (2018)
Pekka Orponen
Design methods for 3D wireframe DNA nanostructures. Nat. Comput. 17 (1) (2018)
Erik Benson, Abdulmelik Mohammed, Johan Gardell, Sergej Masich, Eugen Czeizler, Pekka Orponen, Björn Högberg
DNA rendering of polyhedral meshes at the nanoscale. Nat. 523 (7561) (2015)
Amotz Bar-Noy, Thomas Erlebach, Magnús M. Halldórsson, Sotiris E. Nikoletseas, Pekka Orponen
Editorial for Algorithms for Sensor Systems, Wireless Ad Hoc Networks and Autonomous Mobile Entities. Theor. Comput. Sci. 553 (2014)
Mika Göös, Tuomo Lempiäinen, Eugen Czeizler, Pekka Orponen
Search Methods for Tile Sets in Patterned DNA Self-Assembly. CoRR (2014)
Mika Göös, Tuomo Lempiäinen, Eugen Czeizler, Pekka Orponen
Search methods for tile sets in patterned DNA self-assembly. J. Comput. Syst. Sci. 80 (1) (2014)
Lauri Ahlroth, André Schumacher, Pekka Orponen
Online bin packing with delay and holding costs. Oper. Res. Lett. 41 (1) (2013)
Lu-lu Wu, Hai-Jun Zhou, Mikko Alava, Erik Aurell, Pekka Orponen
Witness of unsatisfiability for a random 3-satisfiability formula CoRR (2013)
Eugen Czeizler, Pekka Orponen
Yield Optimization Strategies for (DNA) Staged Tile Assembly Systems. TPNC (2013)
Lauri Ahlroth, Pekka Orponen
Unordered Constraint Satisfaction Games. MFCS (2012)
Tuomo Lempiäinen, Eugen Czeizler, Pekka Orponen
Synthesizing Small and Reliable Tile Sets for Patterned DNA Self-assembly. DNA (2011)
Harri Haanpää, André Schumacher, Pekka Orponen
Distributed algorithms for lifetime maximization in sensor networks via Min-Max spanning subgraphs. Wirel. Networks 16 (3) (2010)
Mika Göös, Pekka Orponen
Synthesizing Minimal Tile Sets for Patterned DNA Self-assembly. DNA (2010)
Mika Göös, Pekka Orponen
Synthesizing Minimal Tile Sets for Patterned DNA Self-Assembly CoRR (2009)
Mikko Alava, John Ardelius, Erik Aurell, Petteri Kaski, Supriya Krishnamurthy, Pekka Orponen, Sakari Seitz
Circumspect descent prevails in solving random constraint satisfaction problems. Proc. Natl. Acad. Sci. USA 105 (40) (2008)
André Schumacher, Pekka Orponen, Thorn Thaler, Harri Haanpää
Lifetime Maximization in Wireless Sensor Networks by Distributed Binary Search. EWSN (2008)
Pekka Orponen, Satu Elisa Schaeffer, Vanesa Avalos Gaytán
Locally computable approximations for spectral clustering and absorption times of random walks CoRR (2008)
Shreyas Prasad, André Schumacher, Harri Haanpää, Pekka Orponen
Balanced Multipath Source Routing. ICOIN (2007)
Harri Haanpää, André Schumacher, Thorn Thaler, Pekka Orponen
Distributed Computation of Maximum Lifetime Spanning Subgraphs in Sensor Networks. MSN (2007)
Mikko Alava, John Ardelius, Erik Aurell, Petteri Kaski, Supriya Krishnamurthy, Pekka Orponen, Sakari Seitz
Circumspect descent prevails in solving random constraint satisfaction problems CoRR (2007)
André Schumacher, Harri Haanpää, Satu Elisa Schaeffer, Pekka Orponen
Load Balancing by Distributed Optimisation in Ad Hoc Networks. MSN (2006)
Patrik Floréen, Petteri Kaski, Jukka Kohonen, Pekka Orponen
Lifetime maximization for multicasting in energy-constrained wireless networks. IEEE J. Sel. Areas Commun. 23 (1) (2005)
Patrik Floréen, Petteri Kaski, Jukka Kohonen, Pekka Orponen
Exact and approximate balanced data gathering in energy-constrained sensor networks. Theor. Comput. Sci. 344 (1) (2005)
Pekka Orponen, Satu Elisa Schaeffer
Local Clustering of Large Graphs by Approximate Fiedler Vectors. WEA (2005)
Sakari Seitz, Mikko Alava, Pekka Orponen
Focused Local Search for Random 3-Satisfiability CoRR (2005)
Evan J. Griffiths, Pekka Orponen
Optimization, block designs and No Free Lunch theorems. Inf. Process. Lett. 94 (2) (2005)
Sakari Seitz, Mikko Alava, Pekka Orponen
Threshold Behaviour of WalkSAT and Focused Metropolis Search on Random 3-Satisfiability. SAT (2005)
Emil Falck, Patrik Floréen, Petteri Kaski, Jukka Kohonen, Pekka Orponen
Balanced Data Gathering in Energy-Constrained Sensor Networks. ALGOSENSORS (2004)
Jirí Síma, Pekka Orponen
Continuous-Time Symmetric Hopfield Nets Are Computationally Universal. Neural Comput. 15 (3) (2003)
Jirí Síma, Pekka Orponen
Exponential transients in continuous-time Liapunov systems. Theor. Comput. Sci. 306 (1-3) (2003)
Patrik Floréen, Petteri Kaski, Jukka Kohonen, Pekka Orponen
Multicast time maximization in energy constrained wireless networks. DIALM-POMC (2003)
Jirí Síma, Pekka Orponen
General-Purpose Computation with Neural Networks: A Survey of Complexity Theoretic Results. Neural Comput. 15 (12) (2003)
Sakari Seitz, Pekka Orponen
An efficient local search method for random 3-satisfiability. Electron. Notes Discret. Math. 16 (2003)
Jirí Síma, Pekka Orponen
Computing with continuous-time Liapunov systems. STOC (2001)
Jirí Síma, Pekka Orponen, Teemu Antti-Poika
On the Computational Complexity of Binary and Analog Symmetric Hopfield Nets. Neural Comput. 12 (12) (2001)
Jirí Síma, Pekka Orponen
Exponential Transients in Continuous-Time Symmetric Hopfield Nets. ICANN (2001)
Jirí Síma, Pekka Orponen, Teemu Antti-Poika
Some Afterthoughts on Hopfield Networks. SOFSEM (1999)
Wolfgang Maass, Pekka Orponen
On the Effect of Analog Noise in Discrete-Time Analog Computations. Neural Comput. 10 (5) (1998)
Pekka Orponen
A Survey of Continous-Time Computation Theory. Advances in Algorithms, Languages, and Complexity (1997)
Pekka Orponen
The Computational Power of Continuous Time Neural Networks. SOFSEM (1997)
Wolfgang Maass, Pekka Orponen
On the Effect of Analog Noise in Discrete-Time Analog Computations Electron. Colloquium Comput. Complex. 4 (51) (1997)
Pekka Orponen
Computing with Truly Asynchronous Threshold Logic Networks. Theor. Comput. Sci. 174 (1-2) (1997)
Pekka Orponen
The Computational Power of Discrete Hopfield Nets with Hidden Units. Neural Comput. 8 (2) (1996)
Russell Greiner, Pekka Orponen
Probably Approximately Optimal Satisficing Strategies. Artif. Intell. 82 (1-2) (1996)
Harry Buhrman, Pekka Orponen
Random Strings Make Hard Instances. J. Comput. Syst. Sci. 53 (2) (1996)
Wolfgang Maass, Pekka Orponen
On the Effect of Analog Noise in Discrete-Time Analog Computations. NIPS (1996)
Harry Buhrman, Pekka Orponen
Random Strings Make Hard Instances. Computational Complexity Conference (1994)
Pekka Orponen, Ker-I Ko, Uwe Schöning, Osamu Watanabe
Instance Complexity. J. ACM 41 (1) (1994)
Pekka Orponen
Neural Networks and Complexity Theory. Nord. J. Comput. 1 (1) (1994)
Pekka Orponen
On the Computational Power of Discrete Hopfield Nets. ICALP (1993)
Patrik Floréen, Pekka Orponen
Attraction Radii in Binary Hopfield Nets are Hard to Compute. Neural Comput. 5 (5) (1993)
Pekka Orponen
Neural Networks and Complexity Theory. MFCS (1992)
Russell Greiner, Pekka Orponen
Probably Approximately Optimal Derivation Strategies. KR (1991)
Pekka Orponen
On the Instance Complexity of NP-Hard Problems. Computational Complexity Conference (1990)
Patrik Floréen, Petri Myllymäki, Pekka Orponen, Henry Tirri
Compiling Object Declarations into Connectionist Networks. AI Commun. 3 (4) (1990)
Pekka Orponen
Dempster's Rule of Combination is #P-Complete. Artif. Intell. 44 (1-2) (1990)
Pekka Orponen, Russell Greiner
On the Sample Complexity of Finding Good Search Strategies. COLT (1990)
Pekka Orponen, Patrik Floréen, Petri Myllymäki, Henry Tirri
A neural implementation of conceptual hierarchies with Bayesian reasoning. IJCNN (1990)
Henry Tirri, Petri Myllymäki, Pekka Orponen, Patrik Floréen
Programming Methods for Neural Computing. Dagstuhl Seminar on Parallelization in Inference Systems (1990)
Patrik Floréen, Pekka Orponen
On the Computational Complexity of Analyzing Hopfield Nets. Complex Syst. 3 (6) (1989)
Ronald V. Book, Pekka Orponen, David A. Russo, Osamu Watanabe
Lowness Properties of Sets in the Exponential-Time Hierarchy. SIAM J. Comput. 17 (3) (1988)
David A. Russo, Pekka Orponen
On P-Subset Structures. Math. Syst. Theory 20 (2-3) (1987)
Pekka Orponen, David A. Russo, Uwe Schöning
Optimal Approximations and Polynomially Levelable Sets. SIAM J. Comput. 15 (2) (1986)
Ker-I Ko, Pekka Orponen, Uwe Schöning, Osamu Watanabe
What Is a Hard Instance of a Computational Problem?. Computational Complexity Conference (1986)
Ronald V. Book, Pekka Orponen, David A. Russo, Osamu Watanabe
On Exponential Lowness. ICALP (1986)
Pekka Orponen, Uwe Schöning
The Density and Complexity of Polynomial Cores for Intractable Sets. Inf. Control. 70 (1) (1986)
Pekka Orponen
A Classification of Complexity Core Lattices. Theor. Comput. Sci. 47 (3) (1986)
Pekka Orponen, David A. Russo, Uwe Schöning
Polynomial Levelability and Maximal Complexity Cores. ICALP (1985)
Pekka Orponen, Uwe Schöning
The Structure of Polynomial Complexity Cores (Extended Abstract). MFCS (1984)
Pekka Orponen
Complexity Classes of Alternating Machines with Oracles. ICALP (1983)