Pekka Orponen
Professor at Aalto University School of Business
Schools
- Aalto University School of Business
Links
Biography
Aalto University School of Business
Research Interests:
- Algorithmics of self-organisation
- DNA self-assembly
- Stochastic and online algorithms
- Computational complexity theory
Peer-reviewed scientific articles
Journal article-refereed, Original researchDesign methods for 3D wireframe DNA nanostructures
Orponen, Pekka2017 in NATURAL COMPUTING (Springer Netherlands)ISSN: 1567-7818Computer-aided production of scaffolded DNA nanostructures from flat sheet meshes
Benson, Erik; Mohammed, Abdulmelik; Bosco, Alessandro; Teixeira, Ana I.; Orponen, Pekka; Högberg, Björn2016 in ANGEWANDTE CHEMIE (Wiley-VCH Verlag GmbH & Co. KGaA)ISSN: 1433-7851DNA rendering of polyhedral meshes at the nanoscale
Benson, Erik; Mohammed, Abdulmelik; Gardell, Johan; Masich, Sergej; Czeizler, Eugen; Orponen, Pekka; Högberg, Björn2015 in NATURE (NATURE PUBLISHING GROUP)ISSN: 0028-0836Fault tolerant design and analysis of carbon nanotube circuits affixed on DNA origami tiles
Czeizler, Eugen; Orponen, Pekka2015 in IEEE TRANSACTIONS ON NANOTECHNOLOGY (Institute of Electrical and Electronics Engineers Inc.)ISSN: 1536-125XEditorial for Algorithms for Sensor Systems, Wireless Ad Hoc Networks and Autonomous Mobile Entities
Bar-Noy, Amotz; Erlebach, Thomas; Halldorsson, Magnus M.; Nikoletseas, Sotiris; Orponen, Pekka2014 in THEORETICAL COMPUTER SCIENCE (ELSEVIER SCIENCE BV)ISSN: 0304-3975Search methods for tile sets in patterned DNA self-assembly
Göös, Mika; Lempiäinen, Tuomo; Czeizler, Eugen; Orponen, Pekka2014 in JOURNAL OF COMPUTER AND SYSTEM SCIENCES (Academic Press Inc.)ISSN: 0022-0000Online bin packing with delay and holding costs
Ahlroth, Lauri; Schumacher, André; Orponen, Pekka2013 in Operations Research Letters (Elsevier)ISSN: 0167-6377Witness of unsatisfiability for a random 3-satisfiability formula
Wu, Lu-Lu; Zhou, Hai-Jun; Alava, Mikko; Aurell, Erik; Orponen, Pekka2013 in PHYSICAL REVIEW E (AMER PHYSICAL SOC)ISSN: 1539-3755Distributed algorithms for lifetime maximization in sensor networks via min-max spanning subgraphs
Haanpää, Harri; Schumacher, André; Orponen, Pekka2010 in WIRELESS NETWORKS (Springer Netherlands)ISSN: 1022-0038Circumspect descent prevails in solving random constraint satisfaction problems
Alava, Mikko; Ardelius, John; Aurell, Erik; Kaski, Petteri; Krishnamurthy, Supriya; Orponen, Pekka2008 in PROCEEDINGS OF THE NATIONAL ACADEMY OF SCIENCES OF THE UNITED STATES OF AMERICA (NATL ACAD SCIENCES)Lifetime maximization for multicasting in energy-constrained wireless networks
Floréen, Patrik; Kaski, Petteri; Kohonen, Jukka; Orponen, Pekka2005 in IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS (IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC)ISSN: 0733-8716Exact and approximate balanced data gathering in energy-constrained sensor networks
Floréen, Patrik; Kaski, Petteri; Kohonen, Jukka; Orponen, Pekka2005 in THEORETICAL COMPUTER SCIENCE (ELSEVIER SCIENCE BV)ISSN: 0304-3975Optimization, block designs and No Free Lunch theorems
Griffiths, Evan; Orponen, Pekka2005 in INFORMATION PROCESSING LETTERS (Elsevier)ISSN: 0020-0190Focused local search for random 3-satisfiability.
Seitz, Sakari; Alava, Mikko; Orponen, Pekka2005 in Journal od Statistical Mechanics: Theory and Experiment (Elsevier)An efficient local search method for random 3-satisfiability
Seitz, Sakari; Orponen, Pekka2003 in ELECTRONIC NOTES IN DISCRETE MATHEMATICS (Elsevier)General purpose computation with neural networks: a survey of complexity theoretic results
Sima, Jiri; Orponen, Pekka2003 in NEURAL COMPUTATION (MIT PRESS)ISSN: 0899-7667Continuous-time symmetric Hopfield nets are computationally universal
Sima, Jiri; Orponen, Pekka2003 in NEURAL COMPUTATION (MIT PRESS)ISSN: 0899-7667Exponential transients in continuous-time Liapunov systems
Sima, Jiri; Orponen, Pekka2003 in THEORETICAL COMPUTER SCIENCE (ELSEVIER SCIENCE BV)ISSN: 0304-3975On the effect of analog noise in discrete-time analog computations
Maass, Wolfgang; Orponen, Pekka1998 in NEURAL COMPUTATION (MIT PRESS)ISSN: 0899-7667Computing with truly asynchronous threshold logic networks
Orponen, Pekka1997 in THEORETICAL COMPUTER SCIENCE (ELSEVIER SCIENCE BV)ISSN: 0304-3975Random strings make hard instances
Buhrman, Harry; Orponen, Pekka1996 in JOURNAL OF COMPUTER AND SYSTEM SCIENCES (Academic Press Inc.)ISSN: 0022-0000Probably approximately optimal satisficing strategies
Greiner, Russell; Orponen, Pekka1996 in ARTIFICIAL INTELLIGENCE (ELSEVIER SCIENCE BV)ISSN: 0004-3702The computational power of discrete Hopfield nets with hidden units
Orponen, Pekka1996 in NEURAL COMPUTATION (MIT PRESS)ISSN: 0899-7667Neural networks and complexity theory
Orponen, Pekka1994 in NORDIC JOURNAL OF COMPUTING (MIT PRESS)ISSN: 1236-6064Instance complexity
Orponen, Pekka; Ko, Ker-I; Schöning, Uwe; Watanabe, Osamu1994 in JOURNAL OF THE ACM (Association for Computing Machinery (ACM))ISSN: 0004-5411Attraction radii in binary Hopfield nets are hard to compute
Floréen, Patrik; Orponen, Pekka1993 in NEURAL COMPUTATION (MIT PRESS)ISSN: 0899-7667Compiling object declarations into connectionist networks
Floréen, Patrik; Myllymäki, Petri; Orponen, Pekka; Tirri, Henry1990 in AI COMMUNICATIONS (IOS PRESS)ISSN: 0921-7126Dempster's rule of combination is #P-complete
Orponen, Pekka1990 in ARTIFICIAL INTELLIGENCE (ELSEVIER SCIENCE BV)ISSN: 0004-3702Lowness properties of sets in the exponential-time hierarchy
Book, Ronald V.; Orponen, Pekka; Russo, David A.; Watanabe, Osamu1988 in SIAM JOURNAL ON COMPUTING (Society for Industrial and Applied Mathematics Publications)ISSN: 0097-5397On P-subset structures
Russo, David A.; Orponen, Pekka1987 in THEORY OF COMPUTING SYSTEMS (Springer New York)ISSN: 1432-4350A classification of complexity core lattices
Orponen, Pekka1986 in THEORETICAL COMPUTER SCIENCE (ELSEVIER SCIENCE BV)ISSN: 0304-3975Optimal approximations and polynomially levelable sets
Orponen, Pekka; Russo, David A.; Schöning, Uwe1986 in SIAM JOURNAL ON COMPUTING (Society for Industrial and Applied Mathematics Publications)ISSN: 0097-5397The density and complexity of polynomial cores for intractable sets
Orponen, Pekka; Schöning, Uwe1986 in INFORMATION AND COMPUTATION (Elsevier Inc.)ISSN: 0890-5401
Design methods for 3D wireframe DNA nanostructures
Orponen, Pekka
2017 in NATURAL COMPUTING (Springer Netherlands)ISSN: 1567-7818
Computer-aided production of scaffolded DNA nanostructures from flat sheet meshes
Benson, Erik; Mohammed, Abdulmelik; Bosco, Alessandro; Teixeira, Ana I.; Orponen, Pekka; Högberg, Björn
2016 in ANGEWANDTE CHEMIE (Wiley-VCH Verlag GmbH & Co. KGaA)ISSN: 1433-7851
DNA rendering of polyhedral meshes at the nanoscale
Benson, Erik; Mohammed, Abdulmelik; Gardell, Johan; Masich, Sergej; Czeizler, Eugen; Orponen, Pekka; Högberg, Björn
2015 in NATURE (NATURE PUBLISHING GROUP)ISSN: 0028-0836
Fault tolerant design and analysis of carbon nanotube circuits affixed on DNA origami tiles
Czeizler, Eugen; Orponen, Pekka
2015 in IEEE TRANSACTIONS ON NANOTECHNOLOGY (Institute of Electrical and Electronics Engineers Inc.)ISSN: 1536-125X
Editorial for Algorithms for Sensor Systems, Wireless Ad Hoc Networks and Autonomous Mobile Entities
Bar-Noy, Amotz; Erlebach, Thomas; Halldorsson, Magnus M.; Nikoletseas, Sotiris; Orponen, Pekka
2014 in THEORETICAL COMPUTER SCIENCE (ELSEVIER SCIENCE BV)ISSN: 0304-3975
Search methods for tile sets in patterned DNA self-assembly
Göös, Mika; Lempiäinen, Tuomo; Czeizler, Eugen; Orponen, Pekka
2014 in JOURNAL OF COMPUTER AND SYSTEM SCIENCES (Academic Press Inc.)ISSN: 0022-0000
Online bin packing with delay and holding costs
Ahlroth, Lauri; Schumacher, André; Orponen, Pekka
2013 in Operations Research Letters (Elsevier)ISSN: 0167-6377
Witness of unsatisfiability for a random 3-satisfiability formula
Wu, Lu-Lu; Zhou, Hai-Jun; Alava, Mikko; Aurell, Erik; Orponen, Pekka
2013 in PHYSICAL REVIEW E (AMER PHYSICAL SOC)ISSN: 1539-3755
Distributed algorithms for lifetime maximization in sensor networks via min-max spanning subgraphs
Haanpää, Harri; Schumacher, André; Orponen, Pekka
2010 in WIRELESS NETWORKS (Springer Netherlands)ISSN: 1022-0038
Circumspect descent prevails in solving random constraint satisfaction problems
Alava, Mikko; Ardelius, John; Aurell, Erik; Kaski, Petteri; Krishnamurthy, Supriya; Orponen, Pekka
2008 in PROCEEDINGS OF THE NATIONAL ACADEMY OF SCIENCES OF THE UNITED STATES OF AMERICA (NATL ACAD SCIENCES)Lifetime maximization for multicasting in energy-constrained wireless networks
Floréen, Patrik; Kaski, Petteri; Kohonen, Jukka; Orponen, Pekka
2005 in IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS (IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC)ISSN: 0733-8716
Exact and approximate balanced data gathering in energy-constrained sensor networks
Floréen, Patrik; Kaski, Petteri; Kohonen, Jukka; Orponen, Pekka
2005 in THEORETICAL COMPUTER SCIENCE (ELSEVIER SCIENCE BV)ISSN: 0304-3975
Optimization, block designs and No Free Lunch theorems
Griffiths, Evan; Orponen, Pekka
2005 in INFORMATION PROCESSING LETTERS (Elsevier)ISSN: 0020-0190
Focused local search for random 3-satisfiability.
Seitz, Sakari; Alava, Mikko; Orponen, Pekka
2005 in Journal od Statistical Mechanics: Theory and Experiment (Elsevier)An efficient local search method for random 3-satisfiability
Seitz, Sakari; Orponen, Pekka
2003 in ELECTRONIC NOTES IN DISCRETE MATHEMATICS (Elsevier)General purpose computation with neural networks: a survey of complexity theoretic results
Sima, Jiri; Orponen, Pekka
2003 in NEURAL COMPUTATION (MIT PRESS)ISSN: 0899-7667
Continuous-time symmetric Hopfield nets are computationally universal
Sima, Jiri; Orponen, Pekka
2003 in NEURAL COMPUTATION (MIT PRESS)ISSN: 0899-7667
Exponential transients in continuous-time Liapunov systems
Sima, Jiri; Orponen, Pekka
2003 in THEORETICAL COMPUTER SCIENCE (ELSEVIER SCIENCE BV)ISSN: 0304-3975
On the effect of analog noise in discrete-time analog computations
Maass, Wolfgang; Orponen, Pekka
1998 in NEURAL COMPUTATION (MIT PRESS)ISSN: 0899-7667
Computing with truly asynchronous threshold logic networks
Orponen, Pekka
1997 in THEORETICAL COMPUTER SCIENCE (ELSEVIER SCIENCE BV)ISSN: 0304-3975
Random strings make hard instances
Buhrman, Harry; Orponen, Pekka
1996 in JOURNAL OF COMPUTER AND SYSTEM SCIENCES (Academic Press Inc.)ISSN: 0022-0000
Probably approximately optimal satisficing strategies
Greiner, Russell; Orponen, Pekka
1996 in ARTIFICIAL INTELLIGENCE (ELSEVIER SCIENCE BV)ISSN: 0004-3702
The computational power of discrete Hopfield nets with hidden units
Orponen, Pekka
1996 in NEURAL COMPUTATION (MIT PRESS)ISSN: 0899-7667
Neural networks and complexity theory
Orponen, Pekka
1994 in NORDIC JOURNAL OF COMPUTING (MIT PRESS)ISSN: 1236-6064
Instance complexity
Orponen, Pekka; Ko, Ker-I; Schöning, Uwe; Watanabe, Osamu
1994 in JOURNAL OF THE ACM (Association for Computing Machinery (ACM))ISSN: 0004-5411
Attraction radii in binary Hopfield nets are hard to compute
Floréen, Patrik; Orponen, Pekka
1993 in NEURAL COMPUTATION (MIT PRESS)ISSN: 0899-7667
Compiling object declarations into connectionist networks
Floréen, Patrik; Myllymäki, Petri; Orponen, Pekka; Tirri, Henry
1990 in AI COMMUNICATIONS (IOS PRESS)ISSN: 0921-7126
Dempster's rule of combination is #P-complete
Orponen, Pekka
1990 in ARTIFICIAL INTELLIGENCE (ELSEVIER SCIENCE BV)ISSN: 0004-3702
Lowness properties of sets in the exponential-time hierarchy
Book, Ronald V.; Orponen, Pekka; Russo, David A.; Watanabe, Osamu
1988 in SIAM JOURNAL ON COMPUTING (Society for Industrial and Applied Mathematics Publications)ISSN: 0097-5397
On P-subset structures
Russo, David A.; Orponen, Pekka
1987 in THEORY OF COMPUTING SYSTEMS (Springer New York)ISSN: 1432-4350
A classification of complexity core lattices
Orponen, Pekka
1986 in THEORETICAL COMPUTER SCIENCE (ELSEVIER SCIENCE BV)ISSN: 0304-3975
Optimal approximations and polynomially levelable sets
Orponen, Pekka; Russo, David A.; Schöning, Uwe
1986 in SIAM JOURNAL ON COMPUTING (Society for Industrial and Applied Mathematics Publications)ISSN: 0097-5397
The density and complexity of polynomial cores for intractable sets
Orponen, Pekka; Schöning, Uwe
1986 in INFORMATION AND COMPUTATION (Elsevier Inc.)ISSN: 0890-5401
Conference proceedingsYield optimization strategies for DNA staged tile assembly systems
Czeizler, Eugen; Orponen, Pekka2013 ISBN: 978-3-642-45007-5Unordered constraint satisfaction games
Ahlroth, Lauri; Orponen, Pekka2012 ISBN: 978-3-642-32588-5ISSN: 0302-9743Synthesizing minimal tile sets for patterned DNA self-assembly
Göös, Mika; Orponen, Pekka2011 ISSN: 0302-9743Synthesizing small and reliable tile sets for patterned DNA self-assembly
Lempiäinen, Tuomo; Czeizler, Eugen; Orponen, Pekka2011 in Lecture Notes in Computer Science (SPRINGER VERLAG)ISBN: 978-3-642-23637-2ISSN: 0302-9743Balanced multipath source routing
Prasad, Shreyas; Schumacher, André; Haanpää, Harri; Orponen, Pekka2008 Lifetime maximization in wireless sensor networks by distributed binary search
Schumacher, Andre; Orponen, Pekka; Thaler, Thorn; Haanpää, Harri2008 ISSN: 0302-9743Distributed computation of maximum lifetime spanning subgraphs in sensor networks
Haanpää, Harri; Schumacher, André; Thaler, Thorn; Orponen, Pekka2007 Load balancing by distributed optimisation in ad hoc networks
Schumacher, André; Haanpää, Harri; Schaeffer, Satu Elisa; Orponen, Pekka2006 ISBN: 978-3-540-49932-9ISSN: 0302-9743Local clustering of large graphs by approximate Fiedler vectors
Orponen, Pekka; Schaeffer, Satu Elisa2005 ISBN: 3-540-25920-1ISSN: 0302-9743Threshold behaviour of WalkSAT and focused Metropolis search on random 3-satisfiability
Seitz, Sakari; Alava, Mikko; Orponen, Pekka2005 ISBN: 3-540-26276-8ISSN: 0302-9743Balanced data gathering in energy-constrained sensor networks
Falck, Emil; Floréen, Patrik; Kaski, Petteri; Kohonen, Jukka; Orponen, Pekka2004 ISBN: 3-540-22476-9Multicast time maximization in energy constrained wireless networks
Floréen, Patrik; Kaski, Petteri; Kohonen, Jukka; Orponen, Pekka2003 An efficient local search method for random 3-satisfiability
Seitz, Sakari; Orponen, Pekka2003 Computation of the multivariate Oja median
Ronkainen, Tommi; Oja, Hannu; Orponen, Pekka2002 ISBN: 3-7908-1518-7Computing with continuous-time Liapunov systems
Síma, Jirí; Orponen, Pekka2001 ISBN: 1-58113-349-9Exponential transients in continuous-time symmetric Hopfield nets
Síma, Jirí; Orponen, Pekka2001 ISBN: 3-540-42486-5Some afterthoughts on Hopfield networks
Síma, Jirí; Orponen, Pekka; Antti-Poika, Teemu1999 ISBN: 3-540-66694-XA survey of continuous-time computation theory
Orponen, Pekka1997 ISBN: 0-7923-4396-4The computational power of continuous time neural networks
Orponen, Pekka1997 ISBN: 3-540-63774-5}On the effect of analog noise in discrete-time analog computations
Maass, Wolfgang; Orponen, Pekka1996 ISBN: 9780262100656Random strings make hard instances
Buhrman, Harry; Orponen, Pekka1994 ISBN: 0-8186-5670-0On the computational power of discrete Hopfield nets
Orponen, Pekka1993 ISBN: 3-540-56939-1Neural networks and complexity theory
Orponen, Pekka1992 ISBN: 3-540-55808-XProbably approximately optimal derivation strategies
Greiner, Russell; Orponen, Pekka1991 ISBN: 1-55860-165-1On the instance complexity of NP-hard problems
Orponen, Pekka1990 ISBN: 0-8186-2072-2On the sample complexity of finding good search strategies
Orponen, Pekka; Greiner, Russell1990 ISBN: 1-55860-146-5Programming methods for neural computing
Tirri, Henry; Myllymäki, Petri; Orponen, Pekka; Floréen, Patrik1990 ISBN: 3-540-55425-4On exponential lowness
Book, Ronald V.; Orponen, Pekka; Russo, David A.; Watanabe, Osamu1986 ISBN: 3-540-16761-7What Is a hard instance of a computational problem?
Ko, Ker-I; Orponen, Pekka; Schöning, Uwe; Watanabe, Osamu1986 ISBN: 3-540-16486-3Polynomial levelability and maximal complexity cores
Orponen, Pekka; Russo, David A.; Schöning, Uwe1985 ISBN: 3-540-15650-XThe structure of polynomial complexity cores (Extended abstract)
Orponen, Pekka; Schöning, Uwe1984 ISBN: 3-540-13372-0Complexity classes of alternating machines with oracles
Orponen, Pekka1983 in Lecture Notes in Computer Science (Springer Berlin Heidelberg)ISBN: 978-3-540-12317-0ISSN: 0302-9743
Yield optimization strategies for DNA staged tile assembly systems
Czeizler, Eugen; Orponen, Pekka
2013 ISBN: 978-3-642-45007-5
Unordered constraint satisfaction games
Ahlroth, Lauri; Orponen, Pekka
2012 ISBN: 978-3-642-32588-5
ISSN: 0302-9743
Synthesizing minimal tile sets for patterned DNA self-assembly
Göös, Mika; Orponen, Pekka
2011 ISSN: 0302-9743
Synthesizing small and reliable tile sets for patterned DNA self-assembly
Lempiäinen, Tuomo; Czeizler, Eugen; Orponen, Pekka
2011 in Lecture Notes in Computer Science (SPRINGER VERLAG)ISBN: 978-3-642-23637-2
ISSN: 0302-9743
Balanced multipath source routing
Prasad, Shreyas; Schumacher, André; Haanpää, Harri; Orponen, Pekka
2008 Lifetime maximization in wireless sensor networks by distributed binary search
Schumacher, Andre; Orponen, Pekka; Thaler, Thorn; Haanpää, Harri
2008 ISSN: 0302-9743
Distributed computation of maximum lifetime spanning subgraphs in sensor networks
Haanpää, Harri; Schumacher, André; Thaler, Thorn; Orponen, Pekka
2007 Load balancing by distributed optimisation in ad hoc networks
Schumacher, André; Haanpää, Harri; Schaeffer, Satu Elisa; Orponen, Pekka
2006 ISBN: 978-3-540-49932-9
ISSN: 0302-9743
Local clustering of large graphs by approximate Fiedler vectors
Orponen, Pekka; Schaeffer, Satu Elisa
2005 ISBN: 3-540-25920-1
ISSN: 0302-9743
Threshold behaviour of WalkSAT and focused Metropolis search on random 3-satisfiability
Seitz, Sakari; Alava, Mikko; Orponen, Pekka
2005 ISBN: 3-540-26276-8
ISSN: 0302-9743
Balanced data gathering in energy-constrained sensor networks
Falck, Emil; Floréen, Patrik; Kaski, Petteri; Kohonen, Jukka; Orponen, Pekka
2004 ISBN: 3-540-22476-9
Multicast time maximization in energy constrained wireless networks
Floréen, Patrik; Kaski, Petteri; Kohonen, Jukka; Orponen, Pekka
2003 An efficient local search method for random 3-satisfiability
Seitz, Sakari; Orponen, Pekka
2003 Computation of the multivariate Oja median
Ronkainen, Tommi; Oja, Hannu; Orponen, Pekka
2002 ISBN: 3-7908-1518-7
Computing with continuous-time Liapunov systems
Síma, Jirí; Orponen, Pekka
2001 ISBN: 1-58113-349-9
Exponential transients in continuous-time symmetric Hopfield nets
Síma, Jirí; Orponen, Pekka
2001 ISBN: 3-540-42486-5
Some afterthoughts on Hopfield networks
Síma, Jirí; Orponen, Pekka; Antti-Poika, Teemu
1999 ISBN: 3-540-66694-X
A survey of continuous-time computation theory
Orponen, Pekka
1997 ISBN: 0-7923-4396-4
The computational power of continuous time neural networks
Orponen, Pekka
1997 ISBN: 3-540-63774-5}
On the effect of analog noise in discrete-time analog computations
Maass, Wolfgang; Orponen, Pekka
1996 ISBN: 9780262100656
Random strings make hard instances
Buhrman, Harry; Orponen, Pekka
1994 ISBN: 0-8186-5670-0
On the computational power of discrete Hopfield nets
Orponen, Pekka
1993 ISBN: 3-540-56939-1
Neural networks and complexity theory
Orponen, Pekka
1992 ISBN: 3-540-55808-X
Probably approximately optimal derivation strategies
Greiner, Russell; Orponen, Pekka
1991 ISBN: 1-55860-165-1
On the instance complexity of NP-hard problems
Orponen, Pekka
1990 ISBN: 0-8186-2072-2
On the sample complexity of finding good search strategies
Orponen, Pekka; Greiner, Russell
1990 ISBN: 1-55860-146-5
Programming methods for neural computing
Tirri, Henry; Myllymäki, Petri; Orponen, Pekka; Floréen, Patrik
1990 ISBN: 3-540-55425-4
On exponential lowness
Book, Ronald V.; Orponen, Pekka; Russo, David A.; Watanabe, Osamu
1986 ISBN: 3-540-16761-7
What Is a hard instance of a computational problem?
Ko, Ker-I; Orponen, Pekka; Schöning, Uwe; Watanabe, Osamu
1986 ISBN: 3-540-16486-3
Polynomial levelability and maximal complexity cores
Orponen, Pekka; Russo, David A.; Schöning, Uwe
1985 ISBN: 3-540-15650-X
The structure of polynomial complexity cores (Extended abstract)
Orponen, Pekka; Schöning, Uwe
1984 ISBN: 3-540-13372-0
Complexity classes of alternating machines with oracles
Orponen, Pekka
1983 in Lecture Notes in Computer Science (Springer Berlin Heidelberg)ISBN: 978-3-540-12317-0
ISSN: 0302-9743
Non-refereed scientific articles
Unrefereed journal articles"P = NP" -ongelma ja laskennan vaativuusteoria
Orponen, Pekka2007 in TIETOJENKÄSITTELYTIEDE (Springer Berlin Heidelberg)Mitä tietojenkäsittelyteoriaan kuuluu?
Orponen, Pekka2003 in TIETOJENKÄSITTELYTIEDE (Springer Berlin Heidelberg)On the effect of analog noise in discrete-time analog computations
Maass, Wolfgang; Orponen, Pekka1997 in Electronic Colloquium on Computational Complexity (Springer Berlin Heidelberg)
"P = NP" -ongelma ja laskennan vaativuusteoria
Orponen, Pekka
2007 in TIETOJENKÄSITTELYTIEDE (Springer Berlin Heidelberg)Mitä tietojenkäsittelyteoriaan kuuluu?
Orponen, Pekka
2003 in TIETOJENKÄSITTELYTIEDE (Springer Berlin Heidelberg)On the effect of analog noise in discrete-time analog computations
Maass, Wolfgang; Orponen, Pekka
1997 in Electronic Colloquium on Computational Complexity (Springer Berlin Heidelberg)Book sectionNano architectures for carbon nanotube circuits: design, analysis, and experimental attempts
Czeizler, Eugen; Lempiäinen, Tuomo; Orponen, Pekka2011 A design framework for carbon nanotube circuits affixed on DNA origami tiles
Czeizler, Eugen; Lempiäinen, Tuomo; Orponen, Pekka2011
Nano architectures for carbon nanotube circuits: design, analysis, and experimental attempts
Czeizler, Eugen; Lempiäinen, Tuomo; Orponen, Pekka
2011 A design framework for carbon nanotube circuits affixed on DNA origami tiles
Czeizler, Eugen; Lempiäinen, Tuomo; Orponen, Pekka
2011 Scientific books (monographs)
Book (editor)Special Issue on Algorithms for Sensor Systems, Wireless Ad Hoc Networks and Autonomous Mobile Entities, Theoretical Computer Science, Vol. 553
Bar-Noy, Amotz; Erlebach, Thomas; Halldorsson, Magnus M.; Nikoletseas, Sotiris; Orponen, Pekka2014 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
Erlebach, Thomas; Nikoletseas, Sotiris; Orponen, Pekka2012 in Lecture Notes in Computer Science (SPRINGER VERLAG)ISBN: 978-3-642-28208-9ISSN: 0302-9743Algorithms and Applications: Essays Dedicated to Esko Ukkonen on the Occasion of His 60th Birthday
Elomaa, Tapio; Mannila, Heikki; Orponen, Pekka2010
Special Issue on Algorithms for Sensor Systems, Wireless Ad Hoc Networks and Autonomous Mobile Entities, Theoretical Computer Science, Vol. 553
Bar-Noy, Amotz; Erlebach, Thomas; Halldorsson, Magnus M.; Nikoletseas, Sotiris; Orponen, Pekka
2014 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
Erlebach, Thomas; Nikoletseas, Sotiris; Orponen, Pekka
2012 in Lecture Notes in Computer Science (SPRINGER VERLAG)ISBN: 978-3-642-28208-9
ISSN: 0302-9743
Algorithms and Applications: Essays Dedicated to Esko Ukkonen on the Occasion of His 60th Birthday
Elomaa, Tapio; Mannila, Heikki; Orponen, Pekka
2010 Publications intended for professional communities
Article in professional journalTietotekniikkaa ennen tietokoneita - Alan Turing ja tietotekniikan kiehtovat alkuvaiheet
Orponen, Pekka2003 in Tietoa (SPRINGER)
Tietotekniikkaa ennen tietokoneita - Alan Turing ja tietotekniikan kiehtovat alkuvaiheet
Orponen, Pekka
2003 in Tietoa (SPRINGER)Published development or research reportSecurity Topics and Mobility Management in Hierarchical Ad Hoc Networks (Samoyed): Final Report
Hietalahti, Maarit; Särelä, Mikko; Tuominen, Antti; Orponen, Pekka2007
Security Topics and Mobility Management in Hierarchical Ad Hoc Networks (Samoyed): Final Report
Hietalahti, Maarit; Särelä, Mikko; Tuominen, Antti; Orponen, Pekka
2007 Synthesizing minimal tile sets for patterned DNA self-assembly
Göös, Mika; Orponen, Pekka2009 in arXiv.org (SPRINGER)Locally computable approximations for spectral clustering and absorption times of random walks
Orponen, Pekka; Schaeffer, Satu Elisa; Gaytán, Vanesa Avalos2008
Synthesizing minimal tile sets for patterned DNA self-assembly
Göös, Mika; Orponen, Pekka
2009 in arXiv.org (SPRINGER)Locally computable approximations for spectral clustering and absorption times of random walks
Orponen, Pekka; Schaeffer, Satu Elisa; Gaytán, Vanesa Avalos
2008 Read about executive education
Other experts
Alessio Terzi
Alessio Terzi is a Doctoral Student at the Hertie School and Affiliate Fellow at Bruegel, a Brussels-based economics think-tank. Alessio has been a Research Analyst in the EMU governance division of the European Central Bank. He has also worked for the macroeconomic forecasting unit of DG ECFIN (...
Xavier Gabriëls
Expertise Cost & Management Accounting (Strategic ) Performance management Accounting Information Systems Financial Analysis & Management Budgeting & Forecasting Prof. Dr. Xavier Gabriëls has a specific expertise in cost analysis and cost models, performance analysis, budget t...
Jared Valdron
Jared leads the development of the people analytics function at GitHub, where he is currently building out an automated reporting strategy and acting as a consultant on a variety of talent projects. Before working at GitHub, Jared worked as a consultant for organizations such as Namely, Rogers a...
Looking for an expert?
Contact us and we'll find the best option for you.