2006 |
6 | EE | Eric Allender,
Harry Buhrman,
Michal Koucký,
Dieter van Melkebeek,
Detlef Ronneburger:
Power from Random Strings.
SIAM J. Comput. 35(6): 1467-1493 (2006) |
2003 |
5 | EE | Eric Allender,
Michal Koucký,
Detlef Ronneburger,
Sambuddha Roy:
Derandomization and Distinguishing Complexity.
IEEE Conference on Computational Complexity 2003: 209-220 |
2002 |
4 | EE | Eric Allender,
Harry Buhrman,
Michal Koucký,
Dieter van Melkebeek,
Detlef Ronneburger:
Power from Random Strings.
FOCS 2002: 669-678 |
3 | EE | Eric Allender,
Harry Buhrman,
Michal Koucký,
Detlef Ronneburger,
Dieter van Melkebeek:
Power from Random Strings
Electronic Colloquium on Computational Complexity (ECCC)(028): (2002) |
2001 |
2 | EE | Eric Allender,
Michal Koucký,
Detlef Ronneburger,
Sambuddha Roy,
V. Vinay:
Time-Space Tradeoffs in the Counting Hierarchy.
IEEE Conference on Computational Complexity 2001: 295-302 |
1 | EE | Eric Allender,
Michal Koucký,
Detlef Ronneburger,
Sambuddha Roy,
V. Vinay:
Time-Space Tradeoffs in the Counting Hierarchy
Electronic Colloquium on Computational Complexity (ECCC) 8(41): (2001) |