-
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.
-
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. (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) 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.Chapter | UvA-DARELi, 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.Chapter | UvA-DARELi, 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-DARELi, 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-DARELi, 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.Chapter | UvA-DARELi, 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)Chapter | UvA-DARELi, M., Vitanyi, P.M.B. (1996) Space-Energy Trade-off in Reversible Simulations.In 4th Workshop on Physics and ComputationChapter | UvA-DARELi, M., Vitanyi, P.M.B. (1997) Average-case analysis using kolmogorov complexity.In Advances in Algorithms, Languages, and Complexity (pp 157-169). Kluwer Academic Publishers.Chapter | UvA-DARELi, 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.Chapter | UvA-DARELi, M., Vitanyi, P.M.B. (1997) Reversibility and adiabatic computation: Trading time and space for energy.Technical Report quant-ph. onbekend (FdL).Report | UvA-DARELi, M., Vitanyi, P.M.B. (1998) Miao shu fu za xing.Ke xue chu ban she.Li, M., Vitanyi, P.M.B. (2002) Algorithmic complexity.In Smelser, N.J. Baltes, P.B. (Eds.), International Encyclopedia of the Social & Behavioral Sciences (pp 376-382). Pergamon.Chapter | UvA-DARELi, M., Vitanyi, P.M.B. (2007) Applications of Algorithmic Information Theory.Scholarpedia Journal, Vol. 2Li, Ming, Chen, X., Lie, X., Ma, B., Vitanyi, P.M.B. (2003) Clustering by compression.In Proceedings International Symposium on Information Theory (pp 261-261)Conference contribution | UvA-DARELi, Ming, Tromp, J.A.H., Vitanyi, P.M.B. (2003) Sharpening Occam's Razor.Information Processing Letters, Vol. 85 (pp 267-274)
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