Searchable List of Research Output

Filter Publications
  • Wagner, E. (2013) The explanatory relevance of Nash equilibrium: One-dimensional chaos in boundedly rational learning.
    Philosophy of Science, Vol. 80 (pp 783-795)
  • Wagner, E.O., Franke, M. (2013) [Review of: B. Skyrms (2010) Signals : evolution, learning, & information].
    British Journal for the History of Philosophy, Vol. 64 (pp 883-887)
    Book/Film/Article/Exhibition review | https://doi.org/10.1093/bjps/axt004 | UvA-DARE
  • Wagner, E.O. (2012) Evolving to divide the fruits of cooperation.
    Philosophy of Science, Vol. 79 (pp 81-94)
  • Wagner, E.O. (2012) Deterministic chaos and the evolution of meaning.
    British Journal for the Philosophy of Science, Vol. 63 (pp 547-575)
  • Wagner, E.O. (2013) The dynamics of costly signaling.
    Games, Vol. 4 (pp 163-181)
  • Wang, B., Titov, I., Lapata, M. (2019) Learning Semantic Parsers from Denotations with Latent Structured Alignments and Abstract Programs.
    In Inui, K. Jiang, J. Ng, V. Wan, X. (Eds.), 2019 Conference on Empirical Methods in Natural Language Processing and 9th International Joint Conference on Natural Language Processing: EMNLP-IJCNLP 2019 : proceedings of the conference : November 3-7, 2019, Hong Kong, China (pp 3774-3785). The Association for Computational Linguistics.
    Conference contribution | https://doi.org/10.18653/v1/D19-1391 | UvA-DARE
  • Wang, Q., Ramírez, G., Marx, M., Theobald, M., Kamps, J. (2012) Overview of the INEX 2011 Data-Centric Track.
    In Geva, S. Kamps, J. Schenkel, R. (Eds.), Focused Retrieval of Content and Structure: 10th International Workshop of the Initiative for the Evaluation of XML Retrieval, INEX 2011, Saarbrücken, Germany, December 12-14, 2011 : revised selected papers (pp 118-137) (Lecture Notes in Computer Science, Vol. 7424). Springer.
  • Wang, S. (2020) Calculating dating goals: data gaming and algorithmic sociality on Blued, a Chinese gay dating app.
    Information, Communication & Society, Vol. 23 (pp 181-197)
  • Wang, Y. (2010) Epistemic modelling and protocol dynamics.
    Institute for Logic, Language and Computation.
    Thesis, fully internal | UvA-DARE
  • Warglien, M., Gärdenfors, P., Westera, M. (2012) Event structure, conceptual spaces and the semantics of verbs.
    Theoretical Linguistics, Vol. 38 (pp 159-193)
  • Warglien, M., Gärdenfors, P., Westera, M. (2012) Replies to comments.
    Theoretical Linguistics, Vol. 38 (pp 249-264)
  • Wassermann, R. (1999) Full Acceptance through Argumentation.
    In Proceedings of the IJCAI workshop on Practical Reasoning and Rationality
    Conference contribution | UvA-DARE
  • Wassermann, R. (1999) Resource-Bounded Belief Revision.
    Erkenntnis, Vol. 50
    Article | UvA-DARE
  • Wassermann, R. (2000) Resource Bounded Belief revision.
    ILLC dissertation series 2000-01.
    Thesis, fully internal | UvA-DARE
  • Weber, A., Müller, K.E. (2004) Word order variation in German main clauses: A corpus analysis.
    In Proceedings of the 5th International Workshop on Linguistically Interpreted Corpora
    Conference contribution | UvA-DARE
  • Wehner, S.D.C., Ballester, M. (2007) Entropic uncertainty relations and locking: tight bounds for mutually unbiased bases.
    Physical Review A, Vol. 75 (pp 022319-022319)
    Article | UvA-DARE
  • Wehner, S.D.C., Christiandl, M. (2005) Quantum Anonymous Transmissions.
    In Proceedings of 11th ASIACRYPT (pp 217-235)
    Conference contribution | UvA-DARE
  • Wehner, S.D.C., de Wolf, R. (2005) Improved Lower Bounds for Locally Decodable Codes and Private Information.
    In Proceedings of ICALP
    Conference contribution | UvA-DARE
  • Wehner, S.D.C., Schaffner, C., Terhal, B. (2007) Cryptography from noisy photonic storage.
    Institute for Logic Language and Computation.
    Working paper | UvA-DARE
  • Wehner, S.D.C., Wullschleger, J. (2007) Composable security in the bounded-quantum-storage model.
    Institute for Logic Language and Computation.

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