Searchable List of Research Output

Filter Publications
  • Visser, A.P. van Benthem, J.F.A.K. de Jongh, D.H.J. Renardel de Lavalette, G. (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) 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. (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. (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.M. 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)
  • Vitanyi, P.M.B. Cilibrasi, R. (2007) The Google similarity distance.
    IEEE Transactions on Knowledge & Data Engineering, Vol. 19 (pp 370-383)
  • Vitanyi, P.M.B. Cilibrasi, R. (2014) A Fast Quartet Tree Heuristic for Hierarchical Clustering.
    arXiv. Cornell University Library.
  • Vitányi, P.M.B. Cilibrasi, R.L. (2010) Normalized web distance and word similarity.
    In Indurkhya, N. Damerau, F.J. (Eds.), Handbook of natural language processing (pp 293-314) (Chapman & Hall/CRC machine learning & pattern recognition series). CRC Press.
  • Vitanyi, P.M.B. Cohen, Andrew R. (2011) Normalized Compression Distance of Multiples.
    arXiv. Cornell University Library.
  • Vitanyi, P.M.B. Cohen, Andrew R. (2015) Web Similarity.
    ArXiv, Vol. 1502.0595. Cornell University Library.
  • Vitanyi, P.M.B. Gács, P. Tromp, J.A.H. (2001) Algorithmic statistics.
    IEEE Transactions on Information Theory, Vol. 47 (pp 2443-2463)

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