uva.nl

Institute for Logic, Language and Computation

Searchable List of Research Output

Filter Publications
  • Vitanyi, P.M.B. (2000) The quantum computing challenge.
    Lecture Notes in Computer Science, Vol. 2000 (pp 219-233)
    Article | UvA-DARE
  • Vitanyi, P.M.B. (2000) A discipline of evolutionary programming.
    Theoretical Computer Science, Vol. 241 (pp 3-23)
  • Vitanyi, P.M.B. (2000) Three Approaches to the Quantitative Definition of Information in Individual Pure Quantum State.
    In Proceedings 15th IEEE Conference on Computational Complexity (pp 263-270)
    Conference contribution | UvA-DARE
  • Vitanyi, P.M.B. (2001) Quantum kolmogorov complexity based on classical descriptions.
    IEEE Transactions on Information Theory, Vol. 47 (pp 2464-2479)
  • Vitanyi, P.M.B. (2001) Turingmachine gaat nog duizend jaar mee.
    Automatiserings Gids (pp 19-19)
    Article | UvA-DARE
  • Vitanyi, P.M.B. (2002) Simple wait-free multireader register.
    Lecture Notes in Computer Science, Vol. 2508 (pp 118-132)
    Article | UvA-DARE
  • Vitanyi, P.M.B. (2002) Meaningful information.
    Lecture Notes in Computer Science, Vol. 2518 (pp 588-599)
    Article | UvA-DARE
  • Vitanyi, P.M.B. (2005) Universal Similarity.
    In Proceedings of Information Theory Workshop 2005 on Coding and Complexity
    Conference contribution | UvA-DARE
  • Vitanyi, P.M.B. (2005) Time, Space and Energy in Reversible Computing.
    Proceedings of the ACM SIGCPR (special interest group in comp. personnel res.) Conference (pp 435-444)
    Article | UvA-DARE
  • Vitanyi, P.M.B. (2006) Meaningful information.
    IEEE Transactions on Information Theory, Vol. 52 (pp 4617-4626)
  • Vitanyi, P.M.B. (2006) Universal similarity based on compression.
    Surikagaku, Vol. 519 (pp 54-59)
    Article | UvA-DARE
  • Vitanyi, P.M.B. (2007) Algorithmic chaos and the incompressibility method.
    In Charpentier, E Lesne, A. Nikolski, N. (Eds.), Kolmogorov's Heritage in Mathematics (pp 301-317). Springer.
    Chapter | UvA-DARE
  • Vitanyi, P.M.B. (2007) Analysis of Sorting Algorithms by Kolmogorov Complexity (A Survey).
    In Csiszar, I. Katona, G.O.H. Tardos, G. (Eds.), Entropy, Search, Complexity (pp 209-232). Springer-Verlag.
    Chapter | UvA-DARE
  • Vitanyi, P.M.B. (2007) Andrey Nikolaevich Kolmogorov.
    Scholarpedia Journal, Vol. 2
    Article | UvA-DARE
  • Vitanyi, P.M.B. (2009) Turing machine.
    Scholarpedia Journal, Vol. 4 (pp 6240)
  • Vitanyi, P.M.B. (2010) Ray Solomonoff, founding father of algorithmic information theory [Obituary].
    Algorithms, Vol. 3 (pp 260-264)
  • Vitányi, P.M.B. (2011) Information distance in multiples.
    IEEE Transactions on Information Theory, Vol. 57 (pp 2451-2456)
  • Vitányi, P.M.B. (2011) Compression-based similarity.
    In First International Conference on Data Compression, Communication and Processing: CCP 2011 : Palinuro, Cilento Coast, Italy, 21-24 June 2011 : proceedings (pp 111-118). IEEE.
    Conference contribution | https://doi.org/10.1109/CCP.2011.50 | UvA-DARE
  • Vitányi, P.M.B. (2012) Tolstoy's mathematics in 'War and Peace'.
    Mathematical Intelligencer, Vol. 35 (pp 71-75)
  • Vitányi, P.M.B. (2012) Conditional Kolmogorov Complexity and Universal Probability.
    ArXiv.
1 ... 293 294 295 296 297 298 299 300 301 ... 312

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