Detlef Ronneburger

According to our database, Detlef Ronneburger authored at least 4 papers between 2001 and 2009.

Collaborative distances:

• Dijkstra number of three.
• Erdős number of three.

2009

The Pervasive Reach of Resource-Bounded Kolmogorov Complexity in Computational Complexity Theory.

Eric Allender, Michal Koucký, Detlef Ronneburger, Sambuddha Roy

Electron. Colloquium Comput. Complex., 2009

2003

Derandomization and Distinguishing Complexity.

Eric Allender, Michal Koucký, Detlef Ronneburger, Sambuddha Roy

Proceedings of the 18th Annual IEEE Conference on Computational Complexity (Complexity 2003), 2003

2002

Power from Random Strings.

Eric Allender, Harry Buhrman, Michal Koucký, Dieter van Melkebeek, Detlef Ronneburger

Proceedings of the 43rd Symposium on Foundations of Computer Science, 2002

2001

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, 2001