Buhrman, H., Loff, B., Patro, S., Speelman, F. (2022) Limits of Quantum Speed-Ups for Computational Geometry and Other Problems: Fine-Grained Complexity via Quantum Walks.

In Braverman, M. (Eds.), 13th Innovations in Theoretical Computer Science Conference: ITCS 2022, January 31-February 3, 2022, Berkeley, CA, USA (Leibniz International Proceedings in Informatics, Vol. 215). Schloss Dagstuhl - Leibniz-Zentrum für Informatik.

Buhrman, H., Loff, B., Patro, S., Speelman, F. (2022) Memory Compression with Quantum Random-Access Gates.

In Le Gall, F. Morimae, T. (Eds.), 17th Conference on the Theory of Quantum Computation, Communication and Cryptography: TQC 2022, July 11–15, 2022, Urbana Champaign, Illinois, USA (Leibniz International Proceedings in Informatics, Vol. 232). Schloss Dagstuhl - Leibniz-Zentrum für Informatik.

Buhrman, H., Loff, B., Torenvliet, L. (2015) Hardness of approximation for Knapsack problems.

Theory of Computing Systems, Vol. 56 (pp 372-393)

Article | https://doi.org/10.1007/s00224-014-9550-z | UvA-DARE

Buhrman, H., Longpre, L. (1996) Compressibility and resource bounded measure.

In proc STACS'96 (pp 13-24) (LNCS). Springer.

Buhrman, H., Longpre, L. (2002) Compressibility and resource bounded measure.

SIAM Journal on Computing, Vol. 31 (pp 876-886)

Article | UvA-DARE

Buhrman, H., Massar, S. (2005) Causality and Tsirelson's Bounds.

Physical Review A, Vol. 72

Article | UvA-DARE

Buhrman, H., Mayordomo, E. (1995) An excursion to the Kolmogorov Random Strings.

In STRUCTURES'95 (10th Conference on Structure In Complexity Theoy)

Buhrman, H., Miltersen, P.B., Radhakrishnan, J. (2002) Are bitvectors optimal.

SIAM Journal on Computing, Vol. 31 (pp 1723-1744)

Article | https://doi.org/10.1137/S0097539702405292 | UvA-DARE

Buhrman, H., Newman, I., Röhrig, H.P., de Wolf, R. (2005) Robust Quantum Algorithms and Polynomials.

In Proceedings of STACS 2005 (pp 593-604). Springer.

Buhrman, H., Newman, I., Röhrig, H.P., de Wolf, R. (2007) Robust Polynomials and Quantum Algorithms.

Journal of Computer and System Sciences, Vol. 40 (pp 379-395)

Article | UvA-DARE

Buhrman, H., Orponen, P. (1994) Random strings make hard instances.

In Schoening, U. (Eds.), Proc. Structure in Complexity Theory, 9th annual conference (pp 217-223). IEEE Computer Society Press.

Buhrman, H., Panconesi, A., Silvestri, R., Vitanyi, P. (2006) On the importance of having an identity or, is consensus really universal?.

Distributed Computing, Vol. 18 (pp 167-176)

Article | https://doi.org/10.1007/s00446-005-0121-z | UvA-DARE

Buhrman, H., 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 (pp 134-148). Springer Verlag.

Buhrman, H., Patro, S., Speelman, F. (2019) The Quantum Strong Exponential-Time Hypothesis.

ArXiv.

Preprint | https://doi.org/10.48550/arXiv.1911.05686 | UvA-DARE

Buhrman, H., Patro, S., Speelman, F. (2021) A Framework of Quantum Strong Exponential-Time Hypotheses.

In Bläser, M. Monmege, B. (Eds.), 38th International Symposium on Theoretical Aspects of Computer Science: STACS 2021, March 16–19, 2021, Saarbrücken, Germany (Virtual Conference) (Leibniz International Proceedings in Informatics, Vol. 187). Schloss Dagstuhl - Leibniz-Zentrum für Informatik.

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.

Buhrman, H., Regev, O., Scarpa, G., de Wolf, R. (2012) Near-Optimal and Explicit Bell Inequality Violations.

Theory of Computing, Vol. 8 (pp 623-645)

Article | https://doi.org/10.4086/toc.2012.v008a027 | UvA-DARE

Buhrman, H., Röhrig, H.P. (2003) Distributed quantum computing.

In Proceedings of Mathematical Foundations of Computer Science (pp 1-20) (Lecture Notes in Computer Science, Vol. 2747). Springer.

Buhrman, H., Spalek, R. (2006) Quantum Verification of Matrix Products.

In Proceedings of 17th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA'06) (pp 880-889). ACM Press.

Buhrman, H., Thierauf, T. (1996) The complexity of generating and checking proofs of membership.

In proc STACS'96 (pp 75-86) (LNCS). Springer.