Arnoult, S.I., Sima'an, K. (2016) Factoring Adjunction in Hierarchical Phrase-Based SMT.

In Proceedings of the 2nd Deep Machine Translation Workshop

Arnoult, S.I. (2021) Adjunction in hierarchical phrase-based translation.

ILLC dissertation series. Institute for Logic, Language and Computation.

Thesis, fully internal | UvA-DARE

Arpin, S., Camacho-Navarro, C., Lauter, K., Lim, J., Nelson, K., Scholl, T., Sotáková, J. (2023) Adventures in Supersingularland.

Experimental Mathematics, Vol. 32 (pp 241-268)

Article | https://doi.org/10.1080/10586458.2021.1926009 | UvA-DARE

Arsenijevic, B. (2007) Disapprobation expressions are vocative epithets.

ACLC Working Papers, Vol. 2 (pp 87-98)

Article | UvA-DARE

Arsenijevic, B. (2007) Slavic verb prefixes are resultative.

Cahiers Chronos, Vol. 17 (pp 197-213)

Article | UvA-DARE

Arsenijevic, B. (2007) Recursive computation in humans and certain species of birds: parallels and implications.

In Pecikoza, V. (Eds.), Antropologia (pp 141-147). Petnica Science Centre.

Arsenijevic, B. (2007) A unified analysis of two classes of Slavic verb-prefixes.

In Blaho, S. Schoorlemmer, E. Vincente, L. (Eds.), Proceedings of ConSole XIV (pp 21-36). ConSOLE.

Arsenijevic, B. (2008) From spatial cognition to language.

Biolinguistics, Vol. 2 (pp 3-23)

Article | http://www.biolinguistics.eu/index.php/biolinguistics/article/view/34 | UvA-DARE

Artemov, S., Kushner, B., Mints, E., Nogina, E., Troelstra, A.S. (1999) In Memoriam: Albert G. Dragalin, 1941-1998.

The Bulletin of Symbolic Logic, Vol. 5 (pp 389-391)

Article | https://doi.org/10.1017/S1079898600006934 | UvA-DARE

Arunachalam, S., Belovs, A., Childs, A.M., Kothari, R., Rosmanis, A., de Wolf, R. (2020) Quantum Coupon Collector.

In Flammia, S.T. (Eds.), 15th Conference on the Theory of Quantum Computation, Communication and Cryptography: TQC 2020, June 9-12, 2020, Riga, Latvia (Leibniz International Proceedings in Informatics, Vol. 158). Schloss Dagstuhl - Leibniz-Zentrum für Informatik.

Arunachalam, S., Chakraborty, S., Koucký, M., Saurabh, N., de Wolf, R. (2020) Improved bounds on Fourier entropy and Min-entropy.

In Paul, C. Bläser, M. (Eds.), 37th International Symposium on Theoretical Aspects of Computer Science: STACS 2020, March 10-13, 2020, Montpellier, France (Leibniz International Proceedings in Informatics, Vol. 154). Schloss Dagstuhl - Leibniz-Zentrum für Informatik.

Arunachalam, S., Chakraborty, S., Koucký, M., Saurabh, N., de Wolf, R. (2021) Improved Bounds on Fourier Entropy and Min-entropy.

ACM Transactions on Computation Theory, Vol. 13

Article | https://doi.org/10.1145/3470860 | UvA-DARE

Arunachalam, S., Chakraborty, S., Lee, T., Paraashar, M., de Wolf, R. (2019) Two new results about quantum exact learning.

In Baier, C. Chatzigiannakis, I. Flocchini, P. Leonardi, S. (Eds.), 46th International Colloquium on Automata, Languages, and Programming: ICALP 2019, July 9-12, 2019, Patras, Greece (Leibniz International Proceedings in Informatics, Vol. 132). Schloss Dagstuhl - Leibniz-Zentrum für Informatik.

Arunachalam, S., Chakraborty, S., Lee, T., Paraashar, M., de Wolf, R. (2021) Two new results about quantum exact learning.

Quantum, Vol. 5

Article | https://doi.org/10.22331/Q-2021-11-24-587 | UvA-DARE

Arunachalam, S., de Wolf, R. (2017) Optimal quantum sample complexity of learning algorithms.

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.

Arunachalam, S., de Wolf, R. (2017) Guest Column: A Survey of Quantum Learning Theory.

SIGACT News, Vol. 48 (pp 41-67)

Article | https://doi.org/10.1145/3106700.3106710 | UvA-DARE

Arunachalam, S., de Wolf, R. (2017) Optimizing the Number of Gates in Quantum Search.

Quantum Information & Computation, Vol. 17 (pp 251-261)

Article | https://doi.org/10.26421/QIC17.3-4 | UvA-DARE

Arunachalam, S., de Wolf, R. (2018) Optimal Quantum Sample Complexity of Learning Algorithms.

Journal of Machine Learning Research, Vol. 19

Article | http://jmlr.org/papers/v19/18-195.html | UvA-DARE

Arunachalam, S., Vrana, P., Zuiddam, J. (2020) The asymptotic induced matching number of hypergraphs: Balanced binary strings.

Electronic Journal of Combinatorics, Vol. 27

Article | https://doi.org/10.37236/9019 | UvA-DARE

Arunachalam, S. (2018) Quantum algorithms and learning theory.

Thesis, fully internal | UvA-DARE