Buhrman, H. M., & van Melkebeek, D. (1997). Complete sets under non-adaptive reductions are scarce. (Technical Report; No. TR-97-04). University of Chicago.
Buhrman, H. M., & van Melkebeek, D. (1997). Hard sets are hard to find. (Technical Report; No. TR-97-12). University of Chicago.
Buhrman, H. M., Fenner, S., & Fortnow, L. (1997). Results on resource-bounded measure. In Proceedings of the 24th International Colloquium on Automata Languages and Programming (pp. 188-194). Springer.
Buhrman, H. M., & Fortnow, L. (1997). Resource-bounded kolmogorov complexity revisited. In Proceedings of the 14th Symposium on Theoretical Aspects of Computer Science (pp. 105-116). Springer.
Beigel, R., Buhrman, H. M., & Fortnow, L. (1997). Might not be as easy as detecting unique solutions. (Technical Report; No. CS 97-02). University of Chicago.
Buhrman, H. M., Fortnow, L., & Torenvliet, L. (1997). Six hypotheses in search of a theorem. In Proceedings of the 12th IEEE Conference on Computational Complexity (pp. 2-12). IEEE.
Buhrman, H. M., Li, M., & Vitanyi, P. M. B. (1997). Kolmogorov random graphs and the incompressibility method. In Proceedings of Conference on Compression and Complexity of Sequences (pp. 2-12). IEEE Computer Society Press.
Buhrman, H. M., Hoepman, J. H., & Vitanyi, P. M. B. (1996). Optimal routing tables. In Proc. 15th ACM Symp. on Principles of Distributed Computing (pp. 134-142)
Buhrman, H. M., & Longpre, L. (1996). Compressibility and resource bounded measure. In proc STACS'96 (pp. 13-24). (LNCS; No. 1046). Springer.
Buhrman, H. M., & Thierauf, T. (1996). The complexity of generating and checking proofs of membership. In proc STACS'96 (pp. 75-86). (LNCS; No. 1046). Springer.