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.
Buhrman, H. M., Cleve, R., & van Dam, W. K. (1997). Quantum entanglement and communication complexity. (Technical Report quant-ph; No. 9705033). Unknown Publisher.
Buhrman, H. M., Cleve, R., van Dam, W. K., Hoyer, P., & Tapp, A. (1997). Multiparty quantum communication complexity. (Technical Report quant-ph; No. 9710054). Unknown Publisher.
Buhrman, H. M., Fortnow, L., & Thierauf, T. (1997). Nonrelativizing separations. (Technical Report; No. CS 97-11). 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., & Torenvliet, L. (1996). Complete sets and structure in sub-recursive classes. In Logic Colloquium 96: European Summer Meeting of the Association for Symbolic Logic (pp. 59-64)
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.