Searchable List of Research Output

Filter Publications
  • Visbeek, S., Acar, E., den Hengst, F. (2024) Explainable Fraud Detection with Deep Symbolic Classification.
    In Longo, L. Lapuschkin, S. Seifert, C. (Eds.), Explainable Artificial Intelligence: Second World Conference, xAI 2024, Valletta, Malta, July 17–19, 2024 : proceedings (pp 350–373) (Communications in Computer and Information Science, Vol. 2155). Springer.
  • Visser, A., De Jong, R., Beks, W., Schlobach, S., van Rooij, R., Homburg, A.-J., van Someren, M., van Maanen, L., Sluijter, B. (2017) Naar een nieuw curriculum voor de bachelor Kunstmatige Intelligentie. Translated title of the contribution: Towards a new curriculum for the bachelor Artificial Intelligence
    UvA.
  • Visser, A., van Benthem, J.F.A.K., de Jongh, D., Renardel de Lavalette, G.R. (1995) NNIL, A Study in Intuitionistic Propositional Logic.
    In Ponse, A. de Rijke, M. Venema, Y. (Eds.), Modal Logic and Process Algebra: a bisimulation perspective (pp 289-326). Center for the Study of Language and Information, Stanford University.
    Chapter | UvA-DARE
  • Visser, A. (1997) Dynamic Relation Logic Is the Logic of DPL-Relations.
    Journal of Logic, Language and Information, Vol. 6 (pp 441-452)
  • Visser, A. (1997) An overview of interpretability logic.
    Research report Logic Group Preprint Series. Department of Philosophy, University of Utrecht.
    Report | UvA-DARE
  • Visser, A. (1997) Prolegomena to the definition of dynamic predicate logic with local assignments.
    Research report Logic Group Preprint Series. Universiteit Utrecht.
    Report | UvA-DARE
  • Visser, A.P., van Benthem, J.F.A.K., de Jongh, D., Renardel de Lavalette, G.R. (1995) NNIL, a study in intuitionistic propositional logic.
    In de Rijke, M. Ponse, A. Venema, Y. (Eds.), Modal Logic and process Algebra, a bisimulation perspective (pp 289-326). Center for the Study of Language and Information.
    Chapter | UvA-DARE
  • Visser, H., van Benthem, J.F.A.K. (2009) Inleiding.
    In Beth, E.W. (Eds.), Door wetenschap tot wijsheid : verzameling wijsgerige studiën (Amsterdam Academic Archive). Amsterdam University Press.
    Chapter | UvA-DARE
  • Vitányi, P. (1995) Computational learning theory: second European conference, EuroCOLT '95, Barcelona, Spain, March 13-15, 1995: proceedings.
    Lecture notes in computer science. Springer.
  • Vitányi, P. (2008) Registers.
    In Kao, M.-Y. (Eds.), Encyclopedia of algorithms (pp 761-764) (Springer reference). Springer.
    Entry for encyclopedia/dictionary | https://doi.org/10.1007/978-0-387-30162-4_338 | UvA-DARE
  • Vitányi, P. (2008) A great mind.
    In Grünwald, P. Myllymäki, P. Tabus, I. Weinberger, M. Yu, B. (Eds.), Festschrift in honor of Jorma Rissanen on the occasion of his 75th birthday (pp 305-309) (TICSP series). Tampere International Center for Signal Processing (TICSP).
  • Vitányi, P. (2015) On The Average-Case Complexity of Shellsort.
    ArXiv.
  • Vitanyi, P. (2016) Registers.
    In Kao, M.-Y. (Eds.), Encyclopedia of Algorithms (pp 1808-1812). Springer Reference.
    Entry for encyclopedia/dictionary | https://doi.org/10.1007/978-1-4939-2864-4_338 | UvA-DARE
  • Vitányi, P. (2018) On the average-case complexity of Shellsort.
    Random Structures and Algorithms, Vol. 52 (pp 354-363)
  • Vitanyi, P. M B (1999) The Erdos graph and the beast.
    Mathematical Intelligencer, Vol. 21 (pp 54-55)
    Article | UvA-DARE
  • Vitanyi, P.M.B., Amano, K., Tromp, J.A.H., Watanabe, O. (2001) On a generalized ruin problem.
    In Proc. RANDOM 2001, Lecture Notes in Computer Science (pp 181-191). Springer Verlag.
    Conference contribution | UvA-DARE
  • Vitányi, P.M.B., Balbach, F.J., Cilibrasi, R.L., Li, M. (2008) Normalized information distance.
    Institute for Logic, Language and Computation.
  • Vitányi, P.M.B., Balbach, F.J., Cilibrasi, R.L., Li, M. (2009) Normalized information distance.
    In Emmert-Streib, F. Dehmer, M. (Eds.), Information theory and statistical learning (pp 45-82). Springer.
  • Vitanyi, P.M.B., Buhrman, H., Tromp, J.A.H. (2001) Time and space bounds for reversible simulation.
    In Proc. ICALP 2001, Lecture Notes in Computer Science (pp 1017-1027). Springer Verlag.
    Conference contribution | UvA-DARE
  • Vitányi, P.M.B., Chater, N. (2017) Identification of probabilities.
    Journal of Mathematical Psychology, Vol. 76 (pp 13-24)

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