Buhrman, H., van der Gulik, P., 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., 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., Vitányi, 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.

Buisman, H., Kruitbosch, G., Peek, N., Endriss, U. (2008) Simulation of negotiation policies in distributed multiagent resource allocation.

In Artikis, A. O'Hare, G.M.P. Stathis, K. Vouros, G. (Eds.), Engineering Societies in the Agents World VIII: 8th international workshop, ESAW 2007, Athens, Greece, October 22-24, 2007: revised selected papers (pp 224-239) (Lecture Notes in Computer Science
Lecture Notes in Artificial Intelligence, Vol. 4995). Springer.

Buldt, B., Löwe, B., Müller, T. (2008) Towards a new epistemology of mathematics.

Erkenntnis, Vol. 68 (pp 309-329)

Article | https://doi.org/10.1007/s10670-008-9101-6 | UvA-DARE

Bunt, Harry, Lavie, Alon, Carpenter, Bob, Carroll, John, Charniak, Eugene, Joshi, Aravind, Kaplan, Ronald, Kay, Martin, Klein, Dan, Kurohashi, Sadao, Malouf, Robert, Matsumoto, Yuji, Merlo, Paola, Moore, Bob, Nijholt, Anton, van Noord, G., Oepen, Stephan, Riezler, Stefan, Satta, Giorgio, Sima'an, K., Steedman, M., Tanaka, Hozumi, Uszkoreit, Hans, de la Clergerie, Eric Villemonte, Vijay-Shanker, K., Wu, Dekai, de Akker, Rieks op, Kawahara, Daisuke, Okumura, Manabu, Sagae, Kenji, Shen, Libin, Shirai, Kiyoaki, Burstein, Jill, Ostendorf, Mari (2005) Preface.

In WPT 2005 - Proceedings of the 9th International Workshop on Parsing Technologies (pp III) (IWPT 2005 - Proceedings of the 9th International Workshop on Parsing Technologies)

Buratto, L., Sima'an, K. (2003) Backoff DOP: Parameter Estimation by Backoff.

In Matousek, V. Mautner, P. (Eds.), Proceedings of the International Conference on Text, Speech and Dialogue (TSD'03), Lecture Notes in Artificial Intelligence (LNAI 2807) (pp 35-42)

Burchardt, A., Hahn, Frederik (2023) The Foliage Partition: An Easy-to-Compute LC-Invariant for Graph States.

ArXiv.

Preprint | https://doi.org/10.48550/arXiv.2305.07645 | UvA-DARE

Burgdorf, S., Laurent, M., Piovesan, T. (2015) On the closure of the completely positive semidefinite cone and linear approximations to quantum colorings.

In Beigi, S. König, R. (Eds.), 10th Conference on the Theory of Quantum Computation, Communication and Cryptography: TQC'15, May 20-22, 2015, Brussels, Belgium (pp 127-146) (Leibniz International Proceedings in Informatics, Vol. 44). Schloss Dagstuhl - Leibniz-Zentrum für Informatik.

Bürgisser, P., Doğan, M.L., Makam, V., Walter, M., Wigderson , A. (2021) Polynomial Time Algorithms in Invariant Theory for Torus Actions.

In Kabanets, V. (Eds.), 36th Computational Complexity Conference: CCC2021, July 20-23, 2021, Toronto Canada (Virtual Conference) (Leibniz International Proceedings in Informatics, Vol. 200). Schloss Dagstuhl - Leibniz-Zentrum für Informatik.

Bürgisser, P., Franks, C., Garg, A., Oliveira, R., Walter, M., Wigderson , A. (2018) Efficient Algorithms for Tensor Scaling, Quantum Marginals, and Moment Polytopes.

In Thorup, M. (Eds.), 59th Annual IEEE Symposium on Foundations of Computer Science: FOCS 2018 : proceedings : 7-9 October 2018, Paris, France (pp 883-897). IEEE Computer Society.