Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
[1]
Hilfe
Suche: Author="Orponen, Pekka"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Search methods for tile sets in patterned DNA self-assembly
Mika Göös
,
Tuomo Lempiäinen
,
Eugen Czeizler
,
Pekka Orponen
Journal of Computer and System Sciences
80
(1), 2014, pp. 297-319
Unordered constraint satisfaction games
Lauri Ahlroth
,
Pekka Orponen
Lecture Notes in Computer Science
7464
, 2012, pp. 64-75
Exact and approximate balanced data gathering in energy-constrained sensor networks
Patrik Floréen
,
Petteri Kaski
,
Jukka Kohonen
,
Pekka Orponen
Theoretical Computer Science
344
(1), 2005, pp. 30-46
Optimization, block designs and No Free Lunch theorems
Evan J. Griffiths
,
Pekka Orponen
Information Processing Letters
94
(2), 2005, pp. 55-61
Exponential transients in continuous-time Liapunov systems
Jiȓí S̑íma
,
Pekka Orponen
Theoretical Computer Science
306
(1-3), 2003, pp. 353-372
Computing with continous-time Liapunov systems
Jiȓí S̑ima
,
Pekka Orponen
Proceedings of the 33rd Annual ACM Symposium on Theory of Computing, STOC'2001 (Hersonissos, Crete, Greece, July 6-8, 2001)
, 2001, pp. 722-731
Computing with truly asynchronous threshold logic networks
Pekka Orponen
Theoretical Computer Science
174
(1-2), 1997, pp. 123-136
Random strings make hard instances
Harry Buhrman
,
Pekka Orponen
Journal of Computer and System Sciences
53
(2), 1996, pp. 261-266
Random strings make hard instances
Harry Buhrman
,
Pekka Orponen
Proceedings of the Ninth Annual Conference on Structure in Complexity Theory (Amsterdam, The Netherlands, June 28 - July 1, 1994)
, 1994, pp. 217-222
Instance complexity
Pekka Orponen
,
Ker-I Ko
,
Uwe Schöning
,
Osamu Watanabe
Journal of the ACM
41
(1), 1994, January, pp. 96-121
On the computational power of discrete Hopfield nets
Pekka Orponen
Lecture Notes in Computer Science
700
, 1993, pp. 215-226
Neural networks and complexity theory
Pekka Orponen
Lecture Notes in Computer Science
629
, 1992, pp. 50-61
Instance complexity
Ker-I Ko
,
Pekka Orponen
,
Uwe Schöning
,
Osamu Watanabe
Technical Report (91-01), 1991
On
P
-subset structures
David A. Russo
,
Pekka Orponen
Math. Systems Theory
20
, 1987, pp. 129-136
The structure of polynomial complexity cores
Pekka Orponen
,
Uwe Schöning
Lecture Notes in Computer Science
176
, 1984, pp. 452-458