Search the dblp DataBase
Detlef Ronneburger: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]
Publications of Author
- Eric Allender, Michal Koucký, Detlef Ronneburger, Sambuddha Roy
Derandomization and Distinguishing Complexity. [Citation Graph (0, 0)][DBLP]
IEEE Conference on Computational Complexity, 2003, pp:209-220 [Conf] - Eric Allender, Michal Koucký, Detlef Ronneburger, Sambuddha Roy, V. Vinay
Time-Space Tradeoffs in the Counting Hierarchy. [Citation Graph (0, 0)][DBLP]
IEEE Conference on Computational Complexity, 2001, pp:295-302 [Conf] - Eric Allender, Harry Buhrman, Michal Koucký, Dieter van Melkebeek, Detlef Ronneburger
Power from Random Strings. [Citation Graph (0, 0)][DBLP]
FOCS, 2002, pp:669-678 [Conf] - Eric Allender, Michal Koucký, Detlef Ronneburger, Sambuddha Roy, V. Vinay
Time-Space Tradeoffs in the Counting Hierarchy [Citation Graph (0, 0)][DBLP]
Electronic Colloquium on Computational Complexity (ECCC), 2001, v:8, n:41, pp:- [Journal] - Eric Allender, Harry Buhrman, Michal Koucký, Detlef Ronneburger, Dieter van Melkebeek
Power from Random Strings [Citation Graph (0, 0)][DBLP]
Electronic Colloquium on Computational Complexity (ECCC), 2002, v:, n:028, pp:- [Journal] - Eric Allender, Harry Buhrman, Michal Koucký, Dieter van Melkebeek, Detlef Ronneburger
Power from Random Strings. [Citation Graph (0, 0)][DBLP]
SIAM J. Comput., 2006, v:35, n:6, pp:1467-1493 [Journal]
Search in 0.001secs, Finished in 0.002secs
| NOTICE1 |
|---|
| System may not be available sometimes or not working properly, since it is still in development with continuous upgrades |
| NOTICE2 |
|---|
| The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP |
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002