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.

Buhrman, H., Torenvliet, L., Unger, F.P. (2006) Spare Self-reducible sets and polynomial size circuit lower bounds.

In Proceedings of STACS 2006 (pp 455-468). Springer.

Buhrman, H., Torenvliet, L., Unger, Falk, Vereshchagin, N. (2019) Sparse Selfreducible Sets and Nonuniform Lower Bounds.

Algorithmica, Vol. 81 (pp 179-200)

Article | https://doi.org/10.1007/S00453-018-0439-0 | UvA-DARE

Buhrman, H., Torenvliet, L. (1994) On the cutting edge of relativization: The resource bounded injury method.

In Shamir, E. Abiteboul, S. (Eds.), Proc. ICALP 94 (pp 263-273) (Lecture Notes in Computer Science). Springer Verlag.

Buhrman, H., Torenvliet, L. (1994) On the structure of complete sets.

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

Buhrman, H., Torenvliet, L. (1996) Complete sets and structure in sub-recursive classes.

In Logic Colloquium 96: European Summer Meeting of the Association for Symbolic Logic (pp 59-64)

Buhrman, H., Torenvliet, L. (1996) P-selective self-reducible sets: A new characterization of P.

Journal of Computer and System Sciences, Vol. 53 (pp 210-217)

Article | https://doi.org/10.1006/jcss.1996.0062 | UvA-DARE

Buhrman, H., Torenvliet, L. (1998) Complete sets and structure in subrecursive classes.

Lecture Notes in Logic, Vol. 12 (pp 45-78)

Article | UvA-DARE

Buhrman, H., Torenvliet, L. (1998) Complete sets and structure in subrecursive classes.

In Proceedings of the logic colloquium '96 (pp 45-78) (-)