Searchable List of Research Output

Filter Publications
  • Culbertson, J., Schouwstra, M., Kirby, S. (2020) From the world to word order: Deriving biases in noun phrase order from statistical properties of the world.
    Language, Vol. 96 (pp 696-717)
  • Cuong, H., Sima'an, K. (2014) Latent Domain Phrase-based Models for Adaptation.
    In Moschitti, A. Pang, B. Daelemans, W. (Eds.), EMNLP 2014: the 2014 Conference on Empirical Methods In Natural Language Processing: proceedings of the conference: October 25-29, 2014, Doha, Qatar (pp 566-576). Association for Computational Linguistics.
  • Cuong, H., Sima'an, K. (2014) Latent Domain Translation Models in Mix-of-Domains Haystack.
    In Tsujii, J. Hajic, J. (Eds.), COLING 2014: the 25th International Conference on Computational Linguistics: proceedings of COLING 2014 : technical papers: August 23-29, 2014, Dublin, Ireland (pp 1928-1939). Association for Computational Linguistics.
  • Cuong, H., Sima'an, K. (2015) Latent Domain Word Alignment for Heterogeneous Corpora.
    In Mihalcea, R. Chai, J. Sarkar, A. (Eds.), NAACL HLT 2015: The 2015 Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies: Proceedings of the Conference : May 31-June 5, 2015, Denver, Colorado, USA (pp 398-408). The Association for Computational Linguistics.
  • Cuong, H., Sima'an, K. (2017) A survey of domain adaptation for statistical machine translation.
    Machine Translation, Vol. 31 (pp 187-224)
  • Cuong, H., Sima'an, K. (2017) Induction of latent domains in heterogeneous corpora: a case study of word alignment.
    Machine Translation, Vol. 31 (pp 225-249)
  • Czajkowski, J., Groot Bruinderink, L., Hülsing, A., Schaffner, C., Unruh, D. (2018) Post-quantum security of the sponge construction.
    In Lange, T. Steinwandt, R. (Eds.), Post-Quantum Cryptography: 9th International Conference, PQCrypto 2018, Fort Lauderdale, FL, USA, April 9-11, 2018 : proceedings (pp 185-204) (Lecture Notes in Computer Science, Vol. 10786). Springer.
  • Czajkowski, J., Hülsing, A., Schaffner, C. (2019) Quantum Indistinguishability of Random Sponges.
    In Boldyreva, A. Micciancio, D. (Eds.), Advances in Cryptology – CRYPTO 2019: 39th Annual International Cryptology Conference, Santa Barbara, CA, USA, August 18–22, 2019 : proceedings (pp 296-325) (Lecture Notes in Computer Science, Vol. 11693). Springer.
  • Czajkowski, J.M. (2022) Post-quantum security of hash functions.
    ILLC dissertation series. Institute for Logic, Language and Computation.
    Thesis, fully internal | UvA-DARE
  • Czinczoll, T., Yannakoudakis, H., Mishra, P., Shutova, E. (2022) Scientific and Creative Analogies in Pretrained Language Models.
    In Goldberg, Y. Kozareva, Z. Zhang, Y. (Eds.), Findings of the Association for Computational Linguistics: EMNLP 2022: Conference on Empirical Methods in Natural Language Processing (EMNLP), Abu Dhabi, United Arab Emirates, 7-11 December 2022 (pp 2094-2100). Association for Computational Linguistics.
  • D'Agostino, G., Lenzi, G. (2002) On Modal mu-Calculus with Explicit Interpolants.
    Technical Reports. Institute for Logic, Language and Computation.
    Working paper | UvA-DARE
  • D'Agostino, G., Montanari, A., Policriti, A (1995) A set-theoretic translation method for polymodal logics.
    Journal of Automated Reasoning, Vol. 15 (pp 317-337)
  • D'Agostino, G., Montanari, A., Policriti, A (1995) Translating Modal Formulae as set-theoretic terms.
    The Bulletin of Symbolic Logic, Vol. 1 (pp 230-231)
    Article | UvA-DARE
  • D'Agostino, G., Montanari, A., Policriti, A (1995) A set-theoretic analysis of modal deduction.
    In Proceedings of the 10th International Congress of Logic, Methodology and Philosophy of Science, Firenze, Italy, August 1995 (pp 128)
    Chapter | UvA-DARE
  • D'Agostino, G., Montanari, A., Policriti, A (1995) A set-theoretic translation method for polymodal logics.
    In Proceedings of STACS '95: 12th Symposium on Theoretical Aspects of Computer Science (pp 217-228). Springer Verlag.
    Chapter | UvA-DARE
  • D'Agostino, G., Montanari, A., Policriti, A (1995) Set-theoretic decidability result for modal logic.
    Rapporto di Ricerca. Dipartimento di Matematica e Informatica, Univ. di Udine.
    Report | UvA-DARE
  • D'Agostino, G., van Benthem, J.F.A.K. (1998) Modal deduction in second-order logic and set theory, part 2.
    Studia Logica, Vol. 60 (pp ---)
    Article | UvA-DARE
  • D'Agostino, G. (1997) The los-tarski and lyndon theorems for the mu-logic.
    Research Report. onbekend (FdL).
    Report | UvA-DARE
  • D'Inverno, M., Fisher, M., Lomuscio, A., Luck, M., de Rijke, M., Ryan, M., Wooldridge, M. (1997) Formalisms for multi-agent systems.
    Knowledge Engineering Review, Vol. 12 (pp 315-321)
  • Daiber, J., Quiroz, L., Wechsler, R., Frank, S.C. (2015) Splitting Compounds by Semantic Analogy.
    In Jan Hajič António Branco (Eds.), Proceedings of the 1st Deep Machine Translation Workshop (DMTW 2015) (pp 20-28). Charles University in Prague, Faculty of Mathematics and Physics, Institute of Formal and Applied Linguistics, Praha, Czech Republic.

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