uva.nl

Institute for Logic, Language and Computation

Searchable List of Research Output

Filter Publications
  • Briët, J., Buhrman, H., Toner, B. (2009) A generalized Grothendieck inequality and entanglement in XOR games.
    Institute for Logic, Language and Computation.
  • Briët, J., Buhrman, H., Toner, B. (2011) A Generalized Grothendieck Inequality and Nonlocal Correlations that Require High Entanglement.
    Communications in Mathematical Physics, Vol. 305 (pp 827-843)
  • Briët, J., Zuiddam, J. (2017) On the orthogonal rank of Cayley graphs and impossibility of quantum round elimination.
    Quantum Information & Computation, Vol. 17 (pp 106-116)
  • Briët, J. (2011) Grothendieck inequalities, nonlocal games and optimization.
    Institute for Logic, Language and Computation.
    Thesis, fully internal | UvA-DARE
  • Brill, M., Elkind, E., Endriss, U., Grandi, U. (2016) Pairwise Diffusion of Preference Rankings in Social Networks.
    In Kambhampati, S. (Eds.), Proceedings of the Twenty-Fifth International Joint Conference on Artificial Intelligence: New York, NY, USA, 9-15 July, 2016 (pp 130-136). AAAI Press.
  • Bringmann, K., Ikenmeyer, C., Zuiddam, J. (2017) On algebraic branching programs of small width.
    In O'Donnell, R. (Eds.), 32nd Computational Complexity Conference: CCC 2017, July 6-9, 2017, Riga, Latvia (Leibniz International Proceedings in Informatics, Vol. 79). Schloss Dagstuhl - Leibniz-Zentrum für Informatik.
  • Bringmann, K., Ikenmeyer, C., Zuiddam, J. (2018) On algebraic branching programs of small width.
    Journal of the ACM, Vol. 65
  • Broadbent, A., Schaffner, C. (2016) Quantum cryptography beyond quantum key distribution.
    Designs, Codes and Cryptography, Vol. 78 (pp 351-382)
  • Brochhagen, T., Franke, M., van Rooij, R. (2016) Learning biases may prevent lexicalization of pragmatic inferences: a case study combining iterated (Bayesian) learning and functional selection.
    In Papafragou, A. Grodner, D. Mirman, D. Trueswell, J.C. (Eds.), COGSCI 2016: 38th Annual Meeting of the Cognitive Science Society : Recognizing and Representing Events : Philadelphia, Pennsylvania August 10-13, 2016 (pp 2081-2086). Cognitive Science Society.
  • Brochhagen, T., Franke, M., van Rooij, R. (2018) Coevolution of Lexical Meaning and Pragmatic Use.
    Cognitive Science, Vol. 42 (pp 2757–2789)
  • Brochhagen, T., Franke, M. (2017) Effects of transmission perturbation in the cultural evolution of language.
    In Gunzelmann, G. Howes, A. Tenbrink, T. Davelaar, E.J. (Eds.), CogSci 2017: proceedings of the 39th Annual Meeting of the Cognitive Science Society : London, UK : 26-29 July 2017 : Computational Foundations of Cognition (pp 1678-1683). Cognitive Science Society.
  • Brochhagen, T., Roelofsen, F., Theiler, N. (2015) Proceedings of the 20th Amsterdam Colloquium.
    Institute for Logic, Language and Computation, University of Amsterdam.
  • Brochhagen, T. (2015) Minimal Requirements for Productive Compositional Signaling.
    In Noelle, D.C. Dale, R. Warlaumont, A.S. Yoshimi, J. Matlock, T. Jennings, C.D. Maglio, P.P. (Eds.), COGSCI 2015 : 37th Annual Meeting of the Cognitive Science Society: Mind, Technology, and Society : Pasadena, California, 23-25 July 2015 (pp 285-290). Cognitive Science Society.
  • Brochhagen, T. (2015) Improving Coordination on Novel Meaning through Context and Semantic Structure.
    In Berwick, R. Korhonen, A. Lenci, A. Poibeau, T. Villavicencio, A. (Eds.), EMNLP 2015 : Conference on Empirical Methods in Natural Language Processing: proceedings of the Sixth Workshop on Cognitive Aspects of Computational Language Learning (CogACLL-2015) : 18 September 2015, Lisbon, Portugal (pp 74-82). Association for Computational Linguistics.
  • Brochhagen, T. (2018) Signaling under uncertainty.
    Thesis, fully internal | UvA-DARE
  • Brochhagen, T. (2020) Signalling under Uncertainty: Interpretative Alignment without a Common Prior.
    British Journal for the Philosophy of Science, Vol. 71 (pp 471–496)
  • Brody, J., Buhrman, H., Koucký, M., Loff Barreto, B.S., Speelman, F., Vereshchagin, N. (2013) Towards a reverse Newman's theorem in interactive information complexity.
    In CCC 2013 : 2013 IEEE Conference on Computational Complexity: proceedings : 5-7 June 2013, Palo Alto, California, USA (pp 24-33). IEEE.
    Conference contribution | https://doi.org/10.1109/CCC.2013.12 | UvA-DARE
  • Brody, J., Buhrman, H., Koucký, M., Loff Barreto, B.S., Speelman, F., Vereshchagin, N. (2016) Towards a Reverse Newman's Theorem in Interactive Information Complexity.
    Algorithmica, Vol. 76 (pp 749-781)
  • Brokkelkamp, R., Hoeijmakers, S., Schäfer, G. (2022) Greater Flexibility in Mechanism Design Through Altruism.
    In Kanellopoulos, P. Kyropoulou, M. Voudouris, A. (Eds.), Algorithmic Game Theory: 15th International Symposium, SAGT 2022, Colchester, UK, September 12–15, 2022 : proceedings (pp 41-59) (Lecture Notes in Computer Science
    Advanced Research in Computing and Software Science, Vol. 13584). Springer.
  • Brokkelkamp, R. (2022) How close does it get? From near-optimal network algorithms to suboptimal equilibrium outcomes.
    ILLC Dissertation Series
    Thesis, externally prepared | UvA-DARE
1 ... 57 58 59 60 61 62 63 64 65 ... 308

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