Detlef Ronneburger, Ph.D. - Publications
Affiliations: | 2004 | Rutgers University, New Brunswick, New Brunswick, NJ, United States |
Area:
Computer ScienceYear | Citation | Score | |||
---|---|---|---|---|---|
2011 | Allender E, Koucký M, Ronneburger D, Roy S. The pervasive reach of resource-bounded Kolmogorov complexity in computational complexity theory Journal of Computer and System Sciences. 77: 14-40. DOI: 10.1016/J.Jcss.2010.06.004 | 0.577 | |||
2003 | Allender E, Koucký M, Roy S, Ronneburger D. Derandomization and distinguishing complexity Proceedings of the Annual Ieee Conference On Computational Complexity. 209-220. | 0.638 | |||
2002 | Allender E, Buhrman H, Koucký M, Van Melkebeek D, Ronneburger D. Power from random strings Annual Symposium On Foundations of Computer Science - Proceedings. 669-678. DOI: 10.1137/050628994 | 0.61 | |||
2001 | Allender E, Koucký M, Ronneburger D, Roy S, Vinay V. Time-space tradeoffs in the counting hierarchy Proceedings of the Annual Ieee Conference On Computational Complexity. 295-302. | 0.542 | |||
Show low-probability matches. |