Search results

  • Full text

  • Document type

    • Publication year

  • Organisation

Results: 84
Number of items: 84
  • Buhrman, H. M., Dürr, C., Heiligman, M., Hoyer, P., Magniez, F., Santha, M., & de Wolf, R. M. (2005). Quantum Algorithms for Element Distinctness. SIAM Journal on Computing, 34(6), 1324-1330. https://doi.org/10.1137/S0097539702402780
  • Buhrman, H. M., Newman, I., Röhrig, H. P., & de Wolf, R. M. (2005). Robust Quantum Algorithms and Polynomials. In Proceedings of STACS 2005 (Vol. 3404, pp. 593-604). Springer.
  • Klauck, H., Spalek, R., & de Wolf, R. M. (2004). Quantum and Classical Strong Direct Product Theorems and Optimal Time-Space Tradeoffs. In Proceedings of 45th IEEE FOCS (pp. 12-21) http://homepages.cwi.nl/~sr/papers/ksw.pdf
  • Cilibrasi, R., de Wolf, R. M., & Vitanyi, P. M. B. (2004). Algorithmic Clustering of Music. In Proceedings of IEEE 4th International Conference on Web Delivering of Music (pp. 110-117). IEEE Computer Soc. Press.
  • Cilibrasi, R., Vitanyi, P. M. B., & de Wolf, R. M. (2004). Algorithmic clustering of music based on string compression. Computer Music Journal, 28(4), 49-67.
  • Buhrman, H. M., & de Wolf, R. M. (2003). Quantum zero error algorithms cannot be composed. Information Processing Letters, 87(2), 79-84. https://doi.org/10.1016/S0020-0190(03)00254-0
  • Cilibrasi, R., Vitanyi, P. M. B., & de Wolf, R. M. (2003). Algorithm Clustering of Music. ERCIM News, 54, 53-53.
  • Buhrman, H. M., & de Wolf, R. M. (2002). Complexity measures and decision tree complexity: a survey. Theoretical Computer Science, 288(1), 21-43. https://doi.org/10.1016/S0304-3975(01)00144-X
  • de Graaf, M. G., & de Wolf, R. M. (2002). On quantum versions of the yao principle. Lecture Notes in Computer Science, 2285, 247-358.
  • Beals, C. R., Buhrman, H. M., Cleve, R., Mosca, M., & de Wolf, R. M. (2001). Quantum Lower Bounds by Polynomials. Journal of the Association for Computing Machinery, 48(4), 778-797. https://doi.org/10.1145/502090.502097
Page 7 of 9