Buhrman, H., Torenvliet, L. (1998) Randomness is hard.

In Proceedings of the 15th symposium on theoretial aspects of computation science (pp 249-260) (-). Springer-Verlag.

Buhrman, H., Torenvliet, L. (1998) Randomness is hard.

In Proceedings of the 1998 conference on computational complexity (pp 249-260) (-). IEEE Computing society press.

Buhrman, H., Torenvliet, L. (1999) Complicated complementations.

In Proceedings 14th IEEE Conference on Computational Complexity (pp 227-236). IEEE Computer Society Press.

Buhrman, H., Torenvliet, L. (2000) Randomness is Hard.

SIAM Journal on Computing, Vol. 30 (pp 1485-1501)

Article | https://doi.org/10.1137/S0097539799360148 | UvA-DARE

Buhrman, H., Torenvliet, L. (2004) Separating complexity classes using structural properties.

In Proceedings 19th Conference on Computational Complexity (pp 130). IEEE Computer Society Press.

Buhrman, H., Torenvliet, L. (2005) A Post's program for complexity theory.

Bulletin of the European Association for Theoretical Computer Science, Vol. 85 (pp 41-51)

Article | UvA-DARE

Buhrman, H., Torenvliet, Leen, Unger, Falk (2006) Sparse selfreducible sets and polynomial size circuit lower bounds.

In STACS 2006: 23rd Annual Symposium on Theoretical Aspects of Computer Science, Proceedings (pp 455-468) (Lecture Notes in Computer Science, Vol. 3884). Springer.

Buhrman, H., Tromp, J.A.H., Vitanyi, P.M.B. (2001) Time and space bounds for reversible simulation.

Journal of Physics. A, Mathematical and General, Vol. 34 (pp 6821-6830)

Article | https://doi.org/10.1088/0305-4470/34/35/308 | UvA-DARE

Buhrman, H., van der Gulik, P.T.S., Kelk, S.M., Koolen, W.M., Stougie, L. (2011) Some mathematical refinements concerning error minimization in the genetic code.

IEEE/ACM Transactions on Computational Biology and Bioinformatics, Vol. 8 (pp 1358-1372)

Article | https://doi.org/10.1109/TCBB.2011.40 | UvA-DARE

Buhrman, H., van der Gulik, P.T.S., Klau, G.W., Schaffner, C., Speijer, D., Stougie, L. (2013) A Realistic Model Under Which the Genetic Code is Optimal.

Journal of molecular evolution, Vol. 77 (pp 170-184)

Article | https://doi.org/10.1007/s00239-013-9571-2 | UvA-DARE

Buhrman, H., van Melkebeek, D. (1997) Complete sets under non-adaptive reductions are scarce.

Technical Report. University of Chicago.

Report | UvA-DARE

Buhrman, H., van Melkebeek, D. (1997) Hard sets are hard to find.

Technical Report. University of Chicago.

Report | UvA-DARE

Buhrman, H., Vereshchagin, N.K., de Wolf, R. (2007) On Computation and Communication with Small Bias.

In Proceedings of the XXII Annual IEEE Conference of Computational Complexity (pp 24-32)

Buhrman, H., Vitanyi, P.M.B. (1998) Kolmogorov random graphs.

In Proceedings of the IEEE Conference on Compression and Complexity of sequences 1997 (pp 78-96) (-). IEEE Comput. Soc. Press.

Buhrman, H. (1998) Functions computable with nonadaptive queries to NP.

Theory of Computing Systems, Vol. 31 (pp 77-92)

Article | https://doi.org/10.1007/s002240000079 | UvA-DARE

Buhrman, H. (1998) Two Queries.

In Proceedings of the 13th IEEE Conference on Computational Complexity (pp 13-19) (-)

Buhrman, H. (1999) A lower bound for quantum search of an ordered list.

Information Processing Letters, Vol. 70 (pp 205-209)

Article | https://doi.org/10.1016/S0020-0190(99)00069-1 | UvA-DARE

Buhrman, H. (2000) Quantum computing and communication complexity.

Bulletin of the European Association for Theoretical Computer Science, Vol. 70 (pp 131-141)

Article | UvA-DARE

Buhrman, H. (2006) Toveren met kwantum informatie.

In Mols, B. (Eds.), Het raadsel van informatie (pp 95-113) (7). Boom.

Buijtelaar, L., Pezzelle, S. (2023) A Psycholinguistic Analysis of BERT's Representations of Compounds.

In Vlachos, A. Augenstein, I. (Eds.), The 17th Conference of the European Chapter of the Association for Computational Linguistics: EACL 2023 : proceedings of the conference : May 2-6, 2023 (pp 2230–2241). Association for Computational Linguistics.