Search    Browse

The FacetedDBLP logo    Search for: in:

Disable automatic phrases ?     Syntactic query expansion: ?

Publications of "Detlef Ronneburger" ( http://dblp.L3S.de/Authors/Detlef_Ronneburger )

  Author page on DBLP  Author page in RDF  Community of Detlef Ronneburger in ASPL-2

Publication years (Num. hits)
2001-2011 (8)
Publication types (Num. hits)
article(5) inproceedings(3)
Venues (Conferences, Journals, ...)
Electronic Colloquium on Compu...(3) IEEE Conference on Computation...(2) FOCS(1) J. Comput. Syst. Sci.(1) SIAM J. Comput.(1)
Authors
Detlef Ronneburger(8) Eric Allender(8) Michal Koucký(8) Sambuddha Roy(5) Dieter van Melkebeek(3) Harry Buhrman(3) V. Vinay(2)
GrowBag graphs for keyword ? (Num. hits/coverage)

Group by:
No Growbag Graphs found.
Results
Found 8 publication records. Showing 8 according to the selection in the facets
Hits ?▲ Authors Title Venue Year Link Author keywords
1Eric Allender, Michal Koucký, Detlef Ronneburger, Sambuddha Roy The pervasive reach of resource-bounded Kolmogorov complexity in computational complexity theory. Search on Bibsonomy J. Comput. Syst. Sci. The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Eric Allender, Michal Koucký, Detlef Ronneburger, Sambuddha Roy The Pervasive Reach of Resource-Bounded Kolmogorov Complexity in Computational Complexity Theory. Search on Bibsonomy Electronic Colloquium on Computational Complexity (ECCC) The full citation details ... 2009 DBLP  BibTeX  RDF
1Eric Allender, Harry Buhrman, Michal Koucký, Dieter van Melkebeek, Detlef Ronneburger Power from Random Strings. Search on Bibsonomy SIAM J. Comput. The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
1Eric Allender, Michal Koucký, Detlef Ronneburger, Sambuddha Roy Derandomization and Distinguishing Complexity. Search on Bibsonomy IEEE Conference on Computational Complexity The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
1Eric Allender, Harry Buhrman, Michal Koucký, Detlef Ronneburger, Dieter van Melkebeek Power from Random Strings Search on Bibsonomy Electronic Colloquium on Computational Complexity (ECCC) The full citation details ... 2002 DBLP  BibTeX  RDF
1Eric Allender, Harry Buhrman, Michal Koucký, Dieter van Melkebeek, Detlef Ronneburger Power from Random Strings. Search on Bibsonomy FOCS The full citation details ... 2002 DBLP  DOI  BibTeX  RDF
1Eric Allender, Michal Koucký, Detlef Ronneburger, Sambuddha Roy, V. Vinay Time-Space Tradeoffs in the Counting Hierarchy Search on Bibsonomy Electronic Colloquium on Computational Complexity (ECCC) The full citation details ... 2001 DBLP  BibTeX  RDF
1Eric Allender, Michal Koucký, Detlef Ronneburger, Sambuddha Roy, V. Vinay Time-Space Tradeoffs in the Counting Hierarchy. (PDF / PS) Search on Bibsonomy IEEE Conference on Computational Complexity The full citation details ... 2001 DBLP  DOI  BibTeX  RDF
Displaying result #1 - #8 of 8 (100 per page; Change: )
Valid XHTML 1.1! Valid CSS! [Valid RSS]
Maintained by Jörg Diederich.
Based upon DBLP by Michael Ley.