Search results

  • Full text

  • Document type

    • Publication year

  • Organisation

Results: 173
Number of items: 173
  • Buhrman, H., van der Gulik, P. T. S., Kelk, S. M., Koolen, W. M., & Stougie, L. (2011). Some mathematical refinements concerning error minimization in the genetic code. IEEE/ACM Transactions on Computational Biology and Bioinformatics, 8(5), 1358-1372. https://doi.org/10.1109/TCBB.2011.40
  • Buhrman, H., Regev, O., Scarpa, G., & de Wolf, R. (2011). Near-Optimal and Explicit Bell Inequality Violations. In 26th IEEE Conference on Computational Complexity: proceedings : San Jose, California, 8-10 June 2011 (pp. 157-166). IEEE Computer Society. https://doi.org/10.1109/CCC.2011.30
  • Open Access
    Briët, J., Buhrman, H., & Toner, B. (2011). A Generalized Grothendieck Inequality and Nonlocal Correlations that Require High Entanglement. Communications in Mathematical Physics, 305(3), 827-843. https://doi.org/10.1007/s00220-011-1280-3
  • Open Access
    Buhrman, H., Chandran, N., Fehr, S., Gelles, R., Goyal, V., Ostrovsky, R., & Schaffner, C. (2011). Position-based quantum cryptography: impossibility and constructions. In P. Rogaway (Ed.), Advances in Cryptology – CRYPTO 2011: 31st Annual Cryptology Conference, Santa Barbara, CA, USA, August 14-18, 2011: proceedings (pp. 429-446). (Lecture Notes in Computer Science; Vol. 6841). Springer. https://doi.org/10.1007/978-3-642-22792-9_24
  • Open Access
    Briët, J. (2011). Grothendieck inequalities, nonlocal games and optimization. [Thesis, fully internal, Universiteit van Amsterdam]. Institute for Logic, Language and Computation.
  • Buhrman, H., Fortnow, L., Koucký, M., & Loff, B. (2010). Derandomizing from random strings. In 25th Annual IEEE Conference on Computational Complexity: proceedings : CCC 2010 : 9-11 June, 2010, Cambridge, Massachusetts, USA (pp. 58-63). IEEE Computer Society. https://doi.org/10.1109/CCC.2010.15
  • Open Access
    Buhrman, H., Fortnow, L., Koucký, M., Rogers, J. D., & Vereshchagin, N. (2010). Does the polynomial hierarchy collapse if onto functions are invertible? Theory of Computing Systems, 46(1), 143-156. https://doi.org/10.1007/s00224-008-9160-8
  • Open Access
    Buhrman, H., Hescott, B., Homer, S., & Torenvliet, L. (2010). Non-uniform reductions. Theory of Computing Systems, 47(2), 317-341. https://doi.org/10.1007/s00224-008-9163-5
  • Open Access
    Buhrman, H., Cleve, R., Massar, S., & de Wolf, R. (2010). Nonlocality and communication complexity. Reviews of Modern Physics, 82(1), 665-698. https://doi.org/10.1103/RevModPhys.82.665
  • Allcock, J., Buhrman, H., & Linden, N. (2009). Arbitrarily little knowledge can give a quantum advantage for nonlocal tasks. Physical Review A, 80(3), 032105. https://doi.org/10.1103/PhysRevA.80.032105
Page 7 of 18