Search results

  • Full text

  • Document type

    • Publication year

  • Organisation

Results: 173
Number of items: 173
  • 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
  • Open Access
    Buhrman, H. M., Hoyer, P., Massar, S., & Röhrig, H. P. (2003). Combinatorics and quantum nonlocality. Physical Review Letters, 91(4).
  • Buhrman, H. M., Miltersen, P. B., & Radhakrishnan, J. (2002). Are bitvectors optimal. SIAM Journal on Computing, 31(6), 1723-1744. https://doi.org/10.1137/S0097539702405292
  • 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
  • Buhrman, H. M., & Longpre, L. (2002). Compressibility and resource bounded measure. SIAM Journal on Computing, 31(3), 876-886.
  • Allender, E., Buhrman, H. M., Kouck, M., van Melkebeek, D., & Ronneburger, D. (2002). Power from random strings. In Proceedings of the 43d annual IEEE conference on Foundations of Computer Science (pp. 669-678). IEEE Computer Society Press.
  • Ambainis, A., Buhrman, H. M., Gasarch, W. I., Kalayanasundaram, B., & Torenvliet, L. (2001). The communication complexity of enumeration, elimination and selection. Journal of Computer and System Sciences, 63(2), 148-184. https://doi.org/10.1006/jcss.2001.1761
  • 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
  • Buhrman, H. M., Dürr, C., Heiligman, M., Høyer, P., Magniez, F., Santha, M., & de Wolf, R. M. (2001). Quantum algorithms for element distinctness. In In Proceedings of 16th IEEE Conference on Computational Complexity (pp. 131-137)
  • Buhrman, H. M., & de Wolf, R. M. (2001). Communication complexity lower bounds by polynomials. In Proceedings of 16th IEEE Conference on Computational Complexity (pp. 120-130)
Page 12 of 18