Search results

  • Full text

  • Document type

    • Publication year

  • Organisation

Results: 150
Number of items: 150
  • Vitanyi, P. M. B. (2002). Simple wait-free multireader register. Lecture Notes in Computer Science, 2508, 118-132.
  • Li, M., Tromp, J., & Vitanyi, P. M. B. (2002). Sharpening Occam's Razor. Lecture Notes in Computer Science, 2387, 411-419.
  • Vitanyi, P. M. B. (2002). Meaningful information. Lecture Notes in Computer Science, 2518, 588-599.
  • Vereshchagin, N. K., & Vitanyi, P. M. B. (2002). Kolmogorov's structure functions and an application to the foundations of model selection. In Proceedings of the 47th annual IEEE conference on Foundations of Computer Science (pp. 741-748). IEEE Computer Society Press.
  • Haldar, S., & Vitanyi, P. M. B. (2002). Bounded concurrent timestamp systems using vector clocks. Journal of the Association for Computing Machinery, 49(1), 101-123. https://doi.org/10.1145/505241.505246
  • Jiang, T., Li, M., & Vitanyi, P. M. B. (2002). The average-case area of Heilbronn-type triangles. Random Structures & Algorithms, 20(2), 206-219. https://doi.org/10.1002/rsa.10024
  • Open Access
    van Dam, W. K. (2002). On quantum computation theory. [Thesis, fully internal, Universiteit van Amsterdam]. Institute for Logic, Language and Computation.
  • Chater, N., Vitanyi, P. M. B., & Steward, N. (2001). Universal generalization and universal inter-item confusability. Behavioral and Brain Sciences, 24(4), 559-660.
  • Vitanyi, P. M. B., Buhrman, H. M., & Tromp, J. A. H. (2001). Time and space bounds for reversible simulation. In Proc. ICALP 2001, Lecture Notes in Computer Science (pp. 1017-1027). Springer Verlag.
  • Vitanyi, P. M. B., Amano, K., Tromp, J. A. H., & Watanabe, O. (2001). On a generalized ruin problem. In Proc. RANDOM 2001, Lecture Notes in Computer Science (Vol. 2129, pp. 181-191). Springer Verlag.
Page 9 of 15