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) 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. (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. (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

Arvola, P., Geva, S., Kamps, J., Schenkel, R., Trotman, A., Vainio, J. (2010) Overview of the INEX 2010 ad hoc track.

In INEX 2010 Workshop Pre-proceedings (pp 11-38)

Arvola, P., Geva, S., Kamps, J., Schenkel, R., Trotman, A., Vainio, J. (2011) Overview of the INEX 2010 ad hoc track.

In Geva, S. Kamps, J. Schenkel, R. Trotman, A. (Eds.), Comparative Evaluation of Focused Retrieval: 9th International Workshop of the Inititative for the Evaluation of XML Retrieval, INEX 2010, Vugh, The Netherlands, December 13-15, 2010 : revised selected papers (pp 1-32) (Lecture Notes in Computer Science, Vol. 6932). Springer.

Asatianti, A., Balogh, K., Chikoidze, G., Dekker, P.J.E., de Jongh, D. (2004) Proceedings of the Fifth Tbilisi Symposium on Language, Logic and Computation.

Tbilisi State University Press.

Book (Editorship) | UvA-DARE

Ataman, Duygu, Aziz, W., Birch, Alexandra (2020) A Latent Morphology Model for Open-Vocabulary Neural Machine Translation.

In International Conference on Learning Representations

Aucher, G., Grossi, D., Herzig, A., Lorini, E. (2009) Dynamic context logic and its application to norm change.

Dagstuhl Seminar Proceedings, Vol. 09121

Article | http://drops.dagstuhl.de/opus/volltexte/2009/1900/ | UvA-DARE

Aucher, G., Grossi, D., Herzig, A., Lorini, E. (2009) Dynamic context logic.

In He, X. Horty, J. Pacuit, E. (Eds.), Logic, Rationality, and Interaction: second international workshop, LORI 2009, Chongqing, China, October 8-11, 2009 : proceedings (pp 15-26) (Lecture Notes in Computer Science
Lecture Notes in Artificial Intelligence
FoLLI Publications on Logic, Language and Information, Vol. 5834). Springer.

Aucher, G., van Benthem, J.F.A.K., Grossi, D. (2015) Sabotage modal logic: Some model and proof theoretic aspects.

In van der Hoek, W. Holliday, W.H. Wang, W.-F. (Eds.), Logic, Rationality, and Interaction: 5th International Workshop, LORI 2015, Taipei, Taiwan, October 28-30, 2015 : proceedings (pp 1-13) (Lecture Notes in Computer Science
FoLLI Publications on Logic, Language and Information, Vol. 9394). Springer.

Aucher, G., van Benthem, J.F.A.K., Grossi, D. (2018) Modal logics of sabotage revisited.

Journal of Logic and Computation, Vol. 28 (pp 269–303)

Article | https://doi.org/10.1093/logcom/exx034 | UvA-DARE

Awodey, S., Kishida, K. (2012) Topological Completeness of First-Order Modal Logic.

In Bolander, T. Braüner, T. Ghilardi, S. Moss, L. (Eds.), Advances in Modal Logic: AiML 9 (pp 1-17). College Publications.

Azarbonyad, H., Dehghani, M., Beelen, K., Arkut, A., Marx, M., Kamps, J. (2017) Words are Malleable: Computing Semantic Shifts in Political and Media Discourse.

Abstract | https://marijnkoolen.github.io/dir2017/accepted-submissions/DIR2017_paper_10.pdf | UvA-DARE