- Visser, A. (1997). Prolegomena to the definition of dynamic predicate logic with local assignments. (Research report Logic Group Preprint Series; No. 178). Universiteit Utrecht. >>>
- 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 M. de Rijke, A. Ponse, & Y. Venema (Eds.), Modal Logic and process Algebra, a bisimulation perspective (pp. 289-326). Center for the Study of Language and Information. >>>
- Visser, H., & van Benthem, J. F. A. K. (2009). Inleiding. In E. W. Beth (Ed.), Door wetenschap tot wijsheid : verzameling wijsgerige studiën (Amsterdam Academic Archive). Amsterdam University Press. >>>
- Vitányi, P. (1995). Computational learning theory: second European conference, EuroCOLT '95, Barcelona, Spain, March 13-15, 1995: proceedings. (Lecture notes in computer science; No. 904). Springer. https://doi.org/10.1007/3-540-59119-2 >>>
- Vitányi, P. (2008). Registers. In M-Y. Kao (Ed.), Encyclopedia of algorithms (pp. 761-764). (Springer reference). Springer. https://doi.org/10.1007/978-0-387-30162-4_338 >>>
- Vitányi, P. (2008). A great mind. In P. Grünwald, P. Myllymäki, I. Tabus, M. Weinberger, & B. Yu (Eds.), Festschrift in honor of Jorma Rissanen on the occasion of his 75th birthday (pp. 305-309). (TICSP series; No. 38). Tampere International Center for Signal Processing (TICSP). http://www.cs.tut.fi/~tabus/TICSP_38_17.4.%2008.pdf >>>
- Vitányi, P. (2015). On The Average-Case Complexity of Shellsort. (2 ed.) ArXiv. https://arxiv.org/abs/1501.06461v2 >>>
- Vitanyi, P. (2016). Registers. In M-Y. Kao (Ed.), Encyclopedia of Algorithms (2 ed., pp. 1808-1812). Springer Reference. https://doi.org/10.1007/978-1-4939-2864-4_338 >>>
- Vitányi, P. (2018). On the average-case complexity of Shellsort. Random Structures and Algorithms, 52(2), 354-363. Advance online publication. https://doi.org/10.1002/rsa.20737 >>>
- Vitanyi, P. M. B. (1999). The Erdos graph and the beast. Mathematical Intelligencer, 21(3), 54-55. >>>
- 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 (Vol. 2129, pp. 181-191). Springer Verlag. >>>
- Vitányi, P. M. B., Balbach, F. J., Cilibrasi, R. L., & Li, M. (2008). Normalized information distance. Institute for Logic, Language and Computation. http://arxiv.org/abs/0809.2553 >>>
- Vitányi, P. M. B., Balbach, F. J., Cilibrasi, R. L., & Li, M. (2009). Normalized information distance. In F. Emmert-Streib, & M. Dehmer (Eds.), Information theory and statistical learning (pp. 45-82). Springer. https://doi.org/10.1007/978-0-387-84816-7_3 >>>
- 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. >>>
- Vitányi, P. M. B., & Chater, N. (2017). Identification of probabilities. Journal of Mathematical Psychology, 76(A), 13-24. Advance online publication. https://doi.org/10.1016/j.jmp.2016.11.004 >>>
- Vitanyi, P. M. B., & Cilibrasi, R. (2007). The Google similarity distance. IEEE Transactions on Knowledge & Data Engineering, 19(3), 370-383. https://doi.org/10.1109/TKDE.2007.48 >>>
- Vitanyi, P. M. B., & Cilibrasi, R. (2014). A Fast Quartet Tree Heuristic for Hierarchical Clustering. (arXiv). Cornell University Library. https://arxiv.org/abs/1409.4276 >>>
- Vitányi, P. M. B., & Cilibrasi, R. L. (2010). Normalized web distance and word similarity. In N. Indurkhya, & F. J. Damerau (Eds.), Handbook of natural language processing (pp. 293-314). (Chapman & Hall/CRC machine learning & pattern recognition series). CRC Press. http://www.crcnetbase.com/doi/abs/10.1201/9781420085938-c13 >>>
- Vitanyi, P. M. B., & Cohen, A. R. (2011). Normalized Compression Distance of Multiples. (arXiv). Cornell University Library. https://arxiv.org/abs/1212.5711 >>>
- Vitanyi, P. M. B., & Cohen, A. R. (2015). Web Similarity. (ArXiv; Vol. 1502.0595). Cornell University Library. https://arxiv.org/abs/1502.05957 >>>
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