-
Caracciolo, C., de Rijke, M. (2002) Structured access to scientific information.In Proceedings of the First Global WordNet Conference (pp 187-191). CIIL.Conference contribution | UvA-DARECaracciolo, C., van Hage, W.R., de Rijke, M. (2004) Topic Driven Access to Full Text Documents.In Heery, R. Lyon, L. (Eds.), Proceedings of the 8th European Conference on Artificial intelligence (pp 495-500). Springer.Conference contribution | UvA-DARECaracciolo, C., van Hage, W.R., de Rijke, M. (2004) Towards topic driven access to full text documents.In Proceedings of the 8th European Conference on Digital Libraries (ECDL 2004) (pp 495-500). Springer.Conference contribution | UvA-DARECaracciolo, C. (2000) Hermes: un sistema di recupero e consegna di informazioni.In Proceedings of XXXVIII Annual Conference AICA (pp 77-84)Conference contribution | UvA-DARECaracciolo, C. (2002) Towards modular access to electronic handbooks.JoDI, Journal of Digital Information, Vol. 3Article | UvA-DARECaracciolo, C. (2008) Topic driven access to scientific handbooks.SIKS.Thesis, fully internal | UvA-DARECaramanis, C., Dütting, P., Faw, M., Fusco, F., Lazos, P., Leonardi, S., Papadigenopoulos, O., Pountourakis, E., Reiffenhäuser, R. (2022) Single-Sample Prophet Inequalities via Greedy-Ordered Selection.In Naor, J. Buchbinder, N. (Eds.), Proceedings of the 2022 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA) (pp 1298-1325). Society for Industrial and Applied Mathematics.Conference contribution | https://doi.org/10.48550/arXiv.2111.03174 | UvA-DARECaramello, O., Marra, V., Spada, L. (2014) General affine adjunctions, Nullstellensätze, and dualities.ArXiv.Preprint | https://doi.org/10.48550/arXiv.1412.8692 | UvA-DARECarcassi, F., Sbardolini, G. (2023) Assertion, Denial, and the Evolution of Boolean Operators.Mind and Language, Vol. 38 (pp 1187-1207)Article | https://doi.org/10.1111/mila.12448 | UvA-DARECarcassi, F., Steinert-Threlkeld, S., Szymanik, J. (2019) The emergence of monotone quantifiers via iterated learning.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 190-196). Cognitive Science Society.Conference contribution | https://cogsci.mindmodeling.org/2019/papers/0054/index.html | UvA-DARECarcassi, F., Steinert-Threlkeld, S., Szymanik, J. (2021) Monotone Quantifiers Emerge via Iterated Learning.Cognitive Science, Vol. 45Article | https://doi.org/10.1111/cogs.13027 | UvA-DARECarcassi, F., Szymanik, J. (2021) The Shape of Modified Numerals.In 43rd Annual Meeting of the Cognitive Science Society (CogSci 2021): Comparative Cognition Animal Minds : Vienna, Austria, 26-29 July 2021 (pp 742-748) (Proceedings of the Annual Meeting of the Cognitive Science Society, Vol. 43). Cognitive Science Society.Conference contribution | https://escholarship.org/uc/item/4wk1z3ws | UvA-DARECarcassi, F., Szymanik, J. (2021) An Alternatives Account of ‘Most’ and ‘More Than Half’.Glossa: a journal of general linguistics, Vol. 6Article | https://doi.org/10.16995/glossa.5764 | UvA-DARECarcassi, F., Szymanik, J. (2021) ‘Most’ vs ‘More Than Half’: An Alternatives Explanation.Proceedings of the Society for Computation in Linguistics, Vol. 4 (pp 334-343)Article | https://doi.org/10.7275/ej4z-e110 | UvA-DARECarcassi, F., Szymanik, J. (2022) Heavy Tails and the Shape of Modified Numerals.Cognitive Science, Vol. 46Article | https://doi.org/10.1111/cogs.13176 | UvA-DARECarcassi, F., Szymanik, J. (2022) Neural Networks Track the Logical Complexity of Boolean Concepts.Open Mind, Vol. 6 (pp 132-146)Article | https://doi.org/10.1162/opmi_a_00059 | UvA-DARECarl, M., Galeotti, L., Löwe, B. (2018) The Bolzano-Weierstrass theorem in generalised analysis.Houston Journal of Mathematics, Vol. 44 (pp 1081-1109)Carl, M., Galeotti, L., Passmann, R. (2021) Randomising Realizability.In De Mol, L. Weiermann, A. Manea, F. Fernández-Duque, D. (Eds.), Connecting with Computability: 17th Conference on Computability in Europe, CiE 2021, virtual event, Ghent, July 5–9, 2021 : proceedings (pp 82-93) (Lecture Notes in Computer Science, Vol. 12813). Springer.Conference contribution | https://doi.org/10.1007/978-3-030-80049-9_8 | UvA-DARECarl, M., Galeotti, L., Passmann, R. (2023) Realisability for infinitary intuitionistic set theory.Annals of Pure and Applied Logic, Vol. 174Article | https://doi.org/10.1016/j.apal.2023.103259 | UvA-DARECarrara, M., Mancini, F., Smid, Jeroen (2022) On the Overlap Between Everything and Nothing.Logic and Logical Philosophy, Vol. 31 (pp 143-160)Article | https://doi.org/10.12775/LLP.2021.013 | UvA-DARE
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 illc at uva.nl