Searchable List of Research Output

Filter Publications
  • van Cranenburgh, A. (2012) Literary authorship attribution with phrase-structure fragments.
    In Elson, D. Kazantseva, A. Mihalcea, R. Szpakowicz, S. (Eds.), NAACL-HLT 2012 : Workshop on Computational Linguistics for Literature: co-located with The 2012 Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies : proceedings of the workshop : June 8, 2012, Montréal, Canada (pp 59-63). Association for Computational Linguistics.
    Conference contribution | http://aclweb.org/anthology/W12-2508 | UvA-DARE
  • van Cranenburgh, A. (2014) Extraction of Phrase-Structure Fragments with a Linear Average Time Tree-Kernel.
    Computational Linguistics in the Netherlands Journal, Vol. 4 (pp 3-16)
  • van Cranenburgh, A.W. (2016) Rich statistical parsing and literary language.
    Thesis, fully internal | UvA-DARE
  • van Dam, J.W.M. Hardy, L. (1998) Quantum Wispers.
    Quant-Ph Archive (pp ---)
    Article | UvA-DARE
  • van Dam, J.W.M. (1998) Quantum oracle interrogation: getting all information for almost half the price.
    In Proceedings of the 39th IEEE Symposium on the foundations computation science (pp 362-367) (-)
    Chapter | UvA-DARE
  • van Dam, J.W.M. (1998) Two classical queries versus one quantum query.
    Quant-Ph Archive (pp ---)
    Article | UvA-DARE
  • van Dam, W.K. (2002) On quantum computation theory.
    Institute for Logic, Language and Computation.
    Thesis, fully internal | UvA-DARE
  • van de Pol, I. Lodder, P. van Maanen, L. Steinert-Threlkeld, S. Szymanik, J. (2021) Quantifiers satisfying semantic universals are simpler.
    In 43rd Annual Meeting of the Cognitive Science Society (CogSci 2021): Comparative Cognition Animal Minds : Vienna, Austria, 26-29 July 2021 (pp 756-762) (Proceedings of the Annual Meeting of the Cognitive Science Society, Vol. 43). Cognitive Science Society.
  • van de Pol, I. Lodder, P. van Maanen, L. Steinert-Threlkeld, S. Szymanik, J. (2023) Quantifiers satisfying semantic universals have shorter minimal description length.
    Cognition, Vol. 232
  • van de Pol, I. Steinert-Threlkeld, S. Szymanik, J. (2019) Complexity and learnability in the explanation of semantic universals of quantifiers.
    In Goel, A.K. Seifert, C.M. Freksa, C. (Eds.), Creativity + cognition + computation: 41st Annual Meeting of the Cognitive Science Society (CogSci 2019) : Montreal, Canada, 24-27 July 2019 (pp 3015-3021). Cognitive Science Society.
  • van de Pol, I. van Rooij, I. Szymanik, J. (2016) Parameterized Complexity Results for a Model of Theory of Mind Based on Dynamic Epistemic Logic.
    Electronic Proceedings in Theoretical Computer Science, Vol. 215 (pp 246-263)
  • van de Pol, I. van Rooij, I. Szymanik, J. (2018) Parameterized complexity of theory of mind reasoning in dynamic epistemic logic.
    Journal of Logic, Language and Information, Vol. 27 (pp 255-294)
  • van den Berg, B. Briseid, E. Safarik, P. (2017) The strength of countable saturation.
    Archive for Mathematical Logic, Vol. 56 (pp 699-711)
  • van den Berg, B. Faber, E. (2022) Effective Kan fibrations in simplicial sets.
    Lecture Notes in Mathematics, Vol. 2321. Springer.
  • van den Berg, B. Heunen, C. (2014) Extending obstruction to noncommutative functorial spectra.
    Theory and Applications of Categories, Vol. 29 (pp 457-474)
  • van den Berg, B. Moerdijk, I. (2014) The axiom of multiple choice and models for constructive set theory.
    Journal of Mathematical Logic, Vol. 14
  • van den Berg, B. Moerdijk, I. (2015) W-types in homotopy type theory.
    Mathematical Structures in Computer Science, Vol. 25 (pp 1100-1115)
  • van den Berg, B. Moerdijk, I. (2018) Univalent completion.
    Mathematische Annalen, Vol. 371 (pp 1337–1350)
  • van den Berg, B. Moerdijk, I. (2018) Exact completion of path categories and algebraic set theory: Part I: Exact completion of path categories.
    Journal of Pure and Applied Algebra, Vol. 222 (pp 3137-3181)
  • van den Berg, B. Passmann, R. (2022) Converse extensionality and apartness.
    Logical Methods in Computer Science, Vol. 18

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