Search results

  • Full text

  • Document type

    • Publication year

  • Organisation

Results: 150
Number of items: 150
  • 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.
  • Jiang, T., Seiferas, J., & Vitanyi, P. M. B. (1997). Two heads are better than two tapes. Journal of the Association for Computing Machinery, 237-256.
  • 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.
  • Cramer, R. (1997). Modular design of secure yet practical cryptographic protocols. [Thesis, fully internal, Universiteit van Amsterdam].
  • 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
  • Vitanyi, P. M. B., & Li, M. (1996). Average-Case Analysis Using Kolmogorov Complexity. In Ron Book Memorial Volume 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; No. 452). Royal Society of London.
  • Vitanyi, P. M. B. (1996). Genetic fitness optimization using rapidly mixing Markov chains. In Proc. 7th Int'nl Workshop on Algorithmic Learning Theory (pp. 67-82). (Lecture Notes in Artificial Intelligence; No. 1160). Springer-Verlag.
  • 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)
Page 13 of 15