Bruineberg, J., Kiverstein, J., Rietveld, E. (2018) The anticipating brain is not a scientist: the free-energy principle from an ecological-enactive perspective.

Synthese, Vol. 195 (pp 2417–2444)

Article | https://doi.org/10.1007/s11229-016-1239-1 | UvA-DARE

Bruineberg, J., Rietveld, E., Parr, T., van Maanen, L., Friston, K.J. (2018) Free-energy minimization in joint agent-environment systems: A niche construction perspective.

Journal of Theoretical Biology, Vol. 455 (pp 161-178)

Article | https://doi.org/10.1016/j.jtbi.2018.07.002 | UvA-DARE

Bruineberg, J., Rietveld, E. (2014) Self-organization, free energy minimization, and optimal grip on a field of affordances.

Frontiers in Human Neuroscience, Vol. 8

Article | https://doi.org/10.3389/fnhum.2014.00599 | UvA-DARE

Bruineberg, J. (2018) [Bespreking van: H. Dreyfus, C. Taylor (2017) Het realisme herwonnen].

Algemeen Nederlands Tijdschrift voor Wijsbegeerte, Vol. 110 (pp 234-239)

Book/Film/Article/Exhibition review | https://doi.org/10.5117/ANTW2018.2.RECE | UvA-DARE

Bruineberg, J.P. (2017) Active inference and the primacy of the 'I can'.

In Metzinger, Thomas Wiese, Wanja (Eds.), Philosophy and Predictive Processing. MIND Group.

Bruineberg, J.P. (2018) Anticipating affordances: Intentionality in self-organizing brain-body-environment systems.

Thesis, fully internal | UvA-DARE

Bruni, E., Fernández, R. (2017) Adversarial Evaluation for Open-Domain Dialogue Generation.

In Jokinen, K. Stede, M. DeVault, D. Louis, A. (Eds.), 18th Annual Meeting of the Special Interest Group on Discourse and Dialogue: proceedings of the conference : 15-17 August 2017, Saarbrücken, Germany : SIGDIAL 2017 (pp 284-288). Association for Computational Linguistics.

Buhrman, H., Bro Miltersen, P., Radhakrishnan, J., Venkatesch, S. (2000) Are bitvectors optimal?.

In Proceedings of Symposium on Theory of Computing (pp 449-458)

Buhrman, H., Chandran, N., Fehr, S., Gelles, R., Goyal, V., Ostrovsky, R., Schaffner, C. (2011) Position-based quantum cryptography: impossibility and constructions.

In Rogaway, P. (Eds.), Advances in Cryptology – CRYPTO 2011: 31st Annual Cryptology Conference, Santa Barbara, CA, USA, August 14-18, 2011: proceedings (pp 429-446) (Lecture Notes in Computer Science, Vol. 6841). Springer.

Buhrman, H., Chandran, N., Fehr, S., Gelles, R., Goyal, V., Ostrovsky, R., Schaffner, C. (2014) Position-based quantum cryptography: Impossibility and constructions.

SIAM Journal on Computing, Vol. 43 (pp 150-178)

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

Buhrman, H., Chang, R., Fortnow, L. (2003) One bit of advice.

In Proceedings of the 20th symposium on Theoretical Aspects of Computer Science. Springer-Verlag.

Buhrman, H., Christandl, M., Hayden, P., H.-K., Lo, Wehner, S.D.C. (2006) Security of quantum bit string commitment depends on the information measure.

Physical Review Letters, Vol. 97 (pp 250501)

Article | http://www.arxiv.org/abs/quant-ph/0609237 | UvA-DARE

Buhrman, H., Christandl, M., Hayden, P., Lo, H.-K., Wehner, S. (2008) Possibility, impossibility, and cheat sensitivity of quantum-bit string commitment.

Physical Review A, Vol. 78 (pp 022316)

Article | https://doi.org/10.1103/PhysRevA.78.022316 | UvA-DARE

Buhrman, H., Christandl, M., Koucký, M., Lotker, Z., Patt-Shamir, B., Vereshchagin, N.K. (2007) High Entropy Random Selection Protocols.

In APPROX-RANDOM (pp 366-379)

Buhrman, H., Christandl, M., Perry, C., Zuiddam, J. (2016) Clean Quantum and Classical Communication Protocols.

Physical Review Letters, Vol. 117

Article | https://doi.org/10.1103/PhysRevLett.117.230503 | UvA-DARE

Buhrman, H., Christandl, M., Schaffner, C. (2012) Complete insecurity of quantum protocols for classical two-party computation.

Physical Review Letters, Vol. 109 (pp 160501)

Article | https://doi.org/10.1103/PhysRevLett.109.160501 | UvA-DARE

Buhrman, H., Christandl, M., Unger, F.P., Wehner, S.D.C., WInter, A. (2006) Implications of superstrong non-locality for cryptography.

In Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences (pp 1919-1932)

Buhrman, H., Christandl, M., Zuiddam, J. (2017) Nondeterministic quantum communication complexity: The cyclic equality game and iterated matrix multiplication.

In Papadimitriou, C.H. (Eds.), 8th Innovations in Theoretical Computer Science Conference: ICTS 2017, January 9-11, 2017, Berkeley, CA, USA (Leibniz International Proceedings in Informatics, Vol. 67). Schloss Dagstuhl - Leibniz-Zentrum für Informatik.

Buhrman, H., Cleve, R., de Wolf, R., Zalka, Ch. (1999) Bounds for small-error and zero-error quantum algorithms.

In Proceedings of 40th IEEE Symposium on the Foundations of Computer Science (FOCS'99) (pp 358-368)

Buhrman, H., Cleve, R., Koucký, M., Loff, B., Speelman, F. (2014) Computing with a full memory: Catalytic space.

In STOC '14: proceedings of the 2014 ACM Symposium on Theory of Computing : New York, New York, USA, May 31, 2014-June 3, 2014 (pp 857-866). ACM.