Li, Jiaxin, Henry, N., Han, Han, Lostanlen, Vincent, Burgoyne, J.A., Honing, H. (2025) What do we listen to when listening to familiar music? A large-scale cross-cultural study probing the capacity for music using a variety of corpora.

Abstract | UvA-DARE

Li, L., Titov, I., Sporleder, C. (2014) Improved Estimation of Entropy for Evaluation of Word Sense Induction.

Computational Linguistics, Vol. 40 (pp 671-685)

Article | https://doi.org/10.1162/COLI_a_00196 | UvA-DARE

Li, L. (2023) Games, boards and play: A logical perspective.

ILLC Dissertation Series

Thesis, fully internal | UvA-DARE

Li, M., Chen, X., Li, B., Vitanyi, P.M.B. (2004) The similarity metric.

IEEE Transactions on Information Theory, Vol. 50 (pp 3250-3264)

Article | https://doi.org/10.1109/TIT.2004.838101 | UvA-DARE

Li, M., Chen, X., Li, X., Ma, B., Vitanyi, P. (2003) The similarity metric.

In Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms: SODA '03 : Baltimore, MD, January 12-13, 2003 (pp 863-872). Association for Computing Machinery.

Li, M., Tromp, J., Vitanyi, P.M.B. (1996) How to share concurrent wait-free variables.

Journal of the Association for Computing Machinery, Vol. 43 (pp 723-746)

Article | https://doi.org/10.1145/234533.234556 | UvA-DARE

Li, M., Tromp, J., Vitanyi, P.M.B. (1997) Reversible simulation of irreversible computation by pebble games.

Technical Report quant-ph. onbekend (FdL).

Report | UvA-DARE

Li, M., Tromp, J., Vitanyi, P.M.B. (2002) Sharpening Occam's Razor.

Lecture Notes in Computer Science, Vol. 2387 (pp 411-419)

Article | UvA-DARE

Li, M., Vitányi, P. (2008) An introduction to Kolmogorov complexity and its applications. - 3rd edition.

Texts in computer science. Springer.

Book | https://doi.org/10.1007/978-0-387-49820-1 | UvA-DARE

Li, M., Vitanyi, P.M.B. (1994) Inductive Reasoning.

In Ristad, E.S. (Eds.), {Language Computations; Proc. DIMACS Workshop on Human Language, March 20-22, 1992 (pp 127-148) (DIMACS Series in Discrete Mathematics and Theoretical Compue). American Math. Society.

Li, M., Vitanyi, P.M.B. (1994) Kolmogorov complexity arguments in combinatorics.

Journal of Combinatorial Theory. Series A, Vol. 66 (pp 226-236)

Article | https://doi.org/10.1016/0097-3165(94)90064-7 | UvA-DARE

Li, M., Vitanyi, P.M.B. (1994) Statistical properties of finite sequences with high Kolmogorov complexity.

Mathematical Systems Theory, Vol. 27 (pp 365-376)

Article | https://doi.org/10.1007/BF01192146 | UvA-DARE

Li, M., Vitanyi, P.M.B. (1995) Correction to: Kolmogorov complexity arguments in Combinatorics.

Journal of Combinatorial Theory. Series A, Vol. 69 (pp 183)

Erratum / Corrigendum | UvA-DARE

Li, M., Vitanyi, P.M.B. (1995) A new approach to formal language theory by Kolmogorov complexity.

SIAM Journal on Computing, Vol. 24 (pp 398-410)

Article | https://doi.org/10.1137/S009753979324485X | UvA-DARE

Li, M., Vitanyi, P.M.B. (1995) Computational Machine Learning in Theory and Praxis.

In Computer Science Today (pp 518-535) (Lecture Notes in Computer Science). Springer Verlag.

Li, M., Vitanyi, P.M.B. (1996) Reversibility and adiabatic computation: trading time and space for energy.

In Proc. Royal Society of London (pp 769-789) (A). Royal Society of London.

Li, M., Vitanyi, P.M.B. (1996) Ideal MDL and Its Relation To Bayesianism.

In Proc. ISIS: Information, Statistics and Induction in Science, Melbourne, Australia (pp 282-291)

Li, M., Vitanyi, P.M.B. (1996) Space-Energy Trade-off in Reversible Simulations.

In 4th Workshop on Physics and Computation

Li, M., Vitanyi, P.M.B. (1997) Reversibility and adiabatic computation: Trading time and space for energy.

Technical Report quant-ph. onbekend (FdL).

Report | UvA-DARE

Li, M., Vitanyi, P.M.B. (1997) Average-case analysis via incompressibility.

In Proc. 11th Conference on Fundamentals of Computation Theory (pp 38-50) (Lecture Notes in Computer Science). Springer-Verlag.