- Journal Publications:
-
-
E. Allender, H. Buhrman, M. Koucky,
D. van Melkebeek, and D. Ronneburger
Power from Random Strings
To appear in SIAM Jounal on Computing .
-
E. Allender, M. Koucky, D. Ronneburger, S. Roy, and V. Vinay
Space-Time tradeoffs in the Counting Hierarchy
Accepted for publication in Theory of Computing Systems .
- Conference Publications:
-
-
E. Allender, M. Koucky, D. Ronneburger, and S. Roy
Derandomization and Distinguishing Complexity
Proceedings of the 18th IEEE Conference on
Computational Complexity, 2003, pp. 209-220
-
E. Allender, H. Buhrman, M. Koucky, D. van Melkebeek,
and D. Ronneburger
Power from Random Strings
Proceedings of the 43th Symposium on Foundations of
Computer Science, 2002, pp. 669-678
-
E. Allender, M. Koucky, D. Ronneburger, S. Roy, and V. Vinay
Space-Time tradeoffs in the Counting Hierarchy
Proceedings of the 16th IEEE Conference on Computational Complexity,
2001, pp. 295-302
- Ph.D. Thesis:
-
-
Kolmogorov Complexit and Derandomization
October 2004, Rutgers University, New Brunswick, NJ
