Search results

  • Full text

  • Document type

    • Publication year

  • Organisation

Results: 173
Number of items: 173
  • Newman, I., Buhrman, H. M., Fortnow, L., & Röhrig, H. (2001). Quantum property testing. (Technical Report; No. 2001-080). Instituut voor Taal en Communicatie.
  • Buhrman, H. M., Cleve, R., Watrous, J., & de Wolf, R. M. (2001). Quantum fingerprinting. Physical Review Letters, 87(16).
  • Buhrman, H. M., Fenner, S., Fortnow, L., & Torenvliet, L. (2001). Two oracles that force a big crunch. Computational Complexity, 10(16), 93-116. https://doi.org/10.1007/s00037-001-8190-2
  • 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
  • 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
  • Open Access
    de Wolf, R. M. (2001). Quantum Computing and Communication Complexity. [Thesis, fully internal, Universiteit van Amsterdam]. Institute for Logic, Language and Computation.
  • Ambainis, A., Buhrman, H. M., Gasarch, W. I., Kalayanasundaram, B., & Torenvliet, L. (2000). The communication complexity of enumeration, elimination and selection. In Proceedings 15th IEEE Conference on Computational Complexity: Florence (pp. 44-53)
  • Buhrman, H. M. (2000). Quantum computing and communication complexity. Bulletin of the European Association for Theoretical Computer Science, 70, 131-141.
  • 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.
Page 13 of 18