default search action
Pekka Orponen
Person information
- affiliation: Aalto University, Finland
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [c36]Antti Elonen, Pekka Orponen:
Designing 3D RNA Origami Nanostructures with a Minimum Number of Kissing Loops. DNA 2024: 4:1-4:12 - [c35]Antti Elonen, Abdulmelik Mohammed
, Pekka Orponen
A General Design Method for Scaffold-Free DNA Wireframe Nanostructures. UCNC 2024: 178-189 - [c34]Malgorzata Nowicka, Vinay Kumar Gautam, Pekka Orponen
Automated Rendering of Multi-stranded DNA Complexes with Pseudoknots. UCNC 2024: 190-202 - 2023
- [j34]Sami El-Mahgary, Eljas Soisalon-Soininen, Pekka Orponen
OVI-3: A NoSQL visual query system supporting efficient anti-joins. J. Intell. Inf. Syst. 60(3): 777-801 (2023) - 2022
- [j33]Mehdi Saman Booy, Alexander Ilin, Pekka Orponen
RNA secondary structure prediction with convolutional neural networks. BMC Bioinform. 23(1): 58 (2022) - 2021
- [j32]Vo Hong Thanh
Cotranscriptional Kinetic Folding of RNA Secondary Structures Including Pseudoknots. J. Comput. Biol. 28(9): 892-908 (2021) - [e3]Irina Kostitsyna
Unconventional Computation and Natural Computation - 19th International Conference, UCNC 2021, Espoo, Finland, October 18-22, 2021, Proceedings. Lecture Notes in Computer Science 12984, Springer 2021, ISBN 978-3-030-87992-1 [contents] - 2020
- [c33]Vinay Gautam
RuleDSD: A Rule-based Modelling and Simulation Tool for DNA Strand Displacement Systems. BIOINFORMATICS 2020: 158-167
2010 – 2019
- 2018
- [j31]Pekka Orponen
Design methods for 3D wireframe DNA nanostructures. Nat. Comput. 17(1): 147-160 (2018) - [c32]Abdulmelik Mohammed
Algorithmic Design of Cotranscriptionally Folding 2D RNA Origami Structures. UCNC 2018: 159-172 - 2015
- [j30]Erik Benson
DNA rendering of polyhedral meshes at the nanoscale. Nat. 523(7561): 441-444 (2015) - 2014
- [j29]Mika Göös, Tuomo Lempiäinen
Search methods for tile sets in patterned DNA self-assembly. J. Comput. Syst. Sci. 80(1): 297-319 (2014) - [j28]Amotz Bar-Noy, Thomas Erlebach
Editorial for Algorithms for Sensor Systems, Wireless Ad Hoc Networks and Autonomous Mobile Entities. Theor. Comput. Sci. 553: 1 (2014) - [i7]Mika Göös, Tuomo Lempiäinen, Eugen Czeizler, Pekka Orponen:
Search Methods for Tile Sets in Patterned DNA Self-Assembly. CoRR abs/1412.7219 (2014) - 2013
- [j27]Lauri Ahlroth, André Schumacher, Pekka Orponen
Online bin packing with delay and holding costs. Oper. Res. Lett. 41(1): 1-6 (2013) - [c31]Eugen Czeizler
Yield Optimization Strategies for (DNA) Staged Tile Assembly Systems. TPNC 2013: 31-44 - [i6]Lu-lu Wu, Hai-Jun Zhou, Mikko Alava, Erik Aurell, Pekka Orponen:
Witness of unsatisfiability for a random 3-satisfiability formula. CoRR abs/1303.2413 (2013) - 2012
- [c30]Lauri Ahlroth, Pekka Orponen
Unordered Constraint Satisfaction Games. MFCS 2012: 64-75 - [e2]Thomas Erlebach
Algorithms for Sensor Systems - 7th International Symposium on Algorithms for Sensor Systems, Wireless Ad Hoc Networks and Autonomous Mobile Entities, ALGOSENSORS 2011, Saarbrücken, Germany, September 8-9, 2011, Revised Selected Papers. Lecture Notes in Computer Science 7111, Springer 2012, ISBN 978-3-642-28208-9 [contents] - 2011
- [c29]Tuomo Lempiäinen
Synthesizing Small and Reliable Tile Sets for Patterned DNA Self-assembly. DNA 2011: 145-159 - 2010
- [j26]Harri Haanpää, André Schumacher, Pekka Orponen
Distributed algorithms for lifetime maximization in sensor networks via Min-Max spanning subgraphs. Wirel. Networks 16(3): 875-887 (2010) - [c28]Mika Göös, Pekka Orponen
Synthesizing Minimal Tile Sets for Patterned DNA Self-assembly. DNA 2010: 71-82 - [e1]Tapio Elomaa, Heikki Mannila, Pekka Orponen:
Algorithms and Applications, Essays Dedicated to Esko Ukkonen on the Occasion of His 60th Birthday. Lecture Notes in Computer Science 6060, Springer 2010, ISBN 978-3-642-12475-4 [contents]
2000 – 2009
- 2009
- [i5]Mika Göös, Pekka Orponen:
Synthesizing Minimal Tile Sets for Patterned DNA Self-Assembly. CoRR abs/0911.2924 (2009) - 2008
- [j25]Mikko Alava, John Ardelius, Erik Aurell, Petteri Kaski, Supriya Krishnamurthy, Pekka Orponen
Circumspect descent prevails in solving random constraint satisfaction problems. Proc. Natl. Acad. Sci. USA 105(40): 15253-15257 (2008) - [c27]André Schumacher, Pekka Orponen
Lifetime Maximization in Wireless Sensor Networks by Distributed Binary Search. EWSN 2008: 237-252 - [i4]Pekka Orponen, Satu Elisa Schaeffer, Vanesa Avalos Gaytán:
Locally computable approximations for spectral clustering and absorption times of random walks. CoRR abs/0810.4061 (2008) - 2007
- [c26]Shreyas Prasad, André Schumacher, Harri Haanpää, Pekka Orponen
Balanced Multipath Source Routing. ICOIN 2007: 315-324 - [c25]Harri Haanpää, André Schumacher, Thorn Thaler, Pekka Orponen
Distributed Computation of Maximum Lifetime Spanning Subgraphs in Sensor Networks. MSN 2007: 445-456 - [i3]Mikko Alava, John Ardelius, Erik Aurell, Petteri Kaski, Supriya Krishnamurthy, Pekka Orponen, Sakari Seitz:
Circumspect descent prevails in solving random constraint satisfaction problems. CoRR abs/0711.4902 (2007) - 2006
- [c24]André Schumacher, Harri Haanpää, Satu Elisa Schaeffer
Load Balancing by Distributed Optimisation in Ad Hoc Networks. MSN 2006: 873-884 - 2005
- [j24]Evan J. Griffiths, Pekka Orponen
Optimization, block designs and No Free Lunch theorems. Inf. Process. Lett. 94(2): 55-61 (2005) - [j23]Patrik Floréen
Lifetime maximization for multicasting in energy-constrained wireless networks. IEEE J. Sel. Areas Commun. 23(1): 117-126 (2005) - [j22]Patrik Floréen
Exact and approximate balanced data gathering in energy-constrained sensor networks. Theor. Comput. Sci. 344(1): 30-46 (2005) - [c23]Sakari Seitz, Mikko Alava, Pekka Orponen:
Threshold Behaviour of WalkSAT and Focused Metropolis Search on Random 3-Satisfiability. SAT 2005: 475-481 - [c22]Pekka Orponen
Local Clustering of Large Graphs by Approximate Fiedler Vectors. WEA 2005: 524-533 - [i2]Sakari Seitz, Mikko Alava, Pekka Orponen:
Focused Local Search for Random 3-Satisfiability. CoRR abs/cond-mat/0501707 (2005) - 2004
- [c21]Emil Falck, Patrik Floréen, Petteri Kaski, Jukka Kohonen, Pekka Orponen
Balanced Data Gathering in Energy-Constrained Sensor Networks. ALGOSENSORS 2004: 59-70 - 2003
- [j21]Sakari Seitz, Pekka Orponen
An efficient local search method for random 3-satisfiability. Electron. Notes Discret. Math. 16: 71-79 (2003) - [j20]Jirí Síma, Pekka Orponen
Continuous-Time Symmetric Hopfield Nets Are Computationally Universal. Neural Comput. 15(3): 693-733 (2003) - [j19]Jirí Síma, Pekka Orponen
General-Purpose Computation with Neural Networks: A Survey of Complexity Theoretic Results. Neural Comput. 15(12): 2727-2778 (2003) - [j18]Jirí Síma, Pekka Orponen
Exponential transients in continuous-time Liapunov systems. Theor. Comput. Sci. 306(1-3): 353-372 (2003) - [c20]Patrik Floréen, Petteri Kaski, Jukka Kohonen, Pekka Orponen
Multicast time maximization in energy constrained wireless networks. DIALM-POMC 2003: 50-58 - 2001
- [j17]Jirí Síma, Pekka Orponen
On the Computational Complexity of Binary and Analog Symmetric Hopfield Nets. Neural Comput. 12(12): 2965-2989 (2001) - [c19]Jirí Síma, Pekka Orponen
Exponential Transients in Continuous-Time Symmetric Hopfield Nets. ICANN 2001: 806-813 - [c18]Jirí Síma, Pekka Orponen
Computing with continuous-time Liapunov systems. STOC 2001: 722-731
1990 – 1999
- 1999
- [c17]Jirí Síma, Pekka Orponen
Some Afterthoughts on Hopfield Networks. SOFSEM 1999: 459-469 - 1998
- [j16]Wolfgang Maass, Pekka Orponen
On the Effect of Analog Noise in Discrete-Time Analog Computations. Neural Comput. 10(5): 1071-1095 (1998) - 1997
- [j15]Pekka Orponen
Computing with Truly Asynchronous Threshold Logic Networks. Theor. Comput. Sci. 174(1-2): 123-136 (1997) - [c16]Pekka Orponen:
A Survey of Continous-Time Computation Theory. Advances in Algorithms, Languages, and Complexity 1997: 209-224 - [c15]Pekka Orponen
The Computational Power of Continuous Time Neural Networks. SOFSEM 1997: 86-103 - [i1]Wolfgang Maass, Pekka Orponen:
On the Effect of Analog Noise in Discrete-Time Analog Computations. Electron. Colloquium Comput. Complex. TR97 (1997) - 1996
- [j14]Russell Greiner, Pekka Orponen
Probably Approximately Optimal Satisficing Strategies. Artif. Intell. 82(1-2): 21-44 (1996) - [j13]Harry Buhrman, Pekka Orponen
Random Strings Make Hard Instances. J. Comput. Syst. Sci. 53(2): 261-266 (1996) - [j12]Pekka Orponen
The Computational Power of Discrete Hopfield Nets with Hidden Units. Neural Comput. 8(2): 403-415 (1996) - [c14]Wolfgang Maass, Pekka Orponen:
On the Effect of Analog Noise in Discrete-Time Analog Computations. NIPS 1996: 218-224 - 1994
- [j11]Pekka Orponen
Instance Complexity. J. ACM 41(1): 96-121 (1994) - [j10]Pekka Orponen:
Neural Networks and Complexity Theory. Nord. J. Comput. 1(1): 94-110 (1994) - [c13]Harry Buhrman, Pekka Orponen
Random Strings Make Hard Instances. SCT 1994: 217-222 - 1993
- [j9]Patrik Floréen
Attraction Radii in Binary Hopfield Nets are Hard to Compute. Neural Comput. 5(5): 812-821 (1993) - [c12]Pekka Orponen
On the Computational Power of Discrete Hopfield Nets. ICALP 1993: 215-226 - 1992
- [c11]Pekka Orponen
Neural Networks and Complexity Theory. MFCS 1992: 50-61 - 1991
- [c10]Russell Greiner, Pekka Orponen:
Probably Approximately Optimal Derivation Strategies. KR 1991: 277-288 - 1990
- [j8]Pekka Orponen
Dempster's Rule of Combination is #P-Complete. Artif. Intell. 44(1-2): 245-253 (1990) - [j7]Patrik Floréen, Petri Myllymäki, Pekka Orponen
Compiling Object Declarations into Connectionist Networks. AI Commun. 3(4): 172-183 (1990) - [c9]Pekka Orponen
On the Instance Complexity of NP-Hard Problems. SCT 1990: 20-27 - [c8]Pekka Orponen, Russell Greiner:
On the Sample Complexity of Finding Good Search Strategies. COLT 1990: 352-358 - [c7]Henry Tirri, Petri Myllymäki, Pekka Orponen, Patrik Floréen:
Programming Methods for Neural Computing. Dagstuhl Seminar on Parallelization in Inference Systems 1990: 357 - [c6]Pekka Orponen, Patrik Floréen, Petri Myllymäki, Henry Tirri:
A neural implementation of conceptual hierarchies with Bayesian reasoning. IJCNN 1990: 297-303
1980 – 1989
- 1989
- [j6]Patrik Floréen, Pekka Orponen:
On the Computational Complexity of Analyzing Hopfield Nets. Complex Syst. 3(6) (1989) - 1988
- [j5]Ronald V. Book, Pekka Orponen
Lowness Properties of Sets in the Exponential-Time Hierarchy. SIAM J. Comput. 17(3): 504-516 (1988) - 1987
- [j4]David A. Russo, Pekka Orponen
On P-Subset Structures. Math. Syst. Theory 20(2-3): 129-136 (1987) - 1986
- [j3]Pekka Orponen
The Density and Complexity of Polynomial Cores for Intractable Sets. Inf. Control. 70(1): 54-68 (1986) - [j2]Pekka Orponen
Optimal Approximations and Polynomially Levelable Sets. SIAM J. Comput. 15(2): 399-408 (1986) - [j1]Pekka Orponen
A Classification of Complexity Core Lattices. Theor. Comput. Sci. 47(3): 121-130 (1986) - [c5]Ker-I Ko, Pekka Orponen
What Is a Hard Instance of a Computational Problem?. SCT 1986: 197-217 - [c4]Ronald V. Book, Pekka Orponen
On Exponential Lowness. ICALP 1986: 40-49 - 1985
- [c3]Pekka Orponen
Polynomial Levelability and Maximal Complexity Cores. ICALP 1985: 435-444 - 1984
- [c2]Pekka Orponen
The Structure of Polynomial Complexity Cores (Extended Abstract). MFCS 1984: 452-458 - 1983
- [c1]Pekka Orponen
Complexity Classes of Alternating Machines with Oracles. ICALP 1983: 573-584
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 21:23 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: