The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Pekka Orponen: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

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

  43. Lifetime Maximization in Wireless Sensor Networks by Distributed Binary Search. [Citation Graph (, )][DBLP]


  44. Balanced Multipath Source Routing. [Citation Graph (, )][DBLP]


  45. Distributed Computation of Maximum Lifetime Spanning Subgraphs in Sensor Networks. [Citation Graph (, )][DBLP]


  46. Circumspect descent prevails in solving random constraint satisfaction problems [Citation Graph (, )][DBLP]


  47. Locally computable approximations for spectral clustering and absorption times of random walks [Citation Graph (, )][DBLP]


  48. Synthesizing Minimal Tile Sets for Patterned DNA Self-Assembly [Citation Graph (, )][DBLP]


Search in 0.004secs, Finished in 0.006secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002