Buhrman, H., Grinko, D., Verduyn Lunel, Philip, Weggemans, Jordi (2024) Permutation tests for quantum state identity.

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

Buhrman, H., Hemaspaandra, L.A., Longpre, L. (1995) Sparse Reduces Conjunctively to Tally.

SIAM Journal on Computing, Vol. 24 (pp 673-681)

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

Buhrman, H., Hermo, M. (1995) On the Sparse Set Conjecture for Sets with Low Density.

In STACS'95 (Symposium on Theoretical Aspects of Computer Scienc 1995)

Buhrman, H., Hescott, B., Homer, S., Torenvliet, L. (2010) Non-uniform reductions.

Theory of Computing Systems, Vol. 47 (pp 317-341)

Article | https://doi.org/10.1007/s00224-008-9163-5 | UvA-DARE

Buhrman, H., Hitchcock, J.M. (2008) NP-hard sets are exponentially dense unless coNP C NP/poly.

In CCC 2008: Twenty-third Annual IEEE Conference on Computational Complexity: Proceedings: 23-26 June 2008, College Park, Maryland (pp 1-7). IEEE Computer Society.

Buhrman, H., Hoepman, J.H., Vitanyi, P.M.B. (1996) Optimal routing tables.

In Proc. 15th ACM Symp. on Principles of Distributed Computing (pp 134-142)

Buhrman, H., Hoyer, P., Massar, S., Röhrig, H.P. (2003) Combinatorics and quantum nonlocality.

Physical Review Letters, Vol. 91

Article | UvA-DARE

Buhrman, H., Høyer, Peter, Röhrig, Hein, Massar, S. (2006) Multipartite nonlocal quantum correlations resistant to imperfections.

Physical Review A - Atomic, Molecular, and Optical Physics, Vol. 73

Article | https://doi.org/10.1103/PhysRevA.73.012321 | UvA-DARE

Buhrman, H., Jiang, T., Li, M., Vitanyi, P.M.B. (2000) New applications of the incompressibility method: Part II.

Theoretical Computer Science, Vol. 235 (pp 59-70)

Article | https://doi.org/10.1016/S0304-3975(99)00184-X | UvA-DARE

Buhrman, H., Kadin, J., Thierauf, T. (1994) On functions computable with nonadaptive queries to NP.

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

Buhrman, H., Klauck, H., Vereshchagin, N.K., Vitanyi, P.M.B. (2007) Individual communication complexity.

Journal of Computer and System Sciences, Vol. 73 (pp 973-985)

Article | https://doi.org/10.1016/j.jcss.2007.03.015 | UvA-DARE

Buhrman, H., Klauck, H., Vereshchagin, N.K. (2004) Individual Communication Complexity.

In Proceedings of 21st SymposiumTheoretical Aspects of Computer Science (STACS) (pp 19-30). Springer Verlag.

Buhrman, H., Koucký, M., Loff, B., Speelman, F. (2016) Catalytic space: Non-determinism and hierarchy.

In Ollinger, N. Vollmer, H. (Eds.), 33rd Symposium on Theoretical Aspects of Computer Science: STACS'16, February 17-20, 2016, Orléans, France (Leibniz International Proceedings in Informatics, Vol. 47). Schloss Dagstuhl - Leibniz-Zentrum für Informatik.

Buhrman, H., Koucký, M., Loff, B., Speelman, F. (2018) Catalytic Space: Non-determinism and Hierarchy.

Theory of Computing Systems, Vol. 62 (pp 116-135)

Article | https://doi.org/10.1007/s00224-017-9784-7 | UvA-DARE

Buhrman, H., Koucký, M., Vereshchagin, N. (2008) Randomised individual communication complexity.

In CCC 2008: Twenty-third Annual IEEE Conference on Computational Complexity: Proceedings: 23-26 June 2008, College Park, Maryland (pp 321-331). IEEE Computer Society.

Buhrman, H., Laplante, S., Bro Miltersen, P. (2000) New bounds for the language compression problem.

In Proceedings 15th IEEE Conference on Computational Complexity

Buhrman, H., Lee, T.J., van Melkebeek, D. (2004) Language Compression and Pseudorandom Generators.

In 19th Annual IEEE Conference on Computational Complexity

Buhrman, H., Lee, T.J., van Melkebeek, D. (2005) Language compression and pseudorandom generators.

Computational Complexity, Vol. 14 (pp 247-274)

Article | UvA-DARE

Buhrman, H., Li, M., Vitanyi, P.M.B. (1997) Kolmogorov random graphs and the incompressibility method.

In Proceedings of Conference on Compression and Complexity of Sequences (pp 2-12). IEEE Computer Society Press.

Buhrman, H., Linden, N., Mančinska, L., Montanaro, A., Ozols, M. (2023) Quantum majority vote.

In Kalai, Y.T. (Eds.), 14th Innovations in Theoretical Computer Science Conference: ITCS 2023, January 10-13, 2023, MIT, Cambridge, Massachusetts, USA (Leibniz International Proceedings in Informatics, Vol. 251). Schloss Dagstuhl - Leibniz-Zentrum für Informatik.