 | 2008 |
|---|
| 51 |       | André Schumacher,
Pekka Orponen,
Thorn Thaler,
Harri Haanpää:
Lifetime Maximization in Wireless Sensor Networks by Distributed Binary Search.
EWSN 2008: 237-252 |
| 50 | | 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 |
|---|
| 49 | | Shreyas Prasad,
André Schumacher,
Harri Haanpää,
Pekka Orponen:
Balanced Multipath Source Routing.
ICOIN 2007: 315-324 |
| 48 | | Harri Haanpää,
André Schumacher,
Thorn Thaler,
Pekka Orponen:
Distributed Computation of Maximum Lifetime Spanning Subgraphs in Sensor Networks.
MSN 2007: 445-456 |
| 47 | | 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 |
|---|
| 46 | | André Schumacher,
Harri Haanpää,
Satu Elisa Schaeffer,
Pekka Orponen:
Load Balancing by Distributed Optimisation in Ad Hoc Networks.
MSN 2006: 873-884 |
| 2005 |
|---|
| 45 | | Sakari Seitz,
Mikko Alava,
Pekka Orponen:
Threshold Behaviour of WalkSAT and Focused Metropolis Search on Random 3-Satisfiability.
SAT 2005: 475-481 |
| 44 | | Pekka Orponen,
Satu Elisa Schaeffer:
Local Clustering of Large Graphs by Approximate Fiedler Vectors.
WEA 2005: 524-533 |
| 43 | | Sakari Seitz,
Mikko Alava,
Pekka Orponen:
Focused Local Search for Random 3-Satisfiability
CoRR abs/cond-mat/0501707: (2005) |
| 42 | | 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) |
| 41 | | Evan J. Griffiths,
Pekka Orponen:
Optimization, block designs and No Free Lunch theorems.
Inf. Process. Lett. 94(2): 55-61 (2005) |
| 40 | | 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) |
| 2004 |
|---|
| 39 | | Emil Falck,
Patrik Floréen,
Petteri Kaski,
Jukka Kohonen,
Pekka Orponen:
Balanced Data Gathering in Energy-Constrained Sensor Networks.
ALGOSENSORS 2004: 59-70 |
| 2003 |
|---|
| 38 | | Patrik Floréen,
Petteri Kaski,
Jukka Kohonen,
Pekka Orponen:
Multicast time maximization in energy constrained wireless networks.
DIALM-POMC 2003: 50-58 |
| 37 | | Sakari Seitz,
Pekka Orponen:
An efficient local search method for random 3-satisfiability.
Electronic Notes in Discrete Mathematics 16: 71-79 (2003) |
| 36 | | Jirí Síma,
Pekka Orponen:
General-Purpose Computation with Neural Networks: A Survey of Complexity Theoretic Results.
Neural Computation 15(12): 2727-2778 (2003) |
| 35 | | Jirí Síma,
Pekka Orponen:
Continuous-Time Symmetric Hopfield Nets Are Computationally Universal.
Neural Computation 15(3): 693-733 (2003) |
| 34 | | Jirí Síma,
Pekka Orponen:
Exponential transients in continuous-time Liapunov systems.
Theor. Comput. Sci. 306(1-3): 353-372 (2003) |
| 2001 |
|---|
| 33 | | Jirí Síma,
Pekka Orponen:
Exponential Transients in Continuous-Time Symmetric Hopfield Nets.
ICANN 2001: 806-813 |
| 32 | | Jirí Síma,
Pekka Orponen:
Computing with continuous-time Liapunov systems.
STOC 2001: 722-731 |
| 31 |  | 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) |
| 1999 |
|---|
| 30 | | Jirí Síma,
Pekka Orponen,
Teemu Antti-Poika:
Some Afterthoughts on Hopfield Networks.
SOFSEM 1999: 459-469 |
| 1998 |
|---|
| 29 | | Wolfgang Maass,
Pekka Orponen:
On the Effect of Analog Noise in Discrete-Time Analog Computations.
Neural Computation 10(5): 1071-1095 (1998) |
| 1997 |
|---|
| 28 | | Pekka Orponen:
A Survey of Continous-Time Computation Theory.
Advances in Algorithms, Languages, and Complexity 1997: 209-224 |
| 27 | | Pekka Orponen:
The Computational Power of Continuous Time Neural Networks.
SOFSEM 1997: 86-103 |
| 26 | | Wolfgang Maass,
Pekka Orponen:
On the Effect of Analog Noise in Discrete-Time Analog Computations
Electronic Colloquium on Computational Complexity (ECCC) 4(51): (1997) |
| 25 | | Pekka Orponen:
Computing with Truly Asynchronous Threshold Logic Networks.
Theor. Comput. Sci. 174(1-2): 123-136 (1997) |
| 1996 |
|---|
| 24 | | Wolfgang Maass,
Pekka Orponen:
On the Effect of Analog Noise in Discrete-Time Analog Computations.
NIPS 1996: 218-224 |
| 23 | | Russell Greiner,
Pekka Orponen:
Probably Approximately Optimal Satisficing Strategies.
Artif. Intell. 82(1-2): 21-44 (1996) |
| 22 | | Harry Buhrman,
Pekka Orponen:
Random Strings Make Hard Instances.
J. Comput. Syst. Sci. 53(2): 261-266 (1996) |
| 1994 |
|---|
| 21 | | Harry Buhrman,
Pekka Orponen:
Random Strings Make Hard Instances.
Structure in Complexity Theory Conference 1994: 217-222 |
| 20 | | Pekka Orponen,
Ker-I Ko,
Uwe Schöning,
Osamu Watanabe:
Instance Complexity.
J. ACM 41(1): 96-121 (1994) |
| 19 | | Pekka Orponen:
Neural Networks and Complexity Theory.
Nord. J. Comput. 1(1): 94-110 (1994) |
| 1993 |
|---|
| 18 | | Pekka Orponen:
On the Computational Power of Discrete Hopfield Nets.
ICALP 1993: 215-226 |
| 17 | | Patrik Floréen,
Pekka Orponen:
Attraction Radii in Binary Hopfield Nets are Hard to Compute.
Neural Computation 5(5): 812-821 (1993) |
| 1992 |
|---|
| 16 | | Pekka Orponen:
Neural Networks and Complexity Theory.
MFCS 1992: 50-61 |
| 1991 |
|---|
| 15 | | Russell Greiner,
Pekka Orponen:
Probably Approximately Optimal Derivation Strategies.
KR 1991: 277-288 |
| 1990 |
|---|
| 14 | | Pekka Orponen,
Russell Greiner:
On the Sample Complexity of Finding Good Search Strategies.
COLT 1990: 352-358 |
| 13 | | Henry Tirri,
Petri Myllymäki,
Pekka Orponen,
Patrik Floréen:
Programming Methods for Neural Computing.
Dagstuhl Seminar on Parallelization in Inference Systems 1990: 357 |
| 12 | | Pekka Orponen:
On the Instance Complexity of NP-Hard Problems.
Structure in Complexity Theory Conference 1990: 20-27 |
| 11 | | Pekka Orponen:
Dempster's Rule of Combination is #P-Complete.
Artif. Intell. 44(1-2): 245-253 (1990) |
| 1988 |
|---|
| 10 | | 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 |
|---|
| 9 | | David A. Russo,
Pekka Orponen:
On P-Subset Structures.
Mathematical Systems Theory 20(2-3): 129-136 (1987) |
| 1986 |
|---|
| 8 | | Ronald V. Book,
Pekka Orponen,
David A. Russo,
Osamu Watanabe:
On Exponential Lowness.
ICALP 1986: 40-49 |
| 7 | | 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 |
| 6 | | Pekka Orponen,
Uwe Schöning:
The Density and Complexity of Polynomial Cores for Intractable
Information and Control 70(1): 54-68 (1986) |
| 5 | | Pekka Orponen,
David A. Russo,
Uwe Schöning:
Optimal Approximations and Polynomially Levelable Sets.
SIAM J. Comput. 15(2): 399-408 (1986) |
| 4 | | Pekka Orponen:
A Classification of Complexity Core Lattices.
Theor. Comput. Sci. 47(3): 121-130 (1986) |
| 1985 |
|---|
| 3 | | Pekka Orponen,
David A. Russo,
Uwe Schöning:
Polynomial Levelability and Maximal Complexity Cores.
ICALP 1985: 435-444 |
| 1984 |
|---|
| 2 | | Pekka Orponen,
Uwe Schöning:
The Structure of Polynomial Complexity Cores (Extended Abstract).
MFCS 1984: 452-458 |
| 1983 |
|---|
| 1 | | Pekka Orponen:
Complexity Classes of Alternating Machines with Oracles.
ICALP 1983: 573-584 |
