Search results

  • Full text

  • Document type

    • Publication year

  • Organisation

Results: 150
Number of items: 150
  • Buhrman, H. M., Jiang, T., Li, M., & Vitanyi, P. M. B. (2000). New applications of the incompressibility method: Part II. Theoretical Computer Science, 235(1), 59-70. https://doi.org/10.1016/S0304-3975(99)00184-X
  • Buhrman, H. M., Panconesi, A., Silvestri, R., & Vitanyi, P. M. B. (2000). On the importance of having an identity or, is consensus really universal. In Distributed Computing Conference (Vol. 1914, pp. 134-148). Springer Verlag.
  • Gao, Q., Li, M., & Vitanyi, P. M. B. (2000). Applying MDL to learning best model granularity. Artificial Intelligence, 121(1-2), 1-29. https://doi.org/10.1016/S0004-3702(00)00034-5
  • Jiang, T., Li, M., & Vitanyi, P. M. B. (2000). A lower bound on the average-case complexity of Shellsort. Journal of the Association for Computing Machinery, 47(5), 905-911. https://doi.org/10.1145/355483.355488
  • Jiang, T., Li, M., & Vitanyi, P. M. B. (2000). Average-case complexity of Stacksort and Queuesort. Journal of Computer Science and Technology.
  • Tromp, J., Buhrman, H. M., Li, M., & Vitanyi, P. M. B. (2000). Kolmogorov random graphs and the incompressibility method. SIAM Journal on Computing, 29(2), 590-599. https://doi.org/10.1137/S0097539797327805
  • Vitanyi, P. M. B. (2000). A discipline of evolutionary programming. Theoretical Computer Science, 241(1-2), 3-23. https://doi.org/10.1016/S0304-3975(99)00263-7
  • Vitanyi, P. M. B., & Li, M. (2000). Minimum Description Length Induction, Baysianism, and Kolmogorov Complexity. IEEE Transactions on Information Theory, 46(2), 446-464. https://doi.org/10.1109/18.825807
  • Open Access
    Terhal, B. M. (1999). Quantum Algorithms and Quantum Entanglement. [Thesis, fully internal, Universiteit van Amsterdam].
  • Vitanyi, P. M. B. (1998). Information distance. IEEE Transactions on Information Theory, 44(4), 1407-1423. https://doi.org/10.1109/18.681318
Page 11 of 15