Detlef Ronneburger, Ph.D.
Affiliations: | 2004 | Rutgers University, New Brunswick, New Brunswick, NJ, United States |
Area:
Computer ScienceGoogle:
"Detlef Ronneburger"Parents
Sign in to add mentorEric Allender | grad student | 2004 | Rutgers, New Brunswick | |
(Kolmogorov complexity and derandomization.) |
BETA: Related publications
See more...
Publications
You can help our author matching system! If you notice any publications incorrectly attributed to this author, please sign in and mark matches as correct or incorrect. |
Allender E, Koucký M, Ronneburger D, et al. (2011) The pervasive reach of resource-bounded Kolmogorov complexity in computational complexity theory Journal of Computer and System Sciences. 77: 14-40 |
Allender E, Koucký M, Roy S, et al. (2003) Derandomization and distinguishing complexity Proceedings of the Annual Ieee Conference On Computational Complexity. 209-220 |
Allender E, Buhrman H, Koucký M, et al. (2002) Power from random strings Annual Symposium On Foundations of Computer Science - Proceedings. 669-678 |
Allender E, Koucký M, Ronneburger D, et al. (2001) Time-space tradeoffs in the counting hierarchy Proceedings of the Annual Ieee Conference On Computational Complexity. 295-302 |