Searchable List of Research Output

Filter Publications
  • Brasoveanu, A., Farkas, D., Roelofsen, F. (2013) N-words and sentential negation: evidence from polarity particles and VP-ellipsis.
    Semantics and Pragmatics, Vol. 6
  • Brasoveanu, A., Farkas, D.F., Roelofsen, F. (2012) Polarity particles and the anatomy of N-words.
    In Aguilar-Guevara, A. Chernilovskaya, A. Nouwen, R. (Eds.), Proceedings of Sinn und Bedeutung 16 (pp 99-112). MITWPL.
  • Brassard, G., Buhrman, H., Linden, N., Méthot, A.A., Tap, A., Unger, F.P. (2006) Limit on Nonlocality in Any World in Which Communication Complexity Is Not Trivial.
    Physical Review Letters, Vol. 96 (pp 250401)
  • Brave, R., Russo, F., Wagemans, J. (2022) Argument-Checking: A Critical Pedagogy Approach to Digital Literacy.
    In Ciracì, F. Miglietta, G. Gatto, C. (Eds.), AIUCD 2022 - Culture digitali. Intersezioni: filosofia, arti, media: proceedings (pp 245-248) (Quaderni di Umanistica Digitale). Associazione per l'Informatica Umanistica e la Cultura Digitale.
  • Bravyi, Sergey, Sharma, Yash, Szegedy, M., de Wolf, R. (2022) Generating $k$ EPR-pairs from an $n$-party resource state.
  • Bražinskas, Arthur, Havrylov, S., Titov, I. (2016) Embedding Words as Distributions with a Bayesian Skip-gram Model.
  • Bražinskas, Arthur, Havrylov, S., Titov, I. (2018) Embedding Words as Distributions with a Bayesian Skip-gram Model.
    In Bender, E.M. Derczynski, L. Isabelle, P. (Eds.), The 27th International Conference on Computational Linguistics: COLING 2018 : proceedings of the conference : August 20-26, 2018, Santa Fe, New Mexico, USA (pp 1775-1789). Association for Computational Linguistics.
  • Bražinskas, Arthur, Lapata, M., Titov, I. (2020) Few-shot learning for opinion summarization.
    In Webber, B. Cohn, T. Ye, Y. Liu, Y. (Eds.), 2020 Conference on Empirical Methods in Natural Language Processing: EMNLP 2020 : proceedings of the conference : November 16-20, 2020 (pp 4119-4135). The Association for Computational Linguistics.
  • Bražinskas, Arthur, Lapata, M., Titov, I. (2020) Unsupervised opinion summarization as copycat-review generation.
    In Jurafsky, D. Chai, J. Schluter, N. Tetreault, J. (Eds.), The 58th Annual Meeting of the Association for Computational Linguistics: ACL 2020 : Proceedings of the Conference : July 5-10, 2020 (pp 5151-5169). The Association for Computational Linguistics.
  • Bražinskas, Arthur, Lapata, M., Titov, I. (2021) Learning Opinion Summarizers by Selecting Informative Reviews.
    In Moens, M.-C. Huang, X. Specia, L. Sih, S.W. (Eds.), 2021 Conference on Empirical Methods in Natural Language Processing: EMNLP 2021 : proceedings of the conference : November 7-11, 2021 (pp 9424-9442). The Association for Computational Linguistics.
  • Brendle, J., Halbeisen, L., Löwe, B. (2003) Silver Measurability and its Relation to other Regularity Properties.
    Technical Reports. Institute for Logic, Language and Computation.
    Working paper | UvA-DARE
  • Brendle, J., Halbeisen, L., Löwe, B. (2005) Silver measurability and its relation to other regularity properties.
    Mathematical Proceedings of the Cambridge Philosophical Society, Vol. 138 (pp 135-149)
  • Brendle, J., Löwe, B. (1999) Solovay-type characterizations for forcing algebras.
    Journal of Symbolic Logic, Vol. 64 (pp 1307-1323)
  • Brendle, J., Löwe, B. (2011) Eventually different functions and inaccessible cardinals.
    Journal of the Mathematical Society of Japan, Vol. 63 (pp 137-151)
  • Brewka, G., Roelofsen, F., Serafini, L. (2007) Contextual Default Reasoning.
    In M. Veloso, Manuela (Eds.), IJCAI 2007, Proceedings of the 20th International Joint Conference on Artificial Intelligence (pp 268-273). IJCAI.
    Conference contribution | UvA-DARE
  • Briët, J., Buhrman, H., Gijswijt, D. (2013) Violating the Shannon capacity of metric graphs with entanglement.
    Proceedings of the National Academy of Sciences of the United States of America, Vol. 110 (pp 19227-19232)
  • Briët, J., Buhrman, H., Laurent, M., Piovesan, T., Scarpa, G. (2015) Entanglement-assisted zero-error source-channel coding.
    IEEE Transactions on Information Theory, Vol. 61 (pp 1124-1138)
  • Briët, J., Buhrman, H., Lee, T., Vidick, T. (2012) All Schatten spaces endowed with the Schur product are Q-algebras.
    Journal of Functional Analysis, Vol. 262 (pp 1-9)
  • Briët, J., Buhrman, H., Lee, T., Vidick, T. (2013) Multipartite entanglement in XOR games.
    Quantum Information & Computation, Vol. 13 (pp 334-360)
  • Briët, J., Buhrman, H., Leung, D., Piovesan, T., Speelman, F. (2015) Round Elimination in Exact Communication Complexity.
    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 206-225) (Leibniz International Proceedings in Informatics, Vol. 44). Schloss Dagstuhl - Leibniz-Zentrum für Informatik.

The data of this list is taken from the Pure database. If you find output is missing from the list, please follow the previous link to find out how to submit to Pure. In case there are mistakes in PURE, please contact