Google
Google Scholar
MS Academic
CiteSeerX
CORE
Semantic ScholarPekka Orponen
Person information
- affiliation: Aalto University, Finland
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
showing all ?? records
2010 – today
- 2018
[j29]Pekka Orponen:
Design methods for 3D wireframe DNA nanostructures. Natural Computing 17(1): 147-160 (2018)- 2015
- [j28]Erik Benson, Abdulmelik Mohammed, Johan Gardell, Sergej Masich, Eugen Czeizler, Pekka Orponen, Björn Högberg:
DNA rendering of polyhedral meshes at the nanoscale. Nature 523(7561): 441-444 (2015) - 2014
- [j27]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): 297-319 (2014) - [j26]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: 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
- [j25]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, Pekka Orponen:
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]
- [e2]Thomas Erlebach, Sotiris E. Nikoletseas, Pekka Orponen:
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, Eugen Czeizler, Pekka Orponen:
Synthesizing Small and Reliable Tile Sets for Patterned DNA Self-assembly. DNA 2011: 145-159 - 2010
- [j24]Harri Haanpää, André Schumacher, Pekka Orponen:
Distributed algorithms for lifetime maximization in sensor networks via Min-Max spanning subgraphs. Wireless Networks 16(3): 875-887 (2010) - [c28]
- [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
- [c27]André Schumacher, Pekka Orponen, Thorn Thaler, Harri Haanpää:
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, Pekka Orponen:
Load Balancing by Distributed Optimisation in Ad Hoc Networks. MSN 2006: 873-884 - 2005
- [j23]Evan J. Griffiths, Pekka Orponen:
Optimization, block designs and No Free Lunch theorems. Inf. Process. Lett. 94(2): 55-61 (2005) - [j22]Patrik Floréen, Petteri Kaski, Jukka Kohonen, Pekka Orponen:
Lifetime maximization for multicasting in energy-constrained wireless networks. IEEE Journal on Selected Areas in Communications 23(1): 117-126 (2005) - [j21]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): 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, Satu Elisa Schaeffer:
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
- [j20]Sakari Seitz, Pekka Orponen:
An efficient local search method for random 3-satisfiability. Electronic Notes in Discrete Mathematics 16: 71-79 (2003) - [j19]Jirí Síma, Pekka Orponen:
Continuous-Time Symmetric Hopfield Nets Are Computationally Universal. Neural Computation 15(3): 693-733 (2003) - [j18]Jirí Síma, Pekka Orponen:
General-Purpose Computation with Neural Networks: A Survey of Complexity Theoretic Results. Neural Computation 15(12): 2727-2778 (2003) - [j17]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
- [j16]Jirí Síma, Pekka Orponen, Teemu Antti-Poika:
On the Computational Complexity of Binary and Analog Symmetric Hopfield Nets. Neural Computation 12(12): 2965-2989 (2001) - [c19]Jirí Síma, Pekka Orponen:
Exponential Transients in Continuous-Time Symmetric Hopfield Nets. ICANN 2001: 806-813 - [c18]
1990 – 1999
- 1999
- [c17]Jirí Síma, Pekka Orponen, Teemu Antti-Poika:
Some Afterthoughts on Hopfield Networks. SOFSEM 1999: 459-469 - 1998
- [j15]Wolfgang Maass, Pekka Orponen:
On the Effect of Analog Noise in Discrete-Time Analog Computations. Neural Computation 10(5): 1071-1095 (1998) - 1997
- [j14]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]
- [i1]Wolfgang Maass, Pekka Orponen:
On the Effect of Analog Noise in Discrete-Time Analog Computations. Electronic Colloquium on Computational Complexity (ECCC) 4(51) (1997) - 1996
- [j13]Russell Greiner, Pekka Orponen:
Probably Approximately Optimal Satisficing Strategies. Artif. Intell. 82(1-2): 21-44 (1996) - [j12]Harry Buhrman, Pekka Orponen:
Random Strings Make Hard Instances. J. Comput. Syst. Sci. 53(2): 261-266 (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, Ker-I Ko, Uwe Schöning, Osamu Watanabe:
Instance Complexity. J. ACM 41(1): 96-121 (1994) - [j10]
- [c13]Harry Buhrman, Pekka Orponen:
Random Strings Make Hard Instances. Structure in Complexity Theory Conference 1994: 217-222 - 1993
- [j9]Patrik Floréen, Pekka Orponen:
Attraction Radii in Binary Hopfield Nets are Hard to Compute. Neural Computation 5(5): 812-821 (1993) - [c12]
- 1992
- [c11]
- 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, Henry Tirri:
Compiling Object Declarations into Connectionist Networks. AI Commun. 3(4): 172-183 (1990) - [c9]Pekka Orponen:
On the Instance Complexity of NP-Hard Problems. Structure in Complexity Theory Conference 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 Systems 3(6) (1989) - 1988
- [j5]Ronald V. Book, Pekka Orponen, David A. Russo, Osamu Watanabe:
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. Mathematical Systems Theory 20(2-3): 129-136 (1987) - 1986
- [j3]Pekka Orponen, Uwe Schöning:
The Density and Complexity of Polynomial Cores for Intractable Sets. Information and Control 70(1): 54-68 (1986) - [j2]Pekka Orponen, David A. Russo, Uwe Schöning:
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, Uwe Schöning, Osamu Watanabe:
What Is a Hard Instance of a Computational Problem?. Structure in Complexity Theory Conference 1986: 197-217 - [c4]Ronald V. Book, Pekka Orponen, David A. Russo, Osamu Watanabe:
On Exponential Lowness. ICALP 1986: 40-49 - 1985
- [c3]Pekka Orponen, David A. Russo, Uwe Schöning:
Polynomial Levelability and Maximal Complexity Cores. ICALP 1985: 435-444 - 1984
- [c2]Pekka Orponen, Uwe Schöning:
The Structure of Polynomial Complexity Cores (Extended Abstract). MFCS 1984: 452-458 - 1983
- [c1]
Coauthor Index
maintained by 
at 
at 
data released under the ODC-BY 1.0 license; see also our legal information page
last updated on 2018-04-18 21:20 CEST by the dblp team