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
Hilfe
Suche: Author="Ronneburger, Detlef"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
The pervasive reach of resource-bounded Kolmogorov complexity in computational complexity theory
Eric Allender
,
Michal Koucký
,
Detlef Ronneburger
,
Sambuddha Roy
Journal of Computer and System Sciences
77
(1), 2011, pp. 14-40
Power from random strings
Eric Allender
,
Harry Buhrman
,
Michal Koucký
,
Dieter van Melkebeek
,
Detlef Ronneburger
SIAM Journal on Computing
35
(6), 2006, pp. 1467-1493
Power from random strings
Eric Allender
,
Harry Buhrman
,
Michal Koucký
,
Dieter van Melkebeek
,
Detlef Ronneburger
Proceedings of the 43rd Annual IEEE Symposium on Foundations of Computer Science, FOCS'2002 (Vancouver, BC, Canada, November 16-19, 2002)
, 2002, pp. 669-678
Time-space tradeoffs in the counting hierarchy
Eric Allender
,
Michal Koucký
,
Detlef Ronneburger
,
Sambuddha Roy
,
V. Vinay
Proceedings of the 16th Annual IEEE Conference on Computational Complexity (Chicago, Illinois, June 18-21, 2001)
, 2000, pp. 295-302