Pekka Orponen - RankMe

81 papers A* 7A 1B 11C 3Journal 41Unranked 16

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