Search results

  • Full text

  • Document type

    • Publication year

  • Organisation

Results: 150
Number of items: 150
  • Li, 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.
  • 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; No. 1279). Springer-Verlag.
  • Vitanyi, P. M. B., & Li, M. (1997). On prediction by data compression. In Proc. 9th European Conference on Machine Learning (pp. 14-30). (Lecture Notes in Artificial Intelligence; No. 1224). Springer-Verlag.
  • Li, M., & Vitanyi, P. M. B. (1997). Reversibility and adiabatic computation: Trading time and space for energy. (Technical Report quant-ph; No. 9703022). onbekend (FdL).
  • Buhrman, H. M., Li, M., & Vitanyi, P. M. B. (1997). Kolmogorov random graphs and the incompressibility method. In Proceedings of Conference on Compression and Complexity of Sequences (pp. 2-12). IEEE Computer Society Press.
  • Li, M., & Vitanyi, P. M. B. (1996). Space-Energy Trade-off in Reversible Simulations. In 4th Workshop on Physics and Computation
  • Vitanyi, P. M. B., & Li, M. (1996). Average-Case Analysis Using Kolmogorov Complexity. In Ron Book Memorial Volume Springer-Verlag.
  • Buhrman, H. M., Hoepman, J. H., & Vitanyi, P. M. B. (1996). Optimal routing tables. In Proc. 15th ACM Symp. on Principles of Distributed Computing (pp. 134-142)
  • Vitanyi, P. M. B., & Li, M. (1996). Reversible simulation of irreversible computation. In Proc. 11th IEEE Conference on Computational Complexity (pp. 301-306)
  • Li, M., Tromp, J., & Vitanyi, P. M. B. (1996). How to share concurrent wait-free variables. Journal of the Association for Computing Machinery, 43, 723-746. https://doi.org/10.1145/234533.234556
Page 13 of 15