Search results

  • Full text

  • Document type

    • Publication year

  • Organisation

Results: 150
Number of items: 150
  • Buhrman, H. M., Tromp, J. A. H., & Vitanyi, P. M. B. (2001). Time and space bounds for reversible simulation. Journal of Physics. A, Mathematical and General, 34, 6821-6830. https://doi.org/10.1088/0305-4470/34/35/308
  • Open Access
    Vitanyi, P. M. B. (2001). Quantum kolmogorov complexity based on classical descriptions. IEEE Transactions on Information Theory, 47(6), 2464-2479. https://doi.org/10.1109/18.945258
  • Open Access
    de Wolf, R. M. (2001). Quantum Computing and Communication Complexity. [Thesis, fully internal, Universiteit van Amsterdam]. Institute for Logic, Language and Computation.
  • Open Access
    Vitanyi, P. M. B., Gács, P., & Tromp, J. A. H. (2001). Algorithmic statistics. IEEE Transactions on Information Theory, 47(6), 2443-2463. https://doi.org/10.1109/18.945257
  • Jiang, T., Li, M., & Vitanyi, P. M. B. (2000). Average-case analysis of algorithms using Kolgromov complexity. Journal of Computer Science and Technology, 15(5), 402-408. https://doi.org/10.1007/BF02950402
  • 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.
Page 10 of 15